Skip to main content
SpringerLink
Log in

Multi-exemplar affinity propagation clustering based on local density peak

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

As the representatives of subclusters in multi-exemplar affinity propagation clustering (MEAP), exemplars are important in generating and merging subclusters. However, MEAP ignores the difference in data point distribution between local neighbourhoods, leading to a situation in which these selected exemplars are sometimes not the most appropriate points to represent subclusters, and the clustering performance is greatly affected. Meanwhile, local density peaks (LDPs) are found to be good representatives in local neighbourhoods. Thus, we propose the multi-exemplar affinity propagation clustering algorithm based on local density peaks (LDP-MEAP), where each exemplar should be selected from LDPs. Since MEAP must regard all points as potential exemplars (PE), we first design the MEAP with settable PE based on the assumption that the similarity values from points to PE are finite and to non-PE are negatively infinite, and we call it MEAP-PE. We then search the LDPs by point similarities to coordinate with MEAP-PE using k nearest neighbours and local density with natural neighbours. Finally, we specify that all LDPs are PE in MEAP-PE and update messages iteratively to obtain clusters. We combine MEAP-PE with LDPs, providing a new approach for AP-based clustering methods with lower computational complexity and better clustering performance. Compared with other LDP-based methods, LDP-MEAP also has better clustering performance. Comparative experiments with many prior approaches on 16 datasets demonstrate the superiority of our proposed method.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Algorithm 1:
Fig. 5
Algorithm 2:
Fig. 6
Fig. 7
Algorithm 3:
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20
Fig. 21

Similar content being viewed by others

