clustering: fast clustering algorithms

[ library, math, mit ] [ Propose Tags ] [ Report a vulnerability ]

This version is deprecated.

O(N^2) implementations for a wide range of hierarchical clustering schemes, including complete linkage, single linkage, average linkage, weighted linkage, and Ward's method.

Modules

[Index]

AI
- Clustering
  - AI.Clustering.Hierarchical
    - AI.Clustering.Hierarchical.Types

Downloads

clustering-0.1.0.tar.gz [browse] (Cabal source package)
Package description (as included in the package)

Maintainer's Corner

Package maintainers

kaizhang

For package maintainers and hackage trustees

edit package information

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), containers, vector [details]
License	MIT
Copyright	(c) 2015 Kai Zhang
Author	Kai Zhang
Maintainer	kai@kzhang.org
Uploaded	by kaizhang at 2015-03-02T05:25:06Z
Category	Math
Source repo	head: git clone https://github.com/kaizhang/clustering.git
Distributions
Reverse Dependencies	4 direct, 3 indirect [details]
Downloads	7155 total (38 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 2015-03-02 [all 1 reports]