软件包：libghc-hierarchical-clustering-doc（0.4.7-3）
libghc-hierarchical-clustering-doc 的相关链接
Debian 的资源：
下载源码包 haskell-hierarchical-clustering：
- [haskell-hierarchical-clustering_0.4.7-3.dsc]
- [haskell-hierarchical-clustering_0.4.7.orig.tar.gz]
- [haskell-hierarchical-clustering_0.4.7-3.debian.tar.xz]
维护小组：
外部的资源：
- 主页 [hackage.haskell.org]
相似软件包：
fast algorithms for single, average/UPGMA and complete linkage clustering; documentation
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 the documentation for a library for the Haskell programming language. See http://www.haskell.org/ for more information on Haskell.
其他与 libghc-hierarchical-clustering-doc 有关的软件包
|
|
|
|
-
- dep: haddock-interface-41
- 本虚包由这些包填实： ghc
-
- rec: ghc-doc
- Documentation for the Glasgow Haskell Compilation system
-
- rec: libghc-hierarchical-clustering-dev
- fast algorithms for single, average/UPGMA and complete linkage clustering
-
- rec: libjs-mathjax
- JavaScript display engine for LaTeX and MathML
-
- sug: libghc-hierarchical-clustering-prof
- fast algorithms for single, average/UPGMA and complete linkage clustering; profiling libraries