Semi-supervised Affinity Propagation Clustering Based on Subtractive Clustering for Large-Scale Data Sets

• 作者: Huifu Zhang Qi Zhu Quanqin Yang
• 来源期刊: 国际计算机前沿大会会议论文集
• 学科: 社会科学
• 关键词: subtractive CLUSTERING initial cluster AFFINITY PROPAGATION CLUSTERING SEMI-SUPERVISED CLUSTERING LARGE-SCALE data SETS
• 年，卷（期）: 2015,（1）
• 页码范围: 76-77
• 页数: 2页
• 分类号: C5

摘要

In the face of a growing number of large-scale data sets, affinity propagation clustering algorithm to calculate the process required to build the similarity matrix, will bring huge storage and computation. Therefore, this paper proposes an improved affinity propagation clustering algorithm. First, add the subtraction clustering, using the density value of the data points to obtain the point of initial clusters. Then, calculate the similarity distance between the initial cluster points, and reference the idea of semi-supervised clustering, adding pairs restriction information, structure sparse similarity matrix. Finally, the cluster representative points conduct AP clustering until a suitable cluster division.Experimental results show that the algorithm allows the calculation is greatly reduced, the similarity matrix storage capacity is also reduced, and better than the original algorithm on the clustering effect and processing speed.