CHSMST: a clustering algorithm based on hyper surface and minimum spanning tree

doi:10.1007/s00500-010-0585-z

	CHSMST: a clustering algorithm based on hyper surface and minimum spanning tree
	He, Qing 1; Zhao, Weizhong 1,2; Shi, Zhongzhi 1
	2011-06-01
发表期刊	SOFT COMPUTING
ISSN	1432-7643
卷号	15 期号:6 页码:1097-1103
摘要	As data mining having attracted a significant amount of research attention, many clustering algorithms have been proposed in the past decades. However, most of existing clustering methods have high computational time or are not suitable for discovering clusters with non-convex shape. In this paper, an efficient clustering algorithm CHSMST is proposed, which is based on clustering based on hyper surface (CHS) and minimum spanning tree. In the first step, CHSMST applies CHS to obtain initial clusters immediately. Thereafter, minimum spanning tree is introduced to handle locally dense data which is hard for CHS to deal with. The experiments show that CHSMST can discover clusters with arbitrary shape. Moreover, CHSMST is insensitive to the order of input samples and the run time of the algorithm increases moderately as the scale of dataset becomes large.
关键词	Hyper surface classification Clustering based on hyper surface Minimum spanning tree Clustering algorithm Data mining
DOI	10.1007/s00500-010-0585-z
收录类别	SCI
语种	英语
资助项目	National Science Foundation of China[60675010] ; National Science Foundation of China[60933004] ; National Science Foundation of China[60975039] ; 863 National High-Tech Program[2007AA01Z132] ; National Basic Research Priorities Programme[2007CB311004] ; National Science and Technology Support Plan[2006BAC08-B06]
WOS研究方向	Computer Science
WOS类目	Computer Science, Artificial Intelligence ; Computer Science, Interdisciplinary Applications
WOS记录号	WOS:000290768000006
出版者	SPRINGER
引用统计	被引频次：2[WOS] [WOS记录] [WOS相关记录]
文献类型	期刊论文
条目标识符	http://119.78.100.204/handle/2XEOYT63/13094
专题	中国科学院计算技术研究所期刊论文_英文
通讯作者	He, Qing
作者单位	1.Chinese Acad Sci, Inst Comp Technol, Key Lab Intelligent Informat Proc, Beijing 100190, Peoples R China 2.Chinese Acad Sci, Grad Univ, Beijing 100039, Peoples R China
推荐引用方式 GB/T 7714	He, Qing,Zhao, Weizhong,Shi, Zhongzhi. CHSMST: a clustering algorithm based on hyper surface and minimum spanning tree[J]. SOFT COMPUTING,2011,15(6):1097-1103.
APA	He, Qing,Zhao, Weizhong,&Shi, Zhongzhi.(2011).CHSMST: a clustering algorithm based on hyper surface and minimum spanning tree.SOFT COMPUTING,15(6),1097-1103.
MLA	He, Qing,et al."CHSMST: a clustering algorithm based on hyper surface and minimum spanning tree".SOFT COMPUTING 15.6(2011):1097-1103.