Exploration on the commonality of hierarchical clustering algorithms

Authors:
Yonghui Chen;Alan Sprague
Affiliations:
The University of Alabama at Birmingham, Birmingham;The University of Alabama at Birmingham, Birmingham
Venue:
ACM-SE 42 Proceedings of the 42nd annual Southeast regional conference
Year:
2004

Citing 5
Cited 0

OPTICS: ordering points to identify the clustering structure

SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Data mining: concepts and techniques

Data mining: concepts and techniques
Clustering Algorithms

Clustering Algorithms
Chameleon: Hierarchical Clustering Using Dynamic Modeling

Computer
ROCK: A Robust Clustering Algorithm for Categorical Attributes

ICDE '99 Proceedings of the 15th International Conference on Data Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many clustering algorithms have been devised. The published account of each algorithm emphasizes how it is different from previous algorithms. However, similarities among agglomerative hierarchical algorithms are greater than commonly supposed. For example, several algorithms perform merging by the single link (SLINK, OPTICS) and some algorithms perform merging by the edge cut criterion (CHAMELEON, ROCK). Some algorithms use the square of the original adjacency matrix (OPTICS, ROCK). Our goals are to compose a not very long list of methods used by the various algorithms; to locate each algorithm in this space of methods; and to devise new algorithms that improve upon the previous methods.