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 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.


Versions0.1, 0.1.1, 0.2, 0.3
Dependenciesbase (==4.*), kmeans-vector, mtl (>=2.1), QuickCheck, vector (>=0.7)
Copyright2011-2014 Alp Mestanogullari
AuthorAlp Mestanogullari <>, Ville Tirronen
MaintainerAlp Mestanogullari <>
Home page
Bug tracker
Source repositoryhead: git clone
UploadedThu Jun 5 10:17:07 UTC 2014 by AlpMestanogullari
Downloads399 total (30 in last 30 days)
StatusDocs available [build log]
Successful builds reported [all 1 reports]




Maintainers' corner

For package maintainers and hackage trustees