Comments on "Parallel algorithms for hierarchical clustering and cluster validity

In the above-titled paper (ibid., vol.12, no.11, p.1088-92, Nov. 1990), parallel implementations of hierarchical clustering algorithms that achieve O(n/sup 2/) computational time complexity and thereby improve on the baseline of sequential implementations are described. The latter are stated to be O...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on pattern analysis and machine intelligence Vol. 14; no. 10; pp. 1056 - 1057
Main Author Murtagh, F.
Format Journal Article
LanguageEnglish
Published IEEE 01.10.1992
Subjects
Clustering algorithms
Clustering methods
Concurrent computing
Machine intelligence
Nearest neighbor searches
Parallel algorithms
Online AccessGet full text
ISSN0162-8828
2160-9292
DOI10.1109/34.159908

Cover

More Information
Summary:In the above-titled paper (ibid., vol.12, no.11, p.1088-92, Nov. 1990), parallel implementations of hierarchical clustering algorithms that achieve O(n/sup 2/) computational time complexity and thereby improve on the baseline of sequential implementations are described. The latter are stated to be O(n/sup 3/), with the exception of the single-link method. The commenter points out that state-of-the-art hierarchical clustering algorithms have O(n/sup 2/) time complexity and should be referred to in preference to the O(n/sup 3/) algorithms, which were described in many texts in the 1970s. Some further references in the parallelizing of hierarchic clustering algorithms are provided.< >
ISSN:0162-8828
2160-9292
DOI:10.1109/34.159908