DocumentCode :
3235594
Title :
Clustering based on sequential representation of minimum spanning tree
Author :
Wang, Guan-Wei ; Zhang, Chun-Xia ; Zhuang, Jian ; De-Hong Yu
Author_Institution :
Sch. of Mech. Eng., Xi´´an Jiaotong Univ., Xi´´an, China
fYear :
2011
fDate :
10-13 July 2011
Firstpage :
132
Lastpage :
137
Abstract :
This paper aims to solve three types of clustering problems (i.e., well-separated, relaxed well separated and connected ones) based on minimum spanning tree (MST) technique. Through analyzing the characteristics of each clustering problem, a good property of inconsistent edges is found and reformulated with several theorems based on the sequential representation of MST. Meanwhile, a new MST-based clustering algorithm SR-MSTC is proposed with purpose to reduce computational cost and to overcome the mutual influence of inconsistent edges. Some experiments demonstrate that SR-MSTC works well to identify different types of clusters embodied in the given data while having lower computational complexity.
Keywords :
computational complexity; image sequences; pattern clustering; trees (mathematics); MST-based clustering algorithm SR-MSTC; clustering problems; computational complexity; computational cost reduction; minimum spanning tree sequential representation; Iron; Clustering; Minimum spanning tree; Prim´s algorithm;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Wavelet Analysis and Pattern Recognition (ICWAPR), 2011 International Conference on
Conference_Location :
Guilin
ISSN :
2158-5695
Print_ISBN :
978-1-4577-0283-9
Type :
conf
DOI :
10.1109/ICWAPR.2011.6014467
Filename :
6014467
Link To Document :
بازگشت