| FileSize | 75628 |
| MD5 | 9D4DB2A9CC6ADEC3663A5119DE58FF50 |
| PackageDescription | fast algorithms for single, average/UPGMA and complete linkage clustering; profiling libraries
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.
.
This package provides a library for the Haskell programming language, compiled
for profiling. See http://www.haskell.org/ for more information on Haskell. |
| PackageMaintainer | Debian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org> |
| PackageName | libghc-hierarchical-clustering-prof |
| PackageSection | haskell |
| PackageVersion | 0.4.7-1+b1 |
| SHA-1 | E073AEA0C04038C10D9FA14C4DE455876846BED6 |
| SHA-256 | 7FD1A4D04177DD7C0C2329E5881BF222481272D0CA507BD770E098B07D0EEF34 |