Ubuntu
haskell-hierarchical-clustering package

haskell-hierarchical-clustering 0.4.7-2 source package in Ubuntu

Changelog

haskell-hierarchical-clustering (0.4.7-2) unstable; urgency=medium

  * Declare compliance with Debian policy 4.6.1
  * Sourceful upload for GHC 9.0.2

 -- Ilias Tsitsimpis <email address hidden>  Wed, 29 Jun 2022 20:45:35 +0300

Upload details

Uploaded by:
Debian Haskell Group
Uploaded to:
Sid
Original maintainer:
Debian Haskell Group
Architectures:
any all
Section:
misc
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section

Downloads

File Size SHA-256 Checksum
haskell-hierarchical-clustering_0.4.7-2.dsc 2.5 KiB fd276f2b0848cfefc001e75bf2247a2c440ff34783be6fa2223bb47cf2f14884
haskell-hierarchical-clustering_0.4.7.orig.tar.gz 10.4 KiB 138f46160ee436293326a575bf6fd3caceb6dc7b91164d78a02582c6e0c6d195
haskell-hierarchical-clustering_0.4.7-2.debian.tar.xz 2.9 KiB 0ef704f63ca39dc67ce7faf2ede3a3156a892efdb4257845e227a7f712e3b2d5

No changes file available.

Binary packages built by this source

libghc-hierarchical-clustering-dev: No summary available for libghc-hierarchical-clustering-dev in ubuntu kinetic.

No description available for libghc-hierarchical-clustering-dev in ubuntu kinetic.

libghc-hierarchical-clustering-doc: No summary available for libghc-hierarchical-clustering-doc in ubuntu kinetic.

No description available for libghc-hierarchical-clustering-doc in ubuntu kinetic.

libghc-hierarchical-clustering-prof: 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.