基于约束投影的近邻传播聚类算法  

Constraint projection based affinity propagation

作　　者：钱雪忠[1] 赵建芳[1] 贾志伟[2] 

机构地区：[1]江南大学物联网工程学院,江苏无锡214122 [2]成都信息工程学院,四川成都610225

出　　处：《计算机工程与科学》2014年第3期524-529,共6页Computer Engineering & Science

基　　金：国家自然科学基金资助项目(61103129);江苏省科技支撑计划资助项目(BE2009009)

摘　　要：提出了一种基于约束投影的近邻传播AP聚类算法。AP算法是在数据点相似度矩阵的基础上进行聚类的,很多传统的聚类方法都无法与其相媲美。但是,对于结构复杂的数据,AP算法往往得不到理想的结果。文中算法先对约束信息进行扩展,然后利用扩展的约束信息指导投影矩阵的获取,在低维空间中,利用约束信息对聚类结果进行修正。实验表明,文中算法与对比算法相比,时间性能更优,聚类效果更佳。A clustering algorithm, named constraint projection based affinity propagation （AP）, is proposed. The AP algorithm conducts clustering based on similarity matrix, outperforming many tradi- tional clustering algorithms. However, for those datasets with complex structure, the AP algorithm cannot always achieve the ideal results. Firstly, constraints are enlarged. Secondly, the enlarged con- strains are used in getting the projection matrix. At last, the clustering result is updated by the enlarged constraints in the space with lower dimension. The result shows that, compared with the comparison al- gorithms, the proposal is better in both time performance and clustering results.

关 键 词：半监督 聚类 约束信息 投影 近邻传播 

分 类 号：TP274[自动化与计算机技术—检测技术与自动化装置]