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 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.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
Dependenciesarray (==0.3.*), base (==4.*), containers (>=0.3 && <0.5)
AuthorFelipe Almeida Lessa
Source repositoryhead: darcs get
Upload dateFri Apr 8 16:49:30 UTC 2011
Uploaded byFelipeLessa
Downloads988 total (112 in last 30 days)




Maintainers' corner

For package maintainers and hackage trustees