Neural Computing and Applications

, Volume 31, Supplement 1, pp 435–445 | Cite as

Adaptive density distribution inspired affinity propagation clustering

  • Zheyi FanEmail author
  • Jiao Jiang
  • Shuqin Weng
  • Zhonghang He
  • Zhiwen Liu
Original Article


As an effective clustering method, Affinity Propagation (AP) has received extensive attentions. But its applications are seriously limited by two major deficiencies. Firstly, the ultimate exemplars and clusters are sensitive to a list of user-defined parameters called preferences. Secondly, it cannot deal with the nonspherical cluster issue. To solve these problems, an adaptive density distribution inspired AP clustering algorithm is proposed in this work. Aiming at the difficulties in preference selection, a density-adaptive preference estimation algorithm is proposed to explore the underlying exemplars, which can obtain the better clustering results by only using the local density distributions of data. Aiming at the arbitrary shape cluster problem, a non-parameter similarity measurement strategy based on the nearest neighbor searching is presented to describe the true structures of data, and then, the data with both spherical and nonspherical distributions can be clustered. The experiments conducted on various synthetic and public datasets demonstrate that the proposed method outperforms other state-of-the-art approaches.


Adaptive clustering Affinity propagation Density distribution Nearest neighbor network 


Compliance with Ethical Standards

Conflict of interests

The authors declare that they have no conflict of interest.


  1. 1.
    Rajaraman A, Ullman JD (2012) Mining of massive datasets. Cambridge University Press, New YorkGoogle Scholar
  2. 2.
    Jain AK, Duin RPW, Mao J (2000) Statistical pattern recognition: a review. IEEE Trans Pattern Anal Mach Intell 22(1):4–37CrossRefGoogle Scholar
  3. 3.
    Liu R, Anand A, Dey DK et al (2014) Entropy-based clustering of embryonic stem cells using digital holographic microscopy. J Opt Soc Am A Opt Image Sci Vis 31(4):677–684CrossRefGoogle Scholar
  4. 4.
    Jain AK (2008) Data clustering: 50 years beyond K-means. In: Proceedings of the 2008 European conference on machine learning and knowledge discovery in databases, Belgium, pp 3–4Google Scholar
  5. 5.
    MacQueen J (1967) Some methods for classification and analysis of multivariate observations. In: Proceedings of the 5th Berkeley symposium on mathematical statistics and probability, California, p 281C297Google Scholar
  6. 6.
    Pena JM, Lozano JA, Larranaga P (1999) An empirical comparison of four initialization methods for the K-means algorithm. Pattern Recogn Lett 20(10):1027C1040CrossRefGoogle Scholar
  7. 7.
    Frey BJ, Dueck D (2007) Clustering by passing messages between data points. Science 315(5814):972–976MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Zhang T, Wu RB (2015) Affinity propagation clustering of measurements for multiple extended target tracking. Sensors 15(9):22646–22659MathSciNetCrossRefGoogle Scholar
  9. 9.
    Frey BJ, Dueck D (2005) Mixture modeling by affinity propagation. In: Proceedings of the 18th advances in neural information processing systems, Columbia, p 379C386Google Scholar
  10. 10.
    Zha ZJ, Yang LJ, Mei T et al (2009) Visual query suggestion. In: Proceedings of the 17th ACM international conference on multimedia, Beijing, pp 15–24Google Scholar
  11. 11.
    Kokawa Y, Wu HY, Chen Q (2013) Improved affinity propagation for gesture recognition. Procedia Computer Science 22:938–990CrossRefGoogle Scholar
  12. 12.
    Chen DW, Sheng JQ, Chen JJ et al (2014) Stability-based preference selection in affinity propagation. Neural Comput & Applic 25(7-8):1809–1822CrossRefGoogle Scholar
  13. 13.
    Zhao ZQ, Gao J, Glotin H et al (2010) A matrix modular neural network based on task decomposition with subspace division by adaptive affinity propagation clustering. Appl Math Model 34(12):3884–3895MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Wang KJ, Zhang JY, Li D et al (2007) Adaptive affinity propagation clustering. ACTA Automatica Sinica 33(12):1242–1246zbMATHGoogle Scholar
  15. 15.
    Shang FH, Jiao LC, Shi JR et al (2012) Fast affinity propagation clustering: a multilevel approach. Pattern Recogn 45(1):474–486CrossRefGoogle Scholar
  16. 16.
    Qiu T, Li YJ (2015) A generalized affinity propagation clustering algorithm for nonspherical cluster discovery. arXiv:1501.04318. Accessed 13 August 2015
  17. 17.
    Gana GJ, Zhang YP, Deyc DK (2016) Clustering by propagating probabilities between data points. Appl Soft Comput 41:390–399CrossRefGoogle Scholar
  18. 18.
    Jun D, Ping WS, Lun XF (2010) Affinity propagation clustering based on variable-similarity measure. J Electron Inf Technol 32(3):509–514CrossRefGoogle Scholar
  19. 19.
    Balasubramanian M, Schwartz EL (2002) The isomap algorithm and topological stability. Science 295(5552):7–7CrossRefGoogle Scholar
  20. 20.
    Dueck D (2009) Affinity propagation: clustering data by passing messages. Dissertation, University of TorontoGoogle Scholar
  21. 21.
    Rodriguez A, Laio A (2014) Clustering by fast search and find of density peaks. Science 344(6191):1492–1496CrossRefGoogle Scholar
  22. 22.
    Jia HJ, Ding SF, Meng LH et al (2014) A density-adaptive affinity propagation clustering algorithm based on spectral dimension reduction. Neural Comput & Applic 25(7-8):1557–1567CrossRefGoogle Scholar
  23. 23.
    Zou XL, Zhu QS, Yang RL (2011) Natural nearest neighbor for isomap algorithm without free-parameter. Adv Mater Res 219-220:994–998CrossRefGoogle Scholar
  24. 24.
    Zhang S, Mouhoub M, Sadaoui S (2014) 3N-Q: natural nearest neighbor with quality. Comput Inform Sci 7(1):94–102Google Scholar
  25. 25.
    Strehl A, Ghosh J (2003) Cluster ensembles: a knowledge reuse framework for combining multiple partitions. J Mach Learn Res 3(3):583–617MathSciNetzbMATHGoogle Scholar
  26. 26.
    Hubert L, Arabie P (1985) Comparing partitions. J Classif 2(1):193–218CrossRefzbMATHGoogle Scholar
  27. 27.
    Frank A, Asuncion A (2010) UCI Machine learning repository. Accessed 1 July 1991

Copyright information

© The Natural Computing Applications Forum 2017

Authors and Affiliations

  • Zheyi Fan
    • 1
    Email author
  • Jiao Jiang
    • 1
  • Shuqin Weng
    • 1
  • Zhonghang He
    • 1
  • Zhiwen Liu
    • 1
  1. 1.School of Information and ElectronicsBeijing Institute of TechnologyBeijingChina

Personalised recommendations