哈尔滨工程大学学报2012，Vol.33Issue(7)：899-905,7.DOI:10.3969/j.issn.1006-7043.201109001
近邻传播的文本聚类集成谱算法
A document cluster ensemble spectral algorithm based on affinity propagation
摘要
Abstract
The existing cluster ensemble spectral algorithm are mostly unstable.To solve this problem,an affinity propagation-based cluster ensemble spectral algorithm was proposed,which brings in the idea of affinity propagation clustering.The algorithm utilized cluster ensemble and spectral analysis to achieve the low dimensional embedding of documents,and obtained the final clustering results by using an affinity propagation clustering algorithm.To a-void the high computational cost of eigenvalue decomposition in a spectral algorithm,matrix transformation was used in this paper.Experiments using real-world document sets show that the proposed algorithm is more stable than the compared methods,both NMI and ANMI values of the clustering result are higher than that of the comparison method.关键词
近邻传播/聚类集成/文本聚类/谱聚类/矩阵变换Key words
affinity propagation algorithm/cluster ensemble/document clustering/spectral clustering/matrix transformation分类
信息技术与安全科学引用本文复制引用
卢志茂,李纯,张琦..近邻传播的文本聚类集成谱算法[J].哈尔滨工程大学学报,2012,33(7):899-905,7.基金项目
国家自然科学基金资助项目(60975042). （60975042）
