clustering

High performance clustering algorithms

Version on this page:	0.2.1
LTS Haskell 9.21:	0.3.1
Stackage Nightly 2017-11-25:	0.3.1
Latest on Hackage:	0.4.1

See all snapshots clustering appears in

MIT licensed by Kai Zhang

Maintained by [email protected]

This version can be pinned in stack with:clustering-0.2.1@sha256:18a9fad466e118e5c980f8c8174fd8434c35da146d885efe48adfd8abbfb71dd,2222

Module documentation for 0.2.1

AI
- AI.Clustering

Depends on 8 packages(full list with versions):

base, binary, containers, matrices, mwc-random, parallel, primitive, vector

Following clutering methods are included in this library:

1 Agglomerative hierarchical clustering. Complete linkage O(n^2), Single linkage O(n^2), Average linkage O(n^2), Weighted linkage O(n^2), Ward's linkage O(n^2).

2 KMeans clustering.