Abstract
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.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Rajaraman A, Ullman JD (2012) Mining of massive datasets. Cambridge University Press, New York
Jain AK, Duin RPW, Mao J (2000) Statistical pattern recognition: a review. IEEE Trans Pattern Anal Mach Intell 22(1):4–37
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–684
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–4
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 281C297
Pena JM, Lozano JA, Larranaga P (1999) An empirical comparison of four initialization methods for the K-means algorithm. Pattern Recogn Lett 20(10):1027C1040
Frey BJ, Dueck D (2007) Clustering by passing messages between data points. Science 315(5814):972–976
Zhang T, Wu RB (2015) Affinity propagation clustering of measurements for multiple extended target tracking. Sensors 15(9):22646–22659
Frey BJ, Dueck D (2005) Mixture modeling by affinity propagation. In: Proceedings of the 18th advances in neural information processing systems, Columbia, p 379C386
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–24
Kokawa Y, Wu HY, Chen Q (2013) Improved affinity propagation for gesture recognition. Procedia Computer Science 22:938–990
Chen DW, Sheng JQ, Chen JJ et al (2014) Stability-based preference selection in affinity propagation. Neural Comput & Applic 25(7-8):1809–1822
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–3895
Wang KJ, Zhang JY, Li D et al (2007) Adaptive affinity propagation clustering. ACTA Automatica Sinica 33(12):1242–1246
Shang FH, Jiao LC, Shi JR et al (2012) Fast affinity propagation clustering: a multilevel approach. Pattern Recogn 45(1):474–486
Qiu T, Li YJ (2015) A generalized affinity propagation clustering algorithm for nonspherical cluster discovery. arXiv:1501.04318. http://sciencewise.info/articles/1501.04318. Accessed 13 August 2015
Gana GJ, Zhang YP, Deyc DK (2016) Clustering by propagating probabilities between data points. Appl Soft Comput 41:390–399
Jun D, Ping WS, Lun XF (2010) Affinity propagation clustering based on variable-similarity measure. J Electron Inf Technol 32(3):509–514
Balasubramanian M, Schwartz EL (2002) The isomap algorithm and topological stability. Science 295(5552):7–7
Dueck D (2009) Affinity propagation: clustering data by passing messages. Dissertation, University of Toronto
Rodriguez A, Laio A (2014) Clustering by fast search and find of density peaks. Science 344(6191):1492–1496
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–1567
Zou XL, Zhu QS, Yang RL (2011) Natural nearest neighbor for isomap algorithm without free-parameter. Adv Mater Res 219-220:994–998
Zhang S, Mouhoub M, Sadaoui S (2014) 3N-Q: natural nearest neighbor with quality. Comput Inform Sci 7(1):94–102
Strehl A, Ghosh J (2003) Cluster ensembles: a knowledge reuse framework for combining multiple partitions. J Mach Learn Res 3(3):583–617
Hubert L, Arabie P (1985) Comparing partitions. J Classif 2(1):193–218
Frank A, Asuncion A (2010) UCI Machine learning repository. http://archive.ics.uci.edu/ml/. Accessed 1 July 1991
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interests
The authors declare that they have no conflict of interest.
Rights and permissions
About this article
Cite this article
Fan, Z., Jiang, J., Weng, S. et al. Adaptive density distribution inspired affinity propagation clustering. Neural Comput & Applic 31 (Suppl 1), 435–445 (2019). https://doi.org/10.1007/s00521-017-3024-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00521-017-3024-6