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 | English |
---|---|
Pages (from-to) | 86-97 |
Number of pages | 12 |
Journal | Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery |
Volume | 2 |
Issue number | 1 |
DOIs | |
Publication status | Published - 7 Dec 2012 |
Externally published | Yes |