How to Install and Uninstall libghc-hierarchical-clustering-doc Package on Ubuntu 16.04 LTS (Xenial Xerus)

Last updated: May 19,2024

1. Install "libghc-hierarchical-clustering-doc" package

In this section, we are going to explain the necessary steps to install libghc-hierarchical-clustering-doc on Ubuntu 16.04 LTS (Xenial Xerus)

$ sudo apt update $ sudo apt install libghc-hierarchical-clustering-doc

2. Uninstall "libghc-hierarchical-clustering-doc" package

This tutorial shows how to uninstall libghc-hierarchical-clustering-doc on Ubuntu 16.04 LTS (Xenial Xerus):

$ sudo apt remove libghc-hierarchical-clustering-doc $ sudo apt autoclean && sudo apt autoremove

3. Information about the libghc-hierarchical-clustering-doc package on Ubuntu 16.04 LTS (Xenial Xerus)

Package: libghc-hierarchical-clustering-doc
Priority: extra
Section: universe/doc
Installed-Size: 290
Maintainer: Ubuntu Developers
Original-Maintainer: Debian Haskell Group
Architecture: all
Source: haskell-hierarchical-clustering
Version: 0.4.6-1
Depends: haddock-interface-27
Recommends: ghc-doc
Filename: pool/universe/h/haskell-hierarchical-clustering/libghc-hierarchical-clustering-doc_0.4.6-1_all.deb
Size: 32672
MD5sum: bf8ff2b26616380bc7f58f6118c147d2
SHA1: 1ead772b83525dfab1e16ee5e973447d2244e894
SHA256: 06de225aefb0668dd474255f72f2282d7d6b62598fd8d50e8c8a0b05462c00aa
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: 0c81eebd3cc2c62d4deffe9b901e843f
Homepage: http://hackage.haskell.org/package/hierarchical-clustering
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Origin: Ubuntu