J4 ›› 2011, Vol. 49 ›› Issue (06): 1079-1086.

• 计算机科学 • 上一篇    下一篇

基于核的模糊c均值聚类算法的收敛性定理

曲福恒1, 胡雅婷2, 马驷良3, 苑丽红1, 孙爽滋1   

  1. 1. 长春理工大学 计算机科学与技术学院, 长春 130022; 2. 吉林农业大学 信息技术学院, 长春 130118;3. 吉林大学 数学研究所, 长春 130012
  • 收稿日期:2011-03-03 出版日期:2011-11-26 发布日期:2011-11-28
  • 通讯作者: 曲福恒 E-mail:qufuheng@163.com

A Convergence Theorem of Kernel Based FuzzycMeans Clustering Algorithm

QU Fuheng1, HU Yating2, MA Siliang3, YUAN Lihong1, SUN Shuangzi1   

  1. 1. School of Computer Science and Technology, Changchun University of Science and Technology, Changchun 130022,China|2. College of Information and Technology, Jilin Agriculture University, Changchun 130118, China;3. Institute of Mathematics, Jilin University, Changchun 130012, China
  • Received:2011-03-03 Online:2011-11-26 Published:2011-11-28
  • Contact: QU Fuheng E-mail:qufuheng@163.com

摘要:

利用Zangwill收敛性定理, 证明了基于核的模糊c均值聚类算法(KFCM)的收敛性. 结果表明, 当核函数在给定数据集上诱导的距离矩阵满足一定条件时, KFCM算法产生的迭代序列收敛或至少存在一个子序列收敛于KFCM聚类模型目标函数的局部极小值点或鞍点.

关键词: 聚类分析, 模糊c均值, 核函数, 收敛性

Abstract:

The convergence of the kernel based fuzzy cmeans clustering algorithm (KFCM) was established by applying the Zangwill’s convergence theorem. The result shows that when the distance matrix induced by kernel function satisfies the given conditions, the iteration sequence produced by the KFCM algorithm terminates at a local minimum or a saddle point, or at worst, conta
ins a subsequence which terminates at a local minimum or saddle point of the objective function of the KFCM clustering model.

Key words: cluster analysis, fuzzy cmeans, kernel function, convergence

中图分类号: 

  • TP391.4