The kmeans-vector package

[Tags: bsd3, library, program]

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

Versions0.1, 0.1.1, 0.2, 0.3
Dependenciesbase (==4.*), vector (>=0.7)
LicenseBSD3
Copyright2011 Alp Mestanogullari
AuthorAlp Mestanogullari <alpmestan@gmail.com>
MaintainerAlp Mestanogullari <alpmestan@gmail.com>
StabilityExperimental
CategoryMath
Home pagehttp://github.com/alpmestan/kmeans-vector
Bug trackerhttps://github.com/alpmestan/kmeans-vector/issues
Source repositoryhead: git clone http://github.com/alpmestan/kmeans-vector.git
Upload dateSun Oct 9 18:08:09 UTC 2011
Uploaded byAlpMestanogullari
Downloads259 total (24 in last 30 days)

Modules

[Index]

Downloads

Maintainers' corner

For package maintainers and hackage trustees