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 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.
|Versions [RSS]||0.1, 0.1.1, 0.2, 0.3, 0.3.1, 0.3.2|
|Dependencies||base (>=4 && <5), vector (>=0.7) [details]|
|Copyright||2011 Alp Mestanogullari|
|Author||Alp Mestanogullari <firstname.lastname@example.org>|
|Maintainer||Alp Mestanogullari <email@example.com>|
|Source repo||head: git clone http://github.com/alpmestan/kmeans-vector.git|
|Uploaded||by AlpMestanogullari at 2011-10-09T22:42:15Z|
|Downloads||3958 total (2 in the last 30 days)|
|Rating||(no votes yet) [estimated by Bayesian average]|
|Status||Docs uploaded by user
Build status unknown [no reports yet]