Comments on “Parallel Algorithms for Hierarchical Clustering and Cluster Validity”

Fionn Murtagh

Research output: Contribution to journalComment/debate

23 Citations (Scopus)

Abstract

The purpose of this correspondence is to indicate that state- of-the-art hierarchical clustering algorithms have Oin2) time complexity and should be referred to in preference to the 0(n3) algorithms, which were described in many texts in the 1970’s. We also point out some further references in the parallelizing of hierarchic clustering algorithms.

Original languageEnglish
Pages (from-to)1056-1057
Number of pages2
JournalIEEE Transactions on Pattern Analysis and Machine Intelligence
Volume14
Issue number10
DOIs
Publication statusPublished - Oct 1992
Externally publishedYes

Fingerprint Dive into the research topics of 'Comments on “Parallel Algorithms for Hierarchical Clustering and Cluster Validity”'. Together they form a unique fingerprint.

  • Cite this