结合限制的分隔模型及K-Means算法.PDFVIP

1000-9825/2005/16(05)0799 ©2005 Journal of Software 软 件 学 报 Vol.16, No.5 ∗ 结合限制的分隔模型及 K-Means 算法 1,2+ 2 何振峰 , 熊范纶 1( 中国科学技术大学 自动化系,安徽 合肥 230027) 2( 中国科学院 合肥智能机械研究所,安徽 合肥 230031) A Constrained Partition Model and K-Means Algorithm HE Zhen-Feng1,2+, XIONG Fan-Lun2 1(Department of Automation, University of Science and Technology of China, Hefei 230027, China) 2(Hefei Institute of Intelligent Machines, The Chinese Academy of Sciences, Hefei 230031, China) + Corresponding author: Phn: +86-551-3430270, E-mail: hezhenfeng@, Received 2004-01-09; Accepted 2004-03-17 He ZF, Xiong FL. A constrained partition model and K-means algorithm. Journal of Soft ware, 2005,16(5): 799−809. DOI: 10.1360/jos160799 Abstract: Incorporating instance-level constraints into K-means algorithm can improve the accuracy of clustering. As the partition generated is represented by K centers and a cluster is represented by only one center, the representation model prevents further improvement of the accuracy. Based upon the instance-level constraints, two types of constraints between instance and class are presented, three types of constraints between classes are presented too, and the constrained partition model is presented and analyzed. In this model, based upon the constraints between sub-clusters, more centers are utilized to represent one cluster, which makes the representation of partition flexible and precise. An algorithm CKS (constrained K-means with subsets) is presented to generate the constrained partition. The experiments on three UCI datasets: Glass, Iris and Sonar, suggest that CKS is remarkably superior to COP-K-means in accuracy and robustness, and is better than CCL