主管:中国科学院
主办:中国优选法统筹法与经济数学研究会
   中国科学院科技战略咨询研究院

中国管理科学 ›› 2006, Vol. ›› Issue (3): 76-79.

• 论文 • 上一篇    下一篇

一种基于PIM与核方法的模糊聚类新算法

关忠诚, 熊慧琴   

  1. 中国科学院科技政策与管理科学研究所, 北京, 100080
  • 收稿日期:2005-10-20 修回日期:2006-05-20 出版日期:2006-06-28 发布日期:2012-03-07

A New Fuzzy Clustering Algorithm Based on PIM and the Kernel Method

GUAN Zhong-cheng, XIONG Hui-qin   

  1. Institute of Policy & Management, Chinese Academy of Sciences, Beijing 100080, China
  • Received:2005-10-20 Revised:2006-05-20 Online:2006-06-28 Published:2012-03-07

摘要: 本文针对模糊C均值聚类在大数据量时收敛较慢以及不能对多种数据结构有效聚类的缺点,结合PIM算法与核方法提出了一种新的高效聚类算法———KPIM算法,并从理论上证明了该算法的收敛性.最后利用标准实验数据IRIS数据集测试,结果表明KPIM算法在保证收敛速度的同时,聚类效果更有效.

关键词: 模糊, 聚类, PIM算法, 核方法, KPIM算法

Abstract: The traditional "fuzzy" clustering(FCM) converges slowly when confronted with a large number of data points,meanwhile it can't deal with non-hyper spherical data structure,which compel us to present a new fuzzy clustering algorithm-the KPIM algorithm based on partition index maximization(PIM) algorithm and the kernel method.As well the paper proves convergence theorem of the new algorithm.The results of experiments on the real data show that the KPIM algorithm can effectively cluster on data with diversiform structures while guaranteeing the computation time in contrast to other previous algorithms.

Key words: fuzzy, clustering, PIM, kernel method, KPIM algorithm

中图分类号: