kmeans-vector: An implementation of the kmeans clustering algorithm based on the 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).
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.
2: supports having feature vectors associated to objects, and thus computing kmeans on these vectors, letting you recover the initial objects.
|Versions [RSS]||0.1, 0.1.1, 0.2, 0.3, 0.3.1, 0.3.2|
|Dependencies||base (>=4 && <5), kmeans-vector, mtl (>=2.1), probable, vector (>=0.7) [details]|
|Copyright||2011-2015 Alp Mestanogullari|
|Author||Alp Mestanogullari <firstname.lastname@example.org>, Ville Tirronen|
|Maintainer||Alp Mestanogullari <email@example.com>|
|Source repo||head: git clone http://github.com/alpmestan/kmeans-vector.git|
|Uploaded||by AlpMestanogullari at 2015-07-28T15:08:40Z|
|Reverse Dependencies||1 direct, 0 indirect [details]|
|Downloads||4093 total (2 in the last 30 days)|
|Rating||(no votes yet) [estimated by Bayesian average]|
|Status||Docs available [build log]
Last success reported on 2015-07-28 [all 1 reports]