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.

Versions 0.1.0, 0.1.1, 0.1.2, 0.2.0, 0.2.1, 0.3.0, 0.3.1, 0.4.0 (info)
Dependencies base (>=4.0 && <5.0), binary, containers, matrices (>=0.4.0), mwc-random, parallel, primitive, unordered-containers, vector [details]
License MIT
Copyright (c) 2015-2018 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 Wed Jan 31 23:20:53 UTC 2018
Distributions NixOS:0.4.0, openSUSE:0.4.0
Downloads 1966 total (16 in the last 30 days)
Rating 2.0 (votes: 1) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2018-01-31 [all 1 reports]
Hackage Matrix CI

Modules

[Index]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees