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

CHANGELOG

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.

Properties

Versions0.1, 0.1.1, 0.2, 0.3, 0.3.1
Change logNone available
Dependenciesbase (==4.*), kmeans-vector, mtl (>=2.1), probable, vector (>=0.7) [details]
LicenseBSD3
Copyright2011-2015 Alp Mestanogullari
AuthorAlp Mestanogullari <alpmestan@gmail.com>, Ville Tirronen
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
Executableskmeans-example
UploadedTue Jul 28 15:08:40 UTC 2015 by AlpMestanogullari
DistributionsNixOS:0.3
Downloads666 total (57 in last 30 days)
Votes
0 []
StatusDocs available [build log]
Last success reported on 2015-07-28 [all 1 reports]

Modules

[Index]

Downloads

Maintainers' corner

For package maintainers and hackage trustees