clustering

High performance clustering algorithms

Version on this page:	0.3.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.3.1@sha256:c6a4ff1804f8aebc24d6603d76cb9a78120f40575c5972fa3558f150e29db6e3,2061

Module documentation for 0.3.1

AI
- AI.Clustering

Depends on 9 packages(full list with versions):

base, binary, containers, matrices, mwc-random, parallel, primitive, unordered-containers, 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.