计算机应用 ›› 2010, Vol. 30 ›› Issue (07): 1936-1937.

• 数据库技术 • 上一篇    下一篇

基于全局K-Means的谱聚类算法

谢皝1,张平伟2,罗晟2   

  1. 1. 上海大学
    2.
  • 收稿日期:2010-01-22 修回日期:2010-03-13 发布日期:2010-07-01 出版日期:2010-07-01
  • 通讯作者: 谢皝

Spectral clustering based on global K-means

  • Received:2010-01-22 Revised:2010-03-13 Online:2010-07-01 Published:2010-07-01
  • Contact: XIE Huang

摘要: 谱聚类算法是近年来研究得比较多的一种聚类算法。但谱聚类是对初始化敏感的,针对这种缺陷,提出一种基于全局K-means的谱聚类算法(GKSC),引入对初值不敏感的全局K-means算法来改善。通过仿真实验表明:GKSC与传统谱聚类算法相比更能得到稳定的聚类结果和更高的聚类精确度。

关键词: 全局K-Means, 谱聚类, 初始值敏感

Abstract: Spectral clustering is an effectively widely used clustering method. With the essence of initialization sensitivity in spectral clustering, the Global K-means clustering algorithm was introduced to overcome the disadvantage. Then a spectral clustering algorithm based on global k-means was coming. Compared with the traditional spectral algorithm, some experiments showed that the proposed algorithm was not only effective and feasible but also good at getting stable clustering results and suitably improving clustering precision .

Key words: global K-Means, spectral clustering, initialization sensitivity