{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T09:06:56Z","timestamp":1768813616295,"version":"3.49.0"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62076110"],"award-info":[{"award-number":["62076110"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["JUSRP221027"],"award-info":[{"award-number":["JUSRP221027"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2024,2]]},"DOI":"10.1007\/s10489-023-05243-7","type":"journal-article","created":{"date-parts":[[2024,2,19]],"date-time":"2024-02-19T21:07:33Z","timestamp":1708376853000},"page":"2915-2939","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Multi-exemplar affinity propagation clustering based on local density peak"],"prefix":"10.1007","volume":"54","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5185-8777","authenticated-orcid":false,"given":"Shibing","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhewei","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rao","family":"Duan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,2,19]]},"reference":[{"issue":"6191","key":"5243_CR1","doi-asserted-by":"publisher","first-page":"1492","DOI":"10.1126\/science.1242072","volume":"344","author":"A Rodriguez","year":"2014","unstructured":"Rodriguez A, Laio A (2014) Clustering by fast search and find of density peaks. Science 344(6191):1492\u20131496","journal-title":"Science"},{"issue":"5814","key":"5243_CR2","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1126\/science.1136800","volume":"315","author":"BJ Frey","year":"2007","unstructured":"Frey BJ, Dueck D (2007) Clustering by passing messages between data points. Science 315(5814):972\u2013976","journal-title":"Science"},{"key":"5243_CR3","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/j.ins.2022.03.091","volume":"600","author":"Z Long","year":"2022","unstructured":"Long Z, Gao Y, Meng H et al (2022) Clustering based on local density peaks and graph cut. Inf Sci 600:263\u2013286","journal-title":"Inf Sci"},{"issue":"2","key":"5243_CR4","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1109\/TKDE.2019.2930056","volume":"33","author":"D Cheng","year":"2019","unstructured":"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\u2013387","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"5243_CR5","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1016\/j.neucom.2021.05.071","volume":"455","author":"J Guan","year":"2021","unstructured":"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\u2013418","journal-title":"Neurocomputing"},{"issue":"2","key":"5243_CR6","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1109\/18.910572","volume":"47","author":"FR Kschischang","year":"2001","unstructured":"Kschischang FR, Frey BJ, Loeliger HA (2001) Factor graphs and the sum-product algorithm. IEEE Trans Inf Theory 47(2):498\u2013519","journal-title":"IEEE Trans Inf Theory"},{"issue":"9","key":"5243_CR7","doi-asserted-by":"publisher","first-page":"2223","DOI":"10.1109\/TPAMI.2013.28","volume":"35","author":"CD Wang","year":"2013","unstructured":"Wang CD, Lai JH, Suen CY et al (2013) Multi-exemplar affinity propagation. IEEE Trans Pattern Anal Mach Intell 35(9):2223\u20132237","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"3","key":"5243_CR8","doi-asserted-by":"publisher","first-page":"3221","DOI":"10.1007\/s10489-022-03705-y","volume":"53","author":"B Liang","year":"2023","unstructured":"Liang B, Cai JH, Yang HF (2023) Grid-DPC: improved density peaks clustering based on spatial grid walk. Appl Intell 53(3):3221\u20133239","journal-title":"Appl Intell"},{"issue":"12","key":"5243_CR9","doi-asserted-by":"publisher","first-page":"14478","DOI":"10.1007\/s10489-022-03360-3","volume":"52","author":"C Li","year":"2022","unstructured":"Li C, Ding S, Xu X et al (2022) Fast density peaks clustering algorithm in polar coordinate system. Appl Intell 52(12):14478\u201314490","journal-title":"Appl Intell"},{"key":"5243_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2020.107449","volume":"107","author":"A Lotfi","year":"2020","unstructured":"Lotfi A, Moradi P, Beigy H (2020) Density peaks clustering based on density backbone and fuzzy neighborhood. Pattern Recogn 107:107449","journal-title":"Pattern Recogn"},{"key":"5243_CR11","doi-asserted-by":"publisher","first-page":"13465","DOI":"10.1007\/s00521-020-04754-5","volume":"32","author":"Y Wang","year":"2020","unstructured":"Wang Y, Wang D, Zhang X et al (2020) McDPC: multi-center density peak clustering. Neural Comput Appl 32:13465\u201313478","journal-title":"Neural Comput Appl"},{"key":"5243_CR12","doi-asserted-by":"crossref","unstructured":"Wang P, Wu T, Yao Y (2023) A three-way adaptive density peak clustering (3W-ADPC) method. Appl Intell:1\u201317","DOI":"10.1007\/s10489-023-04827-7"},{"key":"5243_CR13","doi-asserted-by":"crossref","unstructured":"Niu X, Zheng Y, Fournier-Viger P et al (2021) Parallel grid-based density peak clustering of big trajectory data. Appl Intell:1\u201316","DOI":"10.1007\/s10489-021-02757-w"},{"issue":"5","key":"5243_CR14","first-page":"6307","volume":"45","author":"J Guan","year":"2022","unstructured":"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\u20136319","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"5243_CR15","doi-asserted-by":"crossref","unstructured":"Zhang X, Wang W, N\u00f8rv\u00e5g K et al (2010) K-AP: generating specified K clusters by efficient affinity propagation. 2010 IEEE International Conference on Data Mining. IEEE, pp 1187\u20131192","DOI":"10.1109\/ICDM.2010.107"},{"issue":"12","key":"5243_CR16","doi-asserted-by":"publisher","first-page":"2670","DOI":"10.1109\/TNNLS.2015.2495268","volume":"27","author":"Y Wang","year":"2015","unstructured":"Wang Y, Chen L (2015) K-MEAP: multiple exemplars affinity propagation with specified K clusters. IEEE Trans Neural Netw Learn Syst 27(12):2670\u20132682","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"5243_CR17","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.patrec.2016.11.017","volume":"85","author":"P Li","year":"2017","unstructured":"Li P, Ji H, Wang B et al (2017) Adjustable preference affinity propagation clustering. Pattern Recogn Lett 85:72\u201378","journal-title":"Pattern Recogn Lett"},{"key":"5243_CR18","doi-asserted-by":"publisher","first-page":"138884","DOI":"10.1109\/ACCESS.2020.3012740","volume":"8","author":"Y Li","year":"2020","unstructured":"Li Y, Guo C, Sun L (2020) Fast clustering by affinity propagation based on density peaks. IEEE Access 8:138884\u2013138897","journal-title":"IEEE Access"},{"key":"5243_CR19","unstructured":"Givoni I, Frey B (2009) Semi-supervised affinity propagation with instance-level constraints. Artificial intelligence and statistics. PMLR, pp 161\u2013168"},{"key":"5243_CR20","doi-asserted-by":"publisher","first-page":"4695","DOI":"10.1007\/s00521-020-05431-3","volume":"33","author":"R Zhou","year":"2021","unstructured":"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\u20134712","journal-title":"Neural Comput Appl"},{"key":"5243_CR21","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1016\/j.ins.2022.12.057","volume":"623","author":"Y Duan","year":"2023","unstructured":"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\u2013454","journal-title":"Inf Sci"},{"issue":"2","key":"5243_CR22","doi-asserted-by":"publisher","first-page":"736","DOI":"10.1109\/18.910585","volume":"47","author":"Y Weiss","year":"2001","unstructured":"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\u2013744","journal-title":"IEEE Trans Inf Theory"},{"key":"5243_CR23","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.patrec.2016.05.007","volume":"80","author":"Q Zhu","year":"2016","unstructured":"Zhu Q, Feng J, Huang J (2016) Natural neighbor: a self-adaptive neighborhood method without parameter K. Pattern Recogn Lett 80:30\u201336","journal-title":"Pattern Recogn Lett"},{"key":"5243_CR24","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1016\/j.knosys.2017.02.027","volume":"123","author":"D Cheng","year":"2017","unstructured":"Cheng D, Zhu Q, Huang J et al (2017) Natural neighbor-based clustering algorithm with local representatives. Knowl-Based Syst 123:238\u2013253","journal-title":"Knowl-Based Syst"},{"key":"5243_CR25","volume-title":"Affinity propagation: clustering data by passing messages","author":"D Dueck","year":"2009","unstructured":"Dueck D (2009) Affinity propagation: clustering data by passing messages. University of Toronto, Toronto"},{"key":"5243_CR26","doi-asserted-by":"crossref","unstructured":"Gionis A, Mannila H, Tsaparas P (2007) Clustering aggregation. Acm transactions on knowledge discovery from data (tkdd) 1(1): 4-es.","DOI":"10.1145\/1217299.1217303"},{"issue":"9","key":"5243_CR27","doi-asserted-by":"publisher","first-page":"1273","DOI":"10.1109\/TPAMI.2002.1033218","volume":"24","author":"CJ Veenman","year":"2002","unstructured":"Veenman CJ, Reinders MJT, Backer E (2002) A maximum variance cluster algorithm. IEEE Trans Pattern Anal Mach Intell 24(9):1273\u20131280","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"5","key":"5243_CR28","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1016\/j.patcog.2005.09.012","volume":"39","author":"P Fr\u00e4nti","year":"2006","unstructured":"Fr\u00e4nti P, Virmajoki O (2006) Iterative shrinking method for clustering problems. Pattern Recogn 39(5):761\u2013775","journal-title":"Pattern Recogn"},{"key":"5243_CR29","unstructured":"Kelly M, Longjohn R, Nottingham K (2023) The UCI machine learning repository. https:\/\/archive.ics.uci.edu"},{"issue":"7","key":"5243_CR30","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1109\/34.598228","volume":"19","author":"PN Belhumeur","year":"1997","unstructured":"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\u2013720","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"5243_CR31","unstructured":"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\u2013531"},{"key":"5243_CR32","unstructured":"LeCun Y, Cortes C, Burges C (2010) MNIST handwritten digit database. http:\/\/yann.lecun.com\/exdb\/mnist\/"},{"key":"5243_CR33","unstructured":"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\u2013297"},{"issue":"8","key":"5243_CR34","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"J Shi","year":"2000","unstructured":"Shi J, Malik J (2000) Normalized cuts and image segmentation. IEEE Trans Pattern Anal Mach Intell 22(8):888\u2013905","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"34","key":"5243_CR35","first-page":"226","volume":"96","author":"M Ester","year":"1996","unstructured":"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\u2013231","journal-title":"Kdd"},{"issue":"10","key":"5243_CR36","doi-asserted-by":"publisher","first-page":"2761","DOI":"10.1109\/TIP.2010.2049235","volume":"19","author":"Y Yang","year":"2010","unstructured":"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\u20132773","journal-title":"IEEE Trans Image Process"},{"issue":"1\u20132","key":"5243_CR37","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn HW (1955) The Hungarian method for the assignment problem. Nav Res Logist Q 2(1\u20132):83\u201397","journal-title":"Nav Res Logist Q"},{"key":"5243_CR38","doi-asserted-by":"crossref","unstructured":"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\u2013273","DOI":"10.1145\/860435.860485"},{"key":"5243_CR39","doi-asserted-by":"crossref","unstructured":"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\u20131080","DOI":"10.1145\/1553374.1553511"},{"key":"5243_CR40","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1023\/B:VISI.0000029664.99615.94","volume":"60","author":"DG Lowe","year":"2004","unstructured":"Lowe DG (2004) Distinctive image features from scale-invariant keypoints. Int J Comput Vision 60:91\u2013110","journal-title":"Int J Comput Vision"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-023-05243-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-023-05243-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-023-05243-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,16]],"date-time":"2024-03-16T17:08:06Z","timestamp":1710608886000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-023-05243-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2]]},"references-count":40,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,2]]}},"alternative-id":["5243"],"URL":"https:\/\/doi.org\/10.1007\/s10489-023-05243-7","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,2]]},"assertion":[{"value":"15 December 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 February 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"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.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interest"}}]}}