A threshold criterion, auto-detection and its use in MST-based clustering

Authors:
Yu He;Lihui Chen
Affiliations:
Department of Electrical and Electronic Engineering, Nanyang Technological University, Republic of Singapore, 639798. E-mail: heyv2002@yahoo.com, elhchen@ntu.edu.sg;Department of Electrical and Electronic Engineering, Nanyang Technological University, Republic of Singapore, 639798. E-mail: heyv2002@yahoo.com, elhchen@ntu.edu.sg
Venue:
Intelligent Data Analysis
Year:
2005

Citing 11
Cited 1

Algorithms for clustering data

Algorithms for clustering data
Automatic subspace clustering of high dimensional data for data mining applications

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

Data mining: concepts and techniques
A clustering algorithm based on graph connectivity

Information Processing Letters
On Clustering Validation Techniques

Journal of Intelligent Information Systems
Chameleon: Hierarchical Clustering Using Dynamic Modeling

Computer
Efficient and Effective Clustering Methods for Spatial Data Mining

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Cluster Graph Modification Problems

WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
STING: A Statistical Information Grid Approach to Spatial Data Mining

VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Cluster ensembles --- a knowledge reuse framework for combining multiple partitions

The Journal of Machine Learning Research
Graph-modeled data clustering: fixed-parameter algorithms for clique generation

CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity

Handwritten Chinese text line segmentation by clustering with distance metric learning

Pattern Recognition

Quantified Score

Hi-index	0.00

Visualization

Abstract

Clustering is to group data points into homogenous clusters so that data points within the same cluster are more similar than data points belonging to different clusters. There are many effective clustering algorithms for discovering arbitrary shaped clusters, but one common problem of many algorithms is the difficulty for users to decide appropriate parameters for these algorithms. To reduce the dependence of clustering performance on parameters, this paper proposes a threshold criterion for the single linkage cluster analysis and incorporates it into the Minimum Spanning Tree (MST) based clustering method. Since the threshold can be automatically decided according to the underlying data distributions, arbitrary shaped clusters can be discovered with little human intervention. The experimental results on spatial data are very encouraging.