References

  1. Rodriguez A, Laio A (2014) Clustering by fast search and find of density peaks. Science 344(6191):1492–1496

    Article  CAS  PubMed  ADS  Google Scholar 

  2. Frey BJ, Dueck D (2007) Clustering by passing messages between data points. Science 315(5814):972–976

    Article  MathSciNet  CAS  PubMed  ADS  Google Scholar 

  3. Long Z, Gao Y, Meng H et al (2022) Clustering based on local density peaks and graph cut. Inf Sci 600:263–286

    Article  Google Scholar 

  4. Cheng D, Zhu Q, Huang J et al (2019) Clustering with local density peaks-based minimum spanning tree. IEEE Trans Knowl Data Eng 33(2):374–387

    Article  Google Scholar 

  5. Guan J, Li S, He X et al (2021) Fast hierarchical clustering of local density peaks via an association degree transfer method. Neurocomputing 455:401–418

    Article  Google Scholar 

  6. Kschischang FR, Frey BJ, Loeliger HA (2001) Factor graphs and the sum-product algorithm. IEEE Trans Inf Theory 47(2):498–519

    Article  MathSciNet  Google Scholar 

  7. Wang CD, Lai JH, Suen CY et al (2013) Multi-exemplar affinity propagation. IEEE Trans Pattern Anal Mach Intell 35(9):2223–2237

    Article  PubMed  Google Scholar 

  8. Liang B, Cai JH, Yang HF (2023) Grid-DPC: improved density peaks clustering based on spatial grid walk. Appl Intell 53(3):3221–3239

    Article  Google Scholar 

  9. Li C, Ding S, Xu X et al (2022) Fast density peaks clustering algorithm in polar coordinate system. Appl Intell 52(12):14478–14490

    Article  Google Scholar 

  10. Lotfi A, Moradi P, Beigy H (2020) Density peaks clustering based on density backbone and fuzzy neighborhood. Pattern Recogn 107:107449

    Article  Google Scholar 

  11. Wang Y, Wang D, Zhang X et al (2020) McDPC: multi-center density peak clustering. Neural Comput Appl 32:13465–13478

    Article  Google Scholar 

  12. Wang P, Wu T, Yao Y (2023) A three-way adaptive density peak clustering (3W-ADPC) method. Appl Intell:1–17

  13. Niu X, Zheng Y, Fournier-Viger P et al (2021) Parallel grid-based density peak clustering of big trajectory data. Appl Intell:1–16

  14. Guan J, Li S, He X et al (2022) SMMP: a stable-membership-based auto-tuning multi-peak clustering algorithm. IEEE Trans Pattern Anal Mach Intell 45(5):6307–6319

    Google Scholar 

  15. Zhang X, Wang W, Nørvåg K et al (2010) K-AP: generating specified K clusters by efficient affinity propagation. 2010 IEEE International Conference on Data Mining. IEEE, pp 1187–1192

  16. Wang Y, Chen L (2015) K-MEAP: multiple exemplars affinity propagation with specified K clusters. IEEE Trans Neural Netw Learn Syst 27(12):2670–2682

    Article  MathSciNet  PubMed  Google Scholar 

  17. Li P, Ji H, Wang B et al (2017) Adjustable preference affinity propagation clustering. Pattern Recogn Lett 85:72–78

    Article  ADS  Google Scholar 

  18. Li Y, Guo C, Sun L (2020) Fast clustering by affinity propagation based on density peaks. IEEE Access 8:138884–138897

    Article  Google Scholar 

  19. Givoni I, Frey B (2009) Semi-supervised affinity propagation with instance-level constraints. Artificial intelligence and statistics. PMLR, pp 161–168

  20. Zhou R, Liu Q, Wang J et al (2021) Modified semi-supervised affinity propagation clustering with fuzzy density fruit fly optimization. Neural Comput Appl 33:4695–4712

    Article  Google Scholar 

  21. Duan Y, Liu C, Li S et al (2023) An automatic affinity propagation clustering based on improved equilibrium optimizer and t-SNE for high-dimensional data. Inf Sci 623:434–454

    Article  Google Scholar 

  22. Weiss Y, Freeman WT (2001) On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs. IEEE Trans Inf Theory 47(2):736–744

    Article  MathSciNet  Google Scholar 

  23. Zhu Q, Feng J, Huang J (2016) Natural neighbor: a self-adaptive neighborhood method without parameter K. Pattern Recogn Lett 80:30–36

    Article  ADS  Google Scholar 

  24. Cheng D, Zhu Q, Huang J et al (2017) Natural neighbor-based clustering algorithm with local representatives. Knowl-Based Syst 123:238–253

    Article  Google Scholar 

  25. Dueck D (2009) Affinity propagation: clustering data by passing messages. University of Toronto, Toronto

    Google Scholar 

  26. Gionis A, Mannila H, Tsaparas P (2007) Clustering aggregation. Acm transactions on knowledge discovery from data (tkdd) 1(1): 4-es.

  27. Veenman CJ, Reinders MJT, Backer E (2002) A maximum variance cluster algorithm. IEEE Trans Pattern Anal Mach Intell 24(9):1273–1280

    Article  Google Scholar 

  28. Fränti P, Virmajoki O (2006) Iterative shrinking method for clustering problems. Pattern Recogn 39(5):761–775

    Article  ADS  Google Scholar 

  29. Kelly M, Longjohn R, Nottingham K (2023) The UCI machine learning repository. https://archive.ics.uci.edu

  30. Belhumeur PN, Hespanha JP, Kriegman DJ (1997) Eigenfaces vs. fisherfaces: recognition using class specific linear projection. IEEE Trans Pattern Anal Mach Intell 19(7):711–720

    Article  Google Scholar 

  31. Fei-Fei L, Perona P (2005) A bayesian hierarchical model for learning natural scene categories. 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05). IEEE 2, pp 524–531

  32. LeCun Y, Cortes C, Burges C (2010) MNIST handwritten digit database. http://yann.lecun.com/exdb/mnist/

  33. MacQueen J (1967) Some methods for classification and analysis of multivariate observations. Proceedings of the fifth Berkeley symposium on mathematical statistics and probability 1(14), pp 281–297

  34. Shi J, Malik J (2000) Normalized cuts and image segmentation. IEEE Trans Pattern Anal Mach Intell 22(8):888–905

    Article  Google Scholar 

  35. Ester M, Kriegel HP, Sander J et al (1996) A density-based algorithm for discovering clusters in large spatial databases with noise. Kdd 96(34):226–231

    Google Scholar 

  36. Yang Y, Xu D, Nie F et al (2010) Image clustering using local discriminant models and global integration. IEEE Trans Image Process 19(10):2761–2773

    Article  MathSciNet  PubMed  ADS  Google Scholar 

  37. Kuhn HW (1955) The Hungarian method for the assignment problem. Nav Res Logist Q 2(1–2):83–97

    Article  MathSciNet  Google Scholar 

  38. Xu W, Liu X, Gong Y (2003) Document clustering based on non-negative matrix factorization. Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval, pp 267–273

  39. Vinh NX, Epps J, Bailey J (2009) Information theoretic measures for clusterings comparison: is a correction for chance necessary?. Proceedings of the 26th annual international conference on machine learning, pp 1073–1080

  40. Lowe DG (2004) Distinctive image features from scale-invariant keypoints. Int J Comput Vision 60:91–110

    Article  Google Scholar 

Download references

Acknowledgements

This work was supported by the National Natural Science Foundation of China under Grant 62076110 and the Fundamental Research Funds for the Central Universities under Grant JUSRP221027.

Author information

Authors and Affiliations

  1. School of Artificial Intelligence and Computer Science, Jiangnan University, Wuxi, 214122, China

    Shibing Zhou, Zhewei Chen, Rao Duan & Wei Song

  2. Jiangsu Provincial Engineering Laboratory for Pattern Recognition and Computational Intelligence, Jiangnan University, Wuxi, 214122, China

    Shibing Zhou, Zhewei Chen, Rao Duan & Wei Song

Authors
  1. Shibing Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhewei Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Rao Duan
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Wei Song
    View author publications

    You can also search for this author in PubMed Google Scholar

Contributions

Shibing Zhou: Conceptualization, Methodology, Software, Data curation, Writing—review & editing, Supervision. Zhewei Chen: Conceptualization, Methodology, Software, Data curation, Writing—review & editing. Rao Duan: Data curation. Wei Song: Supervision.

Corresponding author

Correspondence to Shibing Zhou.

Ethics declarations

Competing interest

The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhou, S., Chen, Z., Duan, R. et al. Multi-exemplar affinity propagation clustering based on local density peak. Appl Intell 54, 2915–2939 (2024). https://doi.org/10.1007/s10489-023-05243-7

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10489-023-05243-7

Keywords

Search

Navigation