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 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:


Properties

Versions0.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
Dependenciesarray (>=0.3 && <0.5), base (==4.*), containers (>=0.3 && <0.6)
LicenseBSD3
AuthorFelipe Almeida Lessa
Maintainerfelipe.lessa@gmail.com
CategoryClustering
Source repositoryhead: darcs get http://patch-tag.com/r/felipe/hierarchical-clustering
UploadedThu Jun 14 01:51:35 UTC 2012 by FelipeLessa
Downloads1033 total (77 in last 30 days)
StatusDocs uploaded by user
Build status unknown [no reports yet]

Modules

[Index]

Downloads

Maintainers' corner

For package maintainers and hackage trustees