套件: libghc-hierarchical-clustering-prof (0.4.7-1build2)
libghc-hierarchical-clustering-prof 的相關超連結
Trisquel 的資源:
下載原始碼套件 haskell-hierarchical-clustering:
- [haskell-hierarchical-clustering_0.4.7-1build2.dsc]
- [haskell-hierarchical-clustering_0.4.7.orig.tar.gz]
- [haskell-hierarchical-clustering_0.4.7-1build2.debian.tar.xz]
維護者:
Original Maintainers:
- Debian Haskell Group (郵件存檔)
- Joachim Breitner
外部的資源:
- 主頁 [hackage.haskell.org]
相似套件:
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 有關的套件
|
|
|
-
- dep: libghc-array-prof-0.5.4.0-ddbb2
- 本虛擬套件由這些套件提供: ghc-prof
-
- dep: libghc-base-prof-4.13.0.0-bfdb4
- 本虛擬套件由這些套件提供: ghc-prof
-
- dep: libghc-containers-prof-0.6.2.1-f2d50
- 本虛擬套件由這些套件提供: ghc-prof
-
- dep: libghc-hierarchical-clustering-dev (= 0.4.7-1build2)
- fast algorithms for single, average/UPGMA and complete linkage clustering