Affinity Propagation Algorithm Based on Locality Preserving Projections and Particle Swarm Optimization

Affinity propagation algorithm is a new powerful and effective clustering method. One of the major problems in clustering is the determination of the optimal number of clusters. In this paper, the particle swarm optimization algorithm is utilized to cope with this problem by using the parameter p as each particle and Silhouette index as the fitness, which can search for the optimal value of p and determine the optimal number of clusters automatically. Moreover, the problem of information overlap is the main drawback of affinity propagation algorithm in dealing with complex structure or high dimensional data for clustering. Hence the enhanced Locality preserving projections method is proposed to integrate with affinity propagation algorithm to reduce the dimension of the data as a processing step. As the result of experiment shows, the proposed method can simultaneously obtain the optimal number of clusters accurately and improve the clustering accuracy by eliminating the redundant information of the data without losing the internal nonlinear structure.

[1]  Anil K. Jain.  Data clustering: 50 years beyond K-means , 2010, Pattern Recognit. Lett..

[2]  Xiangliang Zhang,et al.  K-AP: Generating Specified K Clusters by Efficient Affinity Propagation , 2010, 2010 IEEE International Conference on Data Mining.

[3]  Hongjie Jia,et al.  A density-adaptive affinity propagation clustering algorithm based on spectral dimension reduction , 2014, Neural Computing and Applications.

[4]  Bei Chen,et al.  Affinity Propagation Clustering Algorithm Based on PCA , 2014 .

[5]  Chang-Dong Wang,et al.  Multi-Exemplar Affinity Propagation , 2013, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6]  Xiaofei He,et al.  Locality Preserving Projections , 2003, NIPS.

[7]  Russell C. Eberhart,et al.  A new optimizer using particle swarm theory , 1995, MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science.

[8]  Michael K. Ng,et al.  Subspace clustering using affinity propagation , 2015, Pattern Recognit..

[9]  Fei Wang,et al.  Fast affinity propagation clustering: A multilevel approach , 2012, Pattern Recognit..

[10]  Delbert Dueck,et al.  Clustering by Passing Messages Between Data Points , 2007, Science.

[11]  Narasimhan Sundararajan,et al.  Self regulating particle swarm optimization algorithm , 2015, Inf. Sci..

[12]  Tao Guo,et al.  Adaptive Affinity Propagation Clustering , 2008, ArXiv.

[13]  Jun Dong,et al.  Affinity Propagation Clustering Based on Variable-Similarity Measure: Affinity Propagation Clustering Based on Variable-Similarity Measure , 2010 .