clustering: High performance clustering algorithms
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.
Modules
[Index] [Quick Jump]
Downloads
- clustering-0.4.1.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
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.5.0), mwc-random, parallel, primitive, unordered-containers, vector [details] |
License | MIT |
Copyright | (c) 2015-2019 Kai Zhang |
Author | Kai Zhang |
Maintainer | kai@kzhang.org |
Category | Math |
Source repo | head: git clone https://github.com/kaizhang/clustering.git |
Uploaded | by kaizhang at 2019-01-08T23:24:06Z |
Distributions | |
Reverse Dependencies | 4 direct, 3 indirect [details] |
Downloads | 6828 total (6 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 2019-01-08 [all 1 reports] |