| Copyright | (c) Kai Zhang |
|---|---|
| License | MIT |
| Safe Haskell | None |
| Language | Haskell2010 |
AI.Clustering.Hierarchical
Description
Documentation
data Dendrogram a Source
Constructors
| Leaf !a | |
| Branch !Size !Distance !(Dendrogram a) !(Dendrogram a) |
Instances
| Functor Dendrogram | |
| Show a => Show (Dendrogram a) |
size :: Dendrogram a -> Int Source
cutAt :: Dendrogram a -> Distance -> [Dendrogram a] Source
members :: Dendrogram a -> [a] Source
Constructors
| Single | Single linkage, $d(A,B) = min_{a in A, b in B} d(a,b)$. |
| Complete | Complete linkage, $d(A,B) = max_{a in A, b in B} d(a,b)$. |
| Average | Average linkage, $d(A,B) = frac{sum_{a in A}sum_{b in B}d(a,b)}{|A||B|}$. |
| Weighted | Weighted linkage |
| Ward | Ward's method |
| Centroid | Centroid linkage, not implemented |
| Median | Median linkage, not implemented |
computeDists :: Vector v a => DistFn a -> v a -> DistanceMat Source