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 set 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).
0.3: total rewrite of the code, the code scales much better on big inputs and is overall consistently faster than the other kmeans implementations on hackage, on my laptop. 0.2: supports having feature vectors associated to objects, and thus computing kmeans on these vectors, letting you recover the initial objects.
- No changelog available
|Versions||0.1, 0.1.1, 0.2, 0.3|
|Dependencies||base (==4.*), kmeans-vector, mtl (>=2.1), QuickCheck, vector (>=0.7)|
|Copyright||2011-2014 Alp Mestanogullari|
|Author||Alp Mestanogullari <firstname.lastname@example.org>, Ville Tirronen|
|Maintainer||Alp Mestanogullari <email@example.com>|
|Source repository||head: git clone http://github.com/alpmestan/kmeans-vector.git|
|Upload date||Thu Jun 5 10:17:07 UTC 2014|
|Downloads||261 total (23 in last 30 days)|
- kmeans-vector-0.3.tar.gz [browse] (Cabal source package)
- Package description (included in the package)
For package maintainers and hackage trustees