J4 ›› 2014, Vol. 36 ›› Issue (03): 524-529.
• 论文 • Previous Articles Next Articles
QIAN Xuezhong 1,ZHAO Jianfang1,JIA Zhiwei2
Received:
Revised:
Online:
Published:
Abstract:
A clustering algorithm, named constraint projection based affinity propagation (AP), is proposed. The AP algorithm conducts clustering based on similarity matrix, outperforming many traditional 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 constrains 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 algorithms, the proposal is better in both time performance and clustering results.
Key words: semi-supervised;clustering;constraints;projection;affinity propagation
QIAN Xuezhong 1,ZHAO Jianfang1,JIA Zhiwei2. Constraint projection based affinity propagation [J]. J4, 2014, 36(03): 524-529.
0 / / Recommend
Add to citation manager EndNote|Ris|BibTeX
URL: http://joces.nudt.edu.cn/EN/
http://joces.nudt.edu.cn/EN/Y2014/V36/I03/524