hierarchical-clustering: Fast algorithms for single, average/UPGMA and complete linkage clustering.

[ bsd3, clustering, library ] [ Propose Tags ]

This package provides a function to create a dendrogram from a list of items and a distance function between them. Initially a singleton cluster is created for each item, and then new, bigger clusters are created by merging the two clusters with least distance between them. The distance between two clusters is calculated according to the linkage type. The dendrogram represents not only the clusters but also the order on which they were created.

This package has many implementations with different performance characteristics. There are SLINK and CLINK algorithm implementations that are optimal in both space and time. There are also naive implementations using a distance matrix. Using the dendrogram function from Data.Clustering.Hierarchical automatically chooses the best implementation we have.

Changes in version 0.4:

Changes in version 0.3.1.2 (version 0.3.1.1 was skipped):

Changes in version 0.3.1:

Changes in version 0.3.0.1:

Changes in version 0.3:

Changes in version 0.2:

Versions [faq] 0.1, 0.3, 0.3.0.1, 0.3.1, 0.3.1.2, 0.4, 0.4.1, 0.4.2, 0.4.3, 0.4.4, 0.4.5, 0.4.6, 0.4.7
Dependencies array (>=0.3), base (==4.*), containers (>=0.3) [details]
License BSD-3-Clause
Author Felipe Almeida Lessa
Maintainer felipe.lessa@gmail.com
Category Clustering
Source repo head: git clone https://github.com/meteficha/hierarchical-clustering
Uploaded by FelipeLessa at Sun Aug 18 10:36:04 UTC 2019
Distributions Debian:0.4.6, NixOS:0.4.7
Downloads 6484 total (199 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs available [build log]
Last success reported on 2019-08-18 [all 1 reports]

Modules

[Index] [Quick Jump]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees