适用于复杂结构的多路谱聚类算法的改进  

Improvement on Muti-way Spectral Clustering Algorithm for Complex Distributed Data

作　　者：李新叶[1] 余晓晔[2] 

机构地区：[1]华北电力大学电子与通信工程系,河北保定071003 [2]华北电力大学网络与信息管理中心,河北保定071003

出　　处：《北京工业大学学报》2013年第3期425-429,共5页Journal of Beijing University of Technology

基　　金：国家自然科学基金资助项目(61174111);中央高校基本科研业务费专项资金资助项目(09QG08)

摘　　要：为使多路谱聚类方法对复杂结构数据集有效地聚类,根据矩阵扰动理论,利用局部近邻关系更新谱聚类算法(NJW)中的初始相似度矩阵,得到最终的亲和矩阵.理论分析表明,数据集可划分时,该矩阵是理想块矩阵或接近理想块矩阵,保证了本文算法聚类划分的正确性.将本文算法和基于路径的谱聚类、密度敏感的谱聚类以及基于流平面排序的谱聚类进行了比较,结果表明,本文算法在数据集具有复杂分布结构时可以确定聚类个数,得到正确的聚类结果.进一步将本文算法用于真实数据集上的聚类分析,表明本文算法是有效的.To cluster the complex structure dataset effectively using multi-way spectral clustering, based on the matrix perturbation theory, the initial similarity matrix in Ng-Jordan-Weiss （NJW） algorithm was updated by using local neighbor relation and then the last affinity matrix was gained. Theoretical analysis showed that this last affinity matrix was ideal block matrix or near ideal block matrix so that it could make the clustering correct. The method was compared with path-based spectral clustering, density-sensitive spectral clustering and spectral clustering through ranking on manifolds together. Result illustrates that the affinity matrix can decide the clustering number so as to get the correct clustering result. Further, the real dataset is used to check our method, and the result shows that the method is effective.

关 键 词：谱聚类 亲和矩阵 近邻关系 复杂结构 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]