How to Install and Uninstall libghc-hierarchical-clustering-doc Package on Ubuntu 21.04 (Hirsute Hippo)
Last updated: November 26,2024
1. Install "libghc-hierarchical-clustering-doc" package
This is a short guide on how to install libghc-hierarchical-clustering-doc on Ubuntu 21.04 (Hirsute Hippo)
$
sudo apt update
Copied
$
sudo apt install
libghc-hierarchical-clustering-doc
Copied
2. Uninstall "libghc-hierarchical-clustering-doc" package
Please follow the steps below to uninstall libghc-hierarchical-clustering-doc on Ubuntu 21.04 (Hirsute Hippo):
$
sudo apt remove
libghc-hierarchical-clustering-doc
Copied
$
sudo apt autoclean && sudo apt autoremove
Copied
3. Information about the libghc-hierarchical-clustering-doc package on Ubuntu 21.04 (Hirsute Hippo)
Package: libghc-hierarchical-clustering-doc
Architecture: all
Version: 0.4.7-1build2
Priority: extra
Section: universe/doc
Source: haskell-hierarchical-clustering
Origin: Ubuntu
Maintainer: Ubuntu Developers
Original-Maintainer: Debian Haskell Group
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Installed-Size: 633
Depends: haddock-interface-35
Recommends: libjs-mathjax
Filename: pool/universe/h/haskell-hierarchical-clustering/libghc-hierarchical-clustering-doc_0.4.7-1build2_all.deb
Size: 53848
MD5sum: 86152ca91f0cea79f054db16c15478a6
SHA1: fa11e6b52e59020fe0d33fa86be803d4e9f7dd81
SHA256: 76f7307e4eba6e9007181817c45084be973e62aa9b50e19b009588bd9c2cd8c6
SHA512: a7b9e2b0ac42e1065f746c734f8ae8530e98b8166a40cfaba0573b12927460bf14a977b8f7b87382f7b4ad4ff2d2dcdabbc709b377143130a455f0ec996e04da
Homepage: https://hackage.haskell.org/package/hierarchical-clustering
Description-en: 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.
Description-md5: 525776fdf18583782ab432bc474bceaa
Architecture: all
Version: 0.4.7-1build2
Priority: extra
Section: universe/doc
Source: haskell-hierarchical-clustering
Origin: Ubuntu
Maintainer: Ubuntu Developers
Original-Maintainer: Debian Haskell Group
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Installed-Size: 633
Depends: haddock-interface-35
Recommends: libjs-mathjax
Filename: pool/universe/h/haskell-hierarchical-clustering/libghc-hierarchical-clustering-doc_0.4.7-1build2_all.deb
Size: 53848
MD5sum: 86152ca91f0cea79f054db16c15478a6
SHA1: fa11e6b52e59020fe0d33fa86be803d4e9f7dd81
SHA256: 76f7307e4eba6e9007181817c45084be973e62aa9b50e19b009588bd9c2cd8c6
SHA512: a7b9e2b0ac42e1065f746c734f8ae8530e98b8166a40cfaba0573b12927460bf14a977b8f7b87382f7b4ad4ff2d2dcdabbc709b377143130a455f0ec996e04da
Homepage: https://hackage.haskell.org/package/hierarchical-clustering
Description-en: 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.
Description-md5: 525776fdf18583782ab432bc474bceaa