Abstract
We survey agglomerative hierarchical clustering algorithms and discuss
efficient implementations that are available in R and other software
environments. We look at hierarchical self-organizing maps, and mixture models.
We review grid-based clustering, focusing on hierarchical density-based
approaches. Finally we describe a recently developed very efficient (linear
time) hierarchical clustering algorithm, which can also be viewed as a
hierarchical grid-based algorithm.
Original language | Undefined/Unknown |
---|---|
Title of host publication | Data Mining and Knowledge Discovery |
Publisher | Wiley-Interscience |
Publication status | Published - 2011 |
Keywords
- cs.IR
- cs.CV
- math.ST
- stat.ML
- stat.TH
- 62H30
- H.3.3; H.2.8; G.3