hierarchical-clustering: Algorithms for single, average/UPGMA and complete linkage clustering.
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 function uses a naïve algorithm that represents distances in a rectangular distance matrix. There could be space improvements (e.g. using a triangular matrix structure) and time improvements (e.g. using a finger tree to avoid traversing the whole matrix on every iteration just to see what the minimum is).
Changes in version 0.3:
Fixed complexity in Haddock comments.
|Versions||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|
|Dependencies||array (==0.3.*), base (==4.*), containers (==0.3.*) [details]|
|Author||Felipe Almeida Lessa|
|Uploaded||by FelipeLessa at Fri Aug 6 18:05:54 UTC 2010|
|Distributions||Debian:0.4.6, LTSHaskell:0.4.6, NixOS:0.4.6|
|Downloads||4738 total (31 in the last 30 days)|
|Rating||(no votes yet) [estimated by rule of succession]|
|Status||Docs uploaded by user
Build status unknown [no reports yet]
Hackage Matrix CI
For package maintainers and hackage trustees