Scholay

学术搜索 · AI 审稿 · LaTeX 协作

Algorithms for hierarchical clustering: an overview

作者:Fionn Murtagh, Pedro Contreras · 发表于:Wiley Interdisciplinary Reviews Data Mining and Knowledge Discovery · 年份:2011 · DOI:10.1002/widm.53 · 被引用次数:1890 · 研究领域:Advanced Clustering Algorithms Research、Complex Network Analysis Techniques、Data Management and Algorithms

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. © 2011 Wiley Periodicals, Inc. This article is categorized under: Algorithmic Development > Hierarchies and Trees Technologies > Structure Discovery and Clustering