吉林大学学报(理学版)

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

基于半监督的模糊C-均值聚类算法

郭新辰1, 郗仙田1, 樊秀玲1, 韩啸2   

  1. 1. 东北电力大学 理学院, 吉林 吉林 132012; 2. 吉林大学 学报编辑部, 长春 130012
  • 收稿日期:2014-12-17 出版日期:2015-07-26 发布日期:2015-07-27
  • 通讯作者: 韩啸 E-mail:hanxiao@jlu.edu.cn

Fuzzy C-Means Clustering Algorithm Based onSemi-supervised Learning

GUO Xinchen1, XI Xiantian1, FAN Xiuling1, HAN Xiao2   

  1. 1. College of Science, Northeast Dianli University, Jilin 132012, Jilin Province, China;2. Editorial Department of Journal of Jilin University, Changchun 130012, China
  • Received:2014-12-17 Online:2015-07-26 Published:2015-07-27
  • Contact: hanxiao E-mail:hanxiao@jlu.edu.cn

摘要:

通过将半监督学习的思想引入到模糊C-均值聚类方法中, 提出一种基于半监督的模糊C-均值聚类算法, 有效解决了模糊C-均值聚类算法随机选取初始聚类中心导致聚类结果局部收敛的问题, 能客观获取最佳聚类数目和初始聚类中心. 实验结果表明, 与传统模糊C-均值聚类算法相比, 基于半监督的模糊C-均值算法在一定程度上减少了迭代次数, 降低了对初始聚类中心的依赖性.

关键词: 半监督学习, 模糊C-均值聚类算法, 信息熵

Abstract:

A fuzzy C-means clustering algorithm based on semisupervised learning was proposed by introducing semisupervised learning into fuzzy C-means clustering algorithm. It has effectively solved the problem that the initial clustering centers random selection of fuzzy C-means algorithm can easily cause the local convergence and affects the clustering. The proposed algorithm can objectively obtain the optimal number of clusters and the initial cluster centers. Compared with the traditional FCM, our method can reduce the number of  iterations and the dependence on initial cluster centers.

Key words: semi-supervised learning, fuzzy C-means clustering algorithm, information entropy

中图分类号: 

  • TP181