clustering: High performance clustering algorithms

[ library, math, mit ] [ Propose Tags ]

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.

Downloads

Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

  • No Candidates
Versions [RSS] 0.1.0, 0.1.1, 0.1.2, 0.2.0, 0.2.1, 0.3.0, 0.3.1, 0.4.0, 0.4.1 (info)
Dependencies base (>=4.0 && <5.0), binary, containers, matrices (>=0.4 && <0.5), mwc-random, parallel, primitive, unordered-containers, vector [details]
License MIT
Copyright (c) 2015-2018 Kai Zhang
Author Kai Zhang
Maintainer kai@kzhang.org
Revised Revision 1 made by kaizhang at 2018-12-26T19:29:33Z
Category Math
Source repo head: git clone https://github.com/kaizhang/clustering.git
Uploaded by kaizhang at 2018-01-31T23:20:53Z
Distributions
Reverse Dependencies 4 direct, 3 indirect [details]
Downloads 6655 total (28 in the last 30 days)
Rating 2.0 (votes: 1) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2018-01-31 [all 1 reports]