Skip to content
Sections
>> Trisquel >> 软件包 >> aramo >> haskell >> libghc-hierarchical-clustering-prof
etiona  ] [  nabia  ] [  aramo  ]

软件包: libghc-hierarchical-clustering-prof (0.4.7-1build2)

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.

其他与 libghc-hierarchical-clustering-prof 有关的软件包

  • 依赖
  • 推荐
  • 建议

下载 libghc-hierarchical-clustering-prof

下载可用于所有硬件架构的
硬件架构 软件包大小 安装后大小 文件
amd64 69.5 kB610 kB [文件列表]
arm64 73.4 kB687 kB [文件列表]
armhf 73.0 kB535 kB [文件列表]
ppc64el 85.0 kB973 kB [文件列表]