A Survey of Recent Advances in Hierarchical Clustering Algorithms

F. Murtagh

Research output: Contribution to journalArticlepeer-review

757 Citations (Scopus)


It has often been asserted that since hierarchical clustering algorithms require pairwise interobject proximities, the complexity of these clustering procedures is at least O(N2). Recent work has disproved this by incorporating efficient nearest neighbour searching algorithms into the clustering algorithms. A general framework for hierarchical, agglomerative clustering algorithms is discussed here, which opens up the prospect of much improvement on current, widely-used algorithms. This 'progress report' details new algorithmic approaches in this area, and reviews recent results.

Original languageEnglish
Pages (from-to)354-359
Number of pages6
JournalComputer Journal
Issue number4
Publication statusPublished - 1 Nov 1983
Externally publishedYes


Dive into the research topics of 'A Survey of Recent Advances in Hierarchical Clustering Algorithms'. Together they form a unique fingerprint.

Cite this