A Clustering Algorithm Based on Adaptive Subcluster Merging

Authors:
Jiani Hu;Weihong Deng;Jun Guo
Affiliations:
Beijing University of Posts and Telecommunications, 100876, Beijing, China;Beijing University of Posts and Telecommunications, 100876, Beijing, China;Beijing University of Posts and Telecommunications, 100876, Beijing, China
Venue:
CAI '07 Proceedings of the 20th conference of the Canadian Society for Computational Studies of Intelligence on Advances in Artificial Intelligence
Year:
2007

Citing 9
Cited 0

Algorithms for clustering data

Algorithms for clustering data
CURE: an efficient clustering algorithm for large databases

SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Bayesian Approaches to Gaussian Mixture Modeling

IEEE Transactions on Pattern Analysis and Machine Intelligence
Data clustering: a review

ACM Computing Surveys (CSUR)
Cluster validity methods: part I

ACM SIGMOD Record
Chameleon: Hierarchical Clustering Using Dynamic Modeling

Computer
A Maximum Variance Cluster Algorithm

IEEE Transactions on Pattern Analysis and Machine Intelligence
A New Cluster Isolation Criterion Based on Dissimilarity Increments

IEEE Transactions on Pattern Analysis and Machine Intelligence
Dynamic Cluster Formation Using Level Set Methods

IEEE Transactions on Pattern Analysis and Machine Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes an adaptive subcluster merging (ASM) based clustering algorithm. The ASM algorithm has two stages: subcluster partition and subcluster merging. Specifically, it first applies local expanding with variance constraint to partition subclusters with uniform granularity, and then it adaptively merges the subclusters into clusters with the notion of density. Through these two stages, ASM algorithm can identify clusters of heterogeneous structures. The feasibility of the algorithm has been successfully tested on both synthetic and real-world data sets. Comparative experimental studies of various clustering algorithms are also performed. The results demonstrate that the proposed algorithm performs better than K-means, complete-link hierarchial, density-based and maximum variance algorithms.