知识与财富的链接
提出了一种基于近邻传播(affinity propagation,简称AP)算法的半监督聚类方法.AP是在数据点的相似度矩阵的基础上进行聚类.对于规模很大的数据集,AP算法是一种快速、有效的聚类方法,这是其他传统的聚类算法所不能及的,比如:K中心聚类算法.但是,对于一些聚类结构比较复杂的数据集,AP算法往往不能得到很好的聚类结果.使用已知的标签数据或者成对点约束对数据形成的相似度矩阵进行调整,进而达到提高AP算法的聚类性能.实验结果表明,该方法不仅提高了AP对复杂数据的聚类结果,而且在约束对数量较多时,该方法要优于相关比对算法.
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.
