%0 Journal Article
%T Semi-Supervised Clustering Based on Affinity Propagation Algorithm<br>基于近邻传播算法的半监督聚类
%A XIAO Yu
%A YU Jian
%A <br>肖宇
%A 于剑
%J 软件学报
%D 2008
%I 
%X 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.
%K semi-supervised clustering
%K affinity propagation
%K similarity matrix
%K pairwise constraints
%K prior knowledge<br>半监督聚类
%K 近邻传播
%K 相似度矩阵
%K 成对点约束
%K 先验知识
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=A8EEFDA1EEE20F937967079F1947E5CB&yid=67289AFF6305E306&vid=2A8D03AD8076A2E3&iid=708DD6B15D2464E8&sid=6041F87DFC7FDAD1&eid=6441F64489A9CB62&journal_id=1000-9825&journal_name=软件学报&referenced_num=8&reference_num=19