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).
Sample output (after some gnuplot hackery -- see the tests dir in the repository): http://i.imgur.com/IpIPC.png
Expect some improvements on the initial clustering, thus resulting in a better clustering, for future versions.
Properties
| Versions | 0.1, 0.1.1, 0.2 |
|---|---|
| Dependencies | base (4.*), vector (≥0.7) |
| License | BSD3 |
| Copyright | 2011 Alp Mestanogullari |
| Author | Alp Mestanogullari <alpmestan@gmail.com> |
| 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 | Sun Oct 9 18:08:09 UTC 2011 |
| Uploaded by | AlpMestanogullari |
| Built on | ghc-7.2 |
Modules
- Math
Downloads
- kmeans-vector-0.1.tar.gz (Cabal source package)
- package description (included in the package)