DocumentCode
1938483
Title
A New Clustering Validity Index for Evaluating Arbitrary Shape Clusters
Author
Liu, Shang ; Huang, Ya-lou
Author_Institution
Tanjin Univ. of Finance & Econ., Tianjin
Volume
7
fYear
2007
fDate
19-22 Aug. 2007
Firstpage
3969
Lastpage
3974
Abstract
When doing clustering analysis it always needs a clustering validity index to evaluate if the present clustering scheme can reflect the real natural structure of the dataset. The clusters founded by the clustering algorithm can be of arbitrary shape, but the exiting validity indices can only assess the validity of convex clusters. To solve this problem a new validity index CompSepa is proposed in this paper, which can evaluate a cluster scheme including both non-convex and convex clusters, and the validity index CompSepa is computed by the minimum-cost spanning tree (MST) of the objects of clusters. Experiments show that the new validity index can evaluate the clustering scheme correctly and effectively.
Keywords
pattern clustering; tree searching; arbitrary shape cluster evaluation; clustering analysis; clustering scheme evaluation; clustering validity index; convex cluster validity; minimum cost spanning tree; nonconvex cluster; validity index CompSepa; Algorithm design and analysis; Clustering algorithms; Costs; Cybernetics; Machine learning; Partitioning algorithms; Shape; Testing; Tree graphs; Visualization; Clustering analysis; Density-based clustering algorithm; MST; Validity index;
fLanguage
English
Publisher
ieee
Conference_Titel
Machine Learning and Cybernetics, 2007 International Conference on
Conference_Location
Hong Kong
Print_ISBN
978-1-4244-0973-0
Electronic_ISBN
978-1-4244-0973-0
Type
conf
DOI
10.1109/ICMLC.2007.4370840
Filename
4370840
Link To Document