基于近邻传播算法的半监督聚类-软件学报.pdfVIP

ISSN 1000-9825, CODEN RUXUEW E-mail: jos@ Journal of Software , Vol.19, No.11, November 2008, pp.2803−2813 DOI: 10.3724/SP.J.1001.2008.02803 Tel/Fax: +86-10 © 2008 by Journal of Software . All rights reserved. ∗ 基于近邻传播算法的半监督聚类 + 肖 宇 , 于 剑 (北京交通大学 计算机与信息技术学院,北京 100044) Semi-Supervised Clustering Based on Affinity Propagation Algorithm + XIAO Yu , YU Jian (School of Computer and Information Technology, Beijing Jiaotong University, Beijing 100044, China) + Corresponding author: E-mail: Xiao Y, Yu J. Semi-Supervised clustering based on affinity propagation algorithm. Journal of Software, 2008, 19(11):2803−2813. /1000-9825/19/2803.htm Abstract : A semi-supervised clustering method based on affinity propagation (AP) algorithm is proposed in this paper. AP takes as input measures of similarity between pairs of data points. AP is an efficient and fast clustering algorithm for large dataset compared with the existing clustering algorithms, such as K-center clustering. But for the datasets with complex cluster structures, it cannot produce good clustering results. It can improve the clustering performance of AP by using the priori known labeled data or pairwise constraints to adjust the similarity matrix. Experimental results show that such method indeed reaches its goal for complex datasets, and this method outperforms the comparative methods when there are a large number of pairwise constraints. Key words: semi-supervised clustering; affinity propagation; similarity matrix; pairwise constraints; prior knowledge 摘 要: 提出了一种基于近邻传播(affinity propagation,简称AP)算法的半监督聚类方法.AP 是在数据点的相似 度矩阵的基础上进行聚类.对