How to Install and Uninstall libghc-hierarchical-clustering-dev Package on Ubuntu 20.10 (Groovy Gorilla)
Last updated: December 24,2024
1. Install "libghc-hierarchical-clustering-dev" package
Learn how to install libghc-hierarchical-clustering-dev on Ubuntu 20.10 (Groovy Gorilla)
$
sudo apt update
Copied
$
sudo apt install
libghc-hierarchical-clustering-dev
Copied
2. Uninstall "libghc-hierarchical-clustering-dev" package
This guide let you learn how to uninstall libghc-hierarchical-clustering-dev on Ubuntu 20.10 (Groovy Gorilla):
$
sudo apt remove
libghc-hierarchical-clustering-dev
Copied
$
sudo apt autoclean && sudo apt autoremove
Copied
3. Information about the libghc-hierarchical-clustering-dev package on Ubuntu 20.10 (Groovy Gorilla)
Package: libghc-hierarchical-clustering-dev
Architecture: amd64
Version: 0.4.7-1build1
Priority: extra
Section: universe/haskell
Source: haskell-hierarchical-clustering
Origin: Ubuntu
Maintainer: Ubuntu Developers
Original-Maintainer: Debian Haskell Group
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Installed-Size: 694
Provides: libghc-hierarchical-clustering-dev-0.4.7-0a9c1
Depends: libghc-array-dev-0.5.4.0-4a8d7, libghc-base-dev-4.13.0.0-c9705, libghc-containers-dev-0.6.2.1-b8f3d, libc6 (>= 2.2.5), libgmp10
Suggests: libghc-hierarchical-clustering-doc, libghc-hierarchical-clustering-prof
Filename: pool/universe/h/haskell-hierarchical-clustering/libghc-hierarchical-clustering-dev_0.4.7-1build1_amd64.deb
Size: 85824
MD5sum: 3d87900df2e94b2a171a1e168194028f
SHA1: 28659d46871a57446f7c6974d634348f91723487
SHA256: 553d124b30cc601bcf9b8c9863aa4a1a786ecbcd80bda62fb4dc0515682059f6
SHA512: a5dce26aa8e7bbf4f7c5f93e083e893d21118bfea31a114a570d4ab18b36d93bd60239c6fc146b7a85100eaea6fa3d952e8312f653181b1f487ad78b83cd73a3
Homepage: https://hackage.haskell.org/package/hierarchical-clustering
Description-en: 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.
Description-md5: 446338fd13896c9759f6319059ab9b57
Ghc-Package: hierarchical-clustering-0.4.7-Cygyc1OFL9mHkRf0Kma1fK
Architecture: amd64
Version: 0.4.7-1build1
Priority: extra
Section: universe/haskell
Source: haskell-hierarchical-clustering
Origin: Ubuntu
Maintainer: Ubuntu Developers
Original-Maintainer: Debian Haskell Group
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Installed-Size: 694
Provides: libghc-hierarchical-clustering-dev-0.4.7-0a9c1
Depends: libghc-array-dev-0.5.4.0-4a8d7, libghc-base-dev-4.13.0.0-c9705, libghc-containers-dev-0.6.2.1-b8f3d, libc6 (>= 2.2.5), libgmp10
Suggests: libghc-hierarchical-clustering-doc, libghc-hierarchical-clustering-prof
Filename: pool/universe/h/haskell-hierarchical-clustering/libghc-hierarchical-clustering-dev_0.4.7-1build1_amd64.deb
Size: 85824
MD5sum: 3d87900df2e94b2a171a1e168194028f
SHA1: 28659d46871a57446f7c6974d634348f91723487
SHA256: 553d124b30cc601bcf9b8c9863aa4a1a786ecbcd80bda62fb4dc0515682059f6
SHA512: a5dce26aa8e7bbf4f7c5f93e083e893d21118bfea31a114a570d4ab18b36d93bd60239c6fc146b7a85100eaea6fa3d952e8312f653181b1f487ad78b83cd73a3
Homepage: https://hackage.haskell.org/package/hierarchical-clustering
Description-en: 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.
Description-md5: 446338fd13896c9759f6319059ab9b57
Ghc-Package: hierarchical-clustering-0.4.7-Cygyc1OFL9mHkRf0Kma1fK