Paketti: libghc-hierarchical-clustering-dev (0.4.7-4)

[ Source: haskell-hierarchical-clustering  ]

fast algorithms for single, average/UPGMA and complete linkage clustering

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. See http://www.haskell.org/ for more information on Haskell.

Muut pakettiin libghc-hierarchical-clustering-dev liittyvät paketit

• dep: libc6 (>= 2.4)

  GNU-C-kirjasto: jaetut kirjastot
  myös näennäispaketti, jonka toteuttaa libc6-udeb

• dep: libghc-array-dev-0.5.6.0-3963a

  näennäispaketti, jonka toteuttaa ghc

• dep: libghc-base-dev-4.18.2.1-3be9b

  näennäispaketti, jonka toteuttaa ghc

• dep: libghc-containers-dev-0.6.7-138bd

  näennäispaketti, jonka toteuttaa ghc

• dep: libgmp10 (>= 2:6.3.0+dfsg)

  Multiprecision arithmetic library

Imuroi libghc-hierarchical-clustering-dev

Imurointi kaikille saataville arkkitehtuureille

Arkkitehtuuri	Paketin koko	Koko asennettuna	Tiedostot
armel	98.9 kt	783.0 kt	[tiedostoluettelo]