Name: hierarchical-clustering
Version: 0.3
Synopsis: Algorithms for single, average/UPGMA and complete linkage clustering.
License: BSD3
License-file: LICENSE
Author: Felipe Almeida Lessa
Maintainer: felipe.lessa@gmail.com
Category: Clustering
Build-type: Simple
Cabal-version: >= 1.6
Description:
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 function uses a naïve algorithm that represents distances
in a rectangular distance matrix. There could be space
improvements (e.g. using a triangular matrix structure) and
time improvements (e.g. using a finger tree to avoid traversing
the whole matrix on every iteration just to see what the
minimum is).
.
Changes in version 0.3:
.
* Added function @cutAt@.
.
* Fixed complexity in Haddock comments.
Library
Exposed-modules:
Data.Clustering.Hierarchical,
Data.Clustering.Hierarchical.Internal.DistanceMatrix
Build-depends: base == 4.*, array == 0.3.*, containers == 0.3.*
GHC-options: -Wall