Name: kmeans-vector Version: 0.2 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 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). . CHANGELOG . kmeans-vector-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 , Ville Tirronen Maintainer: Alp Mestanogullari Copyright: 2011-2012 Alp Mestanogullari Stability: Experimental Category: Math Build-type: Simple Cabal-version: >=1.6 Library Exposed-modules: Math.KMeans Build-depends: base >= 4 && < 5, vector >= 0.7 ghc-prof-options: -prof -auto-all ghc-options: -O2 -funbox-strict-fields source-repository head type: git location: http://github.com/alpmestan/kmeans-vector.git