Name: kmeans-vector
Version: 0.3
Synopsis: An implementation of the kmeans clustering algorithm based on the vector package
Description: 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.
Homepage: http://github.com/alpmestan/kmeans-vector
Bug-reports: https://github.com/alpmestan/kmeans-vector/issues
License: BSD3
License-file: LICENSE
Author: Alp Mestanogullari <alpmestan@gmail.com>, Ville Tirronen
Maintainer: Alp Mestanogullari <alpmestan@gmail.com>
Copyright: 2011-2014 Alp Mestanogullari
Stability: Experimental
Category: Math
Build-type: Simple
Cabal-version: >=1.8
library
Exposed-modules: Math.KMeans
Build-depends: base >= 4 && < 5, vector >= 0.7, mtl >= 2.1
ghc-prof-options: -prof -auto-all
ghc-options: -O2 -funbox-strict-fields -Wall
executable kmeans-persons
main-is: persons.hs
hs-source-dirs: examples
ghc-options: -O2 -funbox-strict-fields
build-depends: base >= 4 && < 5, vector >= 0.7, kmeans-vector, QuickCheck
benchmark bench
main-is: bench.hs
other-modules: OldKmeans
hs-source-dirs: bench
ghc-options: -O2 -funbox-strict-fields
type: exitcode-stdio-1.0
build-depends: base >= 4 && < 5,
vector >= 0.7,
kmeans-vector,
criterion,
QuickCheck
source-repository head
type: git
location: http://github.com/alpmestan/kmeans-vector.git