# The kmeans-vector package

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

Versions | 0.1, 0.1.1, 0.2, 0.3 |
---|---|

Change log | None available |

Dependencies | base (==4.*), kmeans-vector, mtl (>=2.1), QuickCheck, vector (>=0.7) |

License | BSD3 |

Copyright | 2011-2014 Alp Mestanogullari |

Author | Alp Mestanogullari <alpmestan@gmail.com>, Ville Tirronen |

Maintainer | Alp Mestanogullari <alpmestan@gmail.com> |

Stability | Experimental |

Category | Math |

Home page | http://github.com/alpmestan/kmeans-vector |

Bug tracker | https://github.com/alpmestan/kmeans-vector/issues |

Source repository | head: git clone http://github.com/alpmestan/kmeans-vector.git |

Executables | kmeans-persons |

Uploaded | Thu Jun 5 10:17:07 UTC 2014 by AlpMestanogullari |

Distributions | NixOS:0.3 |

Downloads | 618 total (33 in last 30 days) |

Status | Docs available [build log] Successful builds reported [all 1 reports] |

## Modules

*Math*

[Index]

## Downloads

- kmeans-vector-0.3.tar.gz [browse] (Cabal source package)
- Package description (included in the package)

#### Maintainers' corner

For package maintainers and hackage trustees