ADAPTIVE SEMI-SUPERVISED AFFINITY PROPAGATION CLUSTERING ALGORITHM BASED ON STRUCTURAL SIMILARITY

Original scientific paper In view of the unsatisfying clustering effect of affinity propagation (AP) clustering algorithm when dealing with data sets of complex structures, an adaptive semi-supervised affinity propagation clustering algorithm based on structural similarity (SAAP-SS) is proposed in this paper. First, a novel structural similarity is proposed by solving a non-linear, low-rank representation problem. Then we perform affinity propagation on the basis of adjusting the similarity matrix by utilizing the known pairwise constraints. Finally, the idea of fireworks explosion is introduced into the process of the algorithm. By adaptively searching the preference space bi-directionally, the algorithm’s global and local searching abilities are balanced in order to find the optimal clustering structure. The results of the experiments with both synthetic and real data sets show performance improvements of the proposed algorithm compared with AP, FEO-SAP and K-means methods.

[1]  Yasuhiro Fujiwara,et al.  Fast Algorithm for Affinity Propagation , 2011, IJCAI.

[2]  Le Song,et al.  Robust Low Rank Kernel Embeddings of Multivariate Distributions , 2013, NIPS.

[3]  René Vidal,et al.  A closed form solution to robust subspace estimation and clustering , 2011, CVPR 2011.

[4]  Meng Ma,et al.  Two-Phase Clustering Algorithm for Complex Distributed Data: Two-Phase Clustering Algorithm for Complex Distributed Data , 2011 .

[5]  Tang Dong.  Efficient Cluster Analysis Method for Protein Sequences , 2011 .

[6]  YU Hong-tao.  Semi-supervised affinity propagation clustering based on manifold distance , 2011 .

[7]  René Vidal,et al.  Sparse Subspace Clustering: Algorithm, Theory, and Applications , 2012, IEEE transactions on pattern analysis and machine intelligence.

[8]  Shuicheng Yan,et al.  Latent Low-Rank Representation for subspace segmentation and feature extraction , 2011, 2011 International Conference on Computer Vision.

[9]  Bai Yong.  Solving large scale location problem using affinity propagation clustering , 2010 .

[10]  Maoguo Gong,et al.  Fast density-weighted low-rank approximation spectral clustering , 2011, Data Mining and Knowledge Discovery.

[11]  Hong Zhu,et al.  A parallel attribute reduction algorithm based on Affinity Propagation clustering , 2013, J. Comput..

[12]  Pedro Larrañaga,et al.  Learning Factorizations in Estimation of Distribution Algorithms Using Affinity Propagation , 2010, Evolutionary Computation.

[13]  Lorenzo Bruzzone,et al.  Incremental and Decremental Affinity Propagation for Semisupervised Clustering in Multispectral Images , 2013, IEEE Transactions on Geoscience and Remote Sensing.

[14]  Junbin Gao,et al.  Robust latent low rank representation for subspace clustering , 2014, Neurocomputing.

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

[16]  Tang Xu-qing.  Comparative Study on Method for Determining Optimal Number of Clusters Based on Affinity Propagation Clustering , 2011 .

[17]  René Vidal,et al.  Latent Space Sparse Subspace Clustering , 2013, 2013 IEEE International Conference on Computer Vision.

[18]  Gao Hong-jiang.  Cluster Ensemble Algorithm Using Affinity Propagation , 2011 .

[19]  Sinan Saraçli.  Performance of Rand’s C statistics in clustering analysis: an application to clustering the regions of Turkey , 2013 .

[20]  Lin Wang,et al.  Accounting for non-genetic factors by low-rank representation and sparse regression for eQTL mapping , 2013, Bioinform..

[21]  D. Assistant,et al.  An Efficient Clustering Technique for Message Passing between Data Points using Affinity Propagation , 2011 .

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

[23]  Zhao Ying-kai.  Modeling of ARA fermentation based on affinity propagation clustering , 2011 .

[24]  René Vidal,et al.  Low rank subspace clustering (LRSC) , 2014, Pattern Recognit. Lett..

[25]  Brendan J. Frey,et al.  Hierarchical Affinity Propagation , 2011, UAI.

[26]  Alexander G. Gray,et al.  Dependence maps, a dimensionality reduction with dependence distance for high-dimensional data , 2013, Data Mining and Knowledge Discovery.

[27]  Nenghai Yu,et al.  Non-negative low rank and sparse graph for semi-supervised learning , 2012, 2012 IEEE Conference on Computer Vision and Pattern Recognition.

[28]  Yongsheng Ding,et al.  Low-Rank Kernel Matrix Factorization for Large-Scale Evolutionary Clustering , 2012, IEEE Transactions on Knowledge and Data Engineering.

[29]  Yu Xiao,et al.  Semi-Supervised Clustering Based on Affinity Propagation Algorithm: Semi-Supervised Clustering Based on Affinity Propagation Algorithm , 2009 .

[30]  Dima Damen,et al.  Recognizing linked events: Searching the space of feasible explanations , 2009, 2009 IEEE Conference on Computer Vision and Pattern Recognition.

[31]  Bingxin Xu,et al.  Combining affinity propagation with supervised dictionary learning for image classification , 2012, Neural Computing and Applications.

[32]  Jian-Huang Lai,et al.  APSCAN: A parameter free algorithm for clustering , 2011, Pattern Recognit. Lett..

[33]  Wang Wei.  Quick identification of multilevel similar earthquakes using hierarchical clustering method and its application to Wenchuan northeast aftershock sequence , 2012 .

[34]  Zhaohong Deng,et al.  A Novel Text Clustering Algorithm Based on Feature Weighting Distance and Soft Subspace Learning , 2012 .

[35]  Michael Elad,et al.  Probabilistic Subspace Clustering Via Sparse Representations , 2013, IEEE Signal Processing Letters.

[36]  Inderjit S. Dhillon,et al.  Clustered low rank approximation of graphs in information science applications , 2011, SDM.

[37]  Yong Yu,et al.  Robust Recovery of Subspace Structures by Low-Rank Representation , 2010, IEEE Transactions on Pattern Analysis and Machine Intelligence.