The hierarchical-clustering package

[Tags: bsd3, library]

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 (version was skipped):

Changes in version 0.3.1:

Changes in version

Changes in version 0.3:

Changes in version 0.2:


Versions0.1, 0.3,, 0.3.1,, 0.4, 0.4.1, 0.4.2, 0.4.3, 0.4.4, 0.4.5, 0.4.6
Change logNone available
Dependenciesarray (>=0.3 && <0.5), base (==4.*), containers (>=0.3 && <0.5) [details]
AuthorFelipe Almeida Lessa
Source repositoryhead: darcs get
UploadedSun Mar 25 14:48:40 UTC 2012 by FelipeLessa
Downloads1952 total (64 in last 30 days)
0 []
StatusDocs uploaded by user
Build status unknown [no reports yet]




Maintainers' corner

For package maintainers and hackage trustees