CLUSTERING BASED ON SEQUENTIAL REPRESENTATION OFMINIMUM SPANNING TREE

摘要：

　　This paper aims to solve three types of dustering problems (i.e.,well-separated,relaxed wall 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 reformulatedwith 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 dusters embodied in the given data while having lower computational complexity.

关键词： Clustering Minimum spanning tree Prims algorithm

作者: GUAN-WEI WANG CHUN-XIA ZHANG JIAN ZHUANG DE-HONG YU

作者单位: School of Mechanical Engineering, Xian Jiaotong University, Shaanxi Xian 710049, China School of Science, Xian Jiaotong University, Shaanxi Xian 710049, China

会议类型: 国际会议

会议名称: 2011 International Conference on Wavelet Analysis and Pattern Recognition(2011小波分析与模式识别国际会议)

会议地点: 桂林

会议语种:英文

页码: 132-137

在线出版日期: 2011-07-10（万方平台首次上网日期，不代表论文的发表时间）