The kmeans-vector package
Provides a simple (but efficient) implementation of the k-means clustering algorithm. The goal of this algorithm is to, given a list of n-dimensional points, regroup them in k groups, such that each point gets to be in the group to which it is the closest to (using the center of the group).
CHANGELOG
kmeans-vector-0.2 supports having feature vectors associated to objects, and thus computing kmeans on these vectors, letting you recover the initial objects.
Properties
| Versions | 0.1, 0.1.1, 0.2 |
|---|---|
| Dependencies | base (4.*), vector (≥0.7) |
| License | BSD3 |
| Copyright | 2011-2012 Alp Mestanogullari |
| Author | Alp Mestanogullari <alpmestan@gmail.com>, Ville Tirronen |
| Maintainer | Alp Mestanogullari <alpmestan@gmail.com> |
| Stability | Experimental |
| Category | Math |
| Home page | http://github.com/alpmestan/kmeans-vector |
| Bug tracker | https://github.com/alpmestan/kmeans-vector/issues |
| Source repository | git clone http://github.com/alpmestan/kmeans-vector.git |
| Upload date | Wed Apr 4 18:35:47 UTC 2012 |
| Uploaded by | AlpMestanogullari |
| Built on | ghc-7.4 |
Modules
- Math
Downloads
- kmeans-vector-0.2.tar.gz (Cabal source package)
- package description (included in the package)