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

Fionn Murtagh

doi:10.1109/34.159908

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

Fionn Murtagh

Research output: Contribution to journal › Comment/debate › peer-review

27 Citations (Scopus)

Abstract

The purpose of this correspondence is to indicate that state- of-the-art hierarchical clustering algorithms have Oin²) 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 language	English
Pages (from-to)	1056-1057
Number of pages	2
Journal	IEEE Transactions on Pattern Analysis and Machine Intelligence
Volume	14
Issue number	10
DOIs	https://doi.org/10.1109/34.159908
Publication status	Published - Oct 1992
Externally published	Yes

Access to Document

10.1109/34.159908Licence: Unspecified

Cite this

@article{f3e7fe7db0a449a9bc4b9e7e78de14aa,

title = "Comments on “Parallel Algorithms for Hierarchical Clustering and Cluster Validity”",

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{\textquoteright}s. We also point out some further references in the parallelizing of hierarchic clustering algorithms.",

keywords = "Computational complexity, hierarchical clustering",

author = "Fionn Murtagh",

year = "1992",

month = oct,

doi = "10.1109/34.159908",

language = "English",

volume = "14",

pages = "1056--1057",

journal = "IEEE Transactions on Pattern Analysis and Machine Intelligence",

issn = "0162-8828",

publisher = "IEEE Computer Society",

number = "10",

}

TY - JOUR

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

AU - Murtagh, Fionn

PY - 1992/10

Y1 - 1992/10

N2 - 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.

AB - 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.

KW - Computational complexity

KW - hierarchical clustering

UR - http://www.scopus.com/inward/record.url?scp=0026938525&partnerID=8YFLogxK

U2 - 10.1109/34.159908

DO - 10.1109/34.159908

M3 - Comment/debate

AN - SCOPUS:0026938525

VL - 14

SP - 1056

EP - 1057

JO - IEEE Transactions on Pattern Analysis and Machine Intelligence

JF - IEEE Transactions on Pattern Analysis and Machine Intelligence

SN - 0162-8828

IS - 10

ER -

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

Abstract

Access to Document

Other files and links

Fingerprint

Cite this