K-AP Clustering Algorithm for Large Scale Dataset

Affinity propagation clustering algorithm is with a broad value in science and engineering because of it no need to input the number of clusters in advances, robustness and good generalization. But the algorithm needs the initial similarity (the distance between any two points) as a parameter, a lot of time and storage space is required for the calculation of similarity. It´s limited to apply to cluster of the large amounts of data. To solve problem, this paper brings forward K-AP cluster algorithm which integrate k-means algorithm to AP algorithm to decrease time-consuming and space superiority. The results show the K-AP algorithm is faster than the original algorithm processing in speed, and it can cluster large amounts of data, and achieve better results.