{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T17:14:20Z","timestamp":1778692460949,"version":"3.51.4"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T00:00:00Z","timestamp":1772841600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T00:00:00Z","timestamp":1772841600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"National Key Research and Development Program of China","award":["No.2021YFF0704101"],"award-info":[{"award-number":["No.2021YFF0704101"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["No.62276038"],"award-info":[{"award-number":["No.62276038"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Joint Fund of Chongqing Natural Science Foundation for Innovation and Development Project","award":["No.CSTB2023NSCQ-LZX0164"],"award-info":[{"award-number":["No.CSTB2023NSCQ-LZX0164"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Mach. Learn. &amp; Cyber."],"published-print":{"date-parts":[[2026,4]]},"DOI":"10.1007\/s13042-025-02825-4","type":"journal-article","created":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T06:04:31Z","timestamp":1772863471000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An improved density peaks clustering based on neighborhood relationship and micro-cluster merging"],"prefix":"10.1007","volume":"17","author":[{"given":"Siyang","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qinghua","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinran","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cai","family":"Deng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yunlong","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,3,7]]},"reference":[{"key":"2825_CR1","doi-asserted-by":"publisher","first-page":"2263","DOI":"10.1007\/s13042-023-02027-w","volume":"15","author":"DO Owuor","year":"2024","unstructured":"Owuor DO, Runkler T, Laurent A et al (2024) Clustering-based gradual pattern mining. Int J Mach Learn Cybern. 15:2263\u20132281. https:\/\/doi.org\/10.1007\/s13042-023-02027-w","journal-title":"Int J Mach Learn Cybern."},{"key":"2825_CR2","doi-asserted-by":"publisher","first-page":"35001","DOI":"10.1007\/s11042-021-10594-9","volume":"81","author":"H Mittal","year":"2022","unstructured":"Mittal H, Pandey AC, Saraswat M et al (2022) A comprehensive survey of image segmentation: clustering methods, performance parameters, and benchmark datasets. Multimedia Tools Appl 81:35001\u201335026. https:\/\/doi.org\/10.1007\/s11042-021-10594-9","journal-title":"Multimedia Tools Appl"},{"key":"2825_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.122270","volume":"241","author":"H Yu","year":"2024","unstructured":"Yu H, Jiang L, Fan J et al (2024) A feature-weighted suppressed possibilistic fuzzy c-means clustering algorithm and its application on color image segmentation. Expert Syst Appl 241:122270. https:\/\/doi.org\/10.1016\/j.eswa.2023.122270","journal-title":"Expert Syst Appl"},{"key":"2825_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.compbiolchem.2023.107924","volume":"106","author":"L Wang","year":"2023","unstructured":"Wang L, Li W, Xie W et al (2023) Dual-gcn-based deep clustering with triplet contrast for scrna-seq data analysis. Comput Biol Chem 106:107924. https:\/\/doi.org\/10.1016\/j.compbiolchem.2023.107924","journal-title":"Comput Biol Chem"},{"key":"2825_CR5","doi-asserted-by":"publisher","first-page":"6439","DOI":"10.1007\/s10462-022-10325-y","volume":"56","author":"GJ Oyewole","year":"2023","unstructured":"Oyewole GJ, Thopil GA (2023) Data clustering: application and trends. Artif Intell Rev 56:6439\u20136475. https:\/\/doi.org\/10.1007\/s10462-022-10325-y","journal-title":"Artif Intell Rev"},{"key":"2825_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2022.104743","volume":"110","author":"AE Ezugwu","year":"2022","unstructured":"Ezugwu AE, Ikotun AM, Oyelade OO et al (2022) A comprehensive survey of clustering algorithms: State-of-the-art machine learning applications, taxonomy, challenges, and future research prospects. Eng Appl Artif Intell 110:104743. https:\/\/doi.org\/10.1016\/j.engappai.2022.104743","journal-title":"Eng Appl Artif Intell"},{"key":"2825_CR7","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1016\/j.ins.2022.11.170","volume":"623","author":"Y Qi","year":"2023","unstructured":"Qi Y, Shao Y, Li C et al (2023) Locally finite distance clustering with discriminative information. Inf Sci 623:607\u2013632. https:\/\/doi.org\/10.1016\/j.ins.2022.11.170","journal-title":"Inf Sci"},{"key":"2825_CR8","doi-asserted-by":"publisher","first-page":"3828","DOI":"10.1016\/j.jksuci.2022.04.010","volume":"34","author":"L Teng","year":"2022","unstructured":"Teng L, Amin R, ElSayed MT (2022) An ensemble agglomerative hierarchical clustering algorithm based on clusters clustering technique and the novel similarity measurement. Journal of King Saud University - Computer and Information Sciences 34:3828\u20133842. https:\/\/doi.org\/10.1016\/j.jksuci.2022.04.010","journal-title":"Journal of King Saud University - Computer and Information Sciences"},{"key":"2825_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2024.120109","volume":"660","author":"F Ma","year":"2024","unstructured":"Ma F, Wang C, Huang J et al (2024) Key grids based batch-incremental clique clustering algorithm considering cluster structure changes. Inf Sci 660:120109. https:\/\/doi.org\/10.1016\/j.ins.2024.120109","journal-title":"Inf Sci"},{"key":"2825_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.117501","volume":"203","author":"N Hanafi","year":"2022","unstructured":"Hanafi N, Saadatfar H (2022) A fast dbscan algorithm for big data based on efficient density calculation. Expert Syst Appl 203:117501. https:\/\/doi.org\/10.1016\/j.eswa.2022.117501","journal-title":"Expert Syst Appl"},{"key":"2825_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2023.109658","volume":"142","author":"X Huang","year":"2023","unstructured":"Huang X, Ma T, Liu G et al (2023) Grit-dbscan: A spatial clustering algorithm for very large databases. Pattern Recogn 142:109658. https:\/\/doi.org\/10.1016\/j.patcog.2023.109658","journal-title":"Pattern Recogn"},{"key":"2825_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2024.112436","volume":"303","author":"J Kim","year":"2024","unstructured":"Kim J, Lee H, Ko YM (2024) Constrained density-based spatial clustering of applications with noise (dbscan) using hyperparameter optimization. Knowl-Based Syst 303:112436. https:\/\/doi.org\/10.1016\/j.knosys.2024.112436","journal-title":"Knowl-Based Syst"},{"key":"2825_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2024.127329","volume":"576","author":"J Qian","year":"2024","unstructured":"Qian J, Zhou Y, Han X et al (2024) Mdbscan: a multi-density dbscan based on relative density. Neurocomputing 576:127329. https:\/\/doi.org\/10.1016\/j.neucom.2024.127329","journal-title":"Neurocomputing"},{"key":"2825_CR14","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s11222-007-9033-z","volume":"17","author":"U Luxburg","year":"2007","unstructured":"Luxburg U (2007) A tutorial on spectral clustering. Stat Comput 17:395\u2013416. https:\/\/doi.org\/10.1007\/s11222-007-9033-z","journal-title":"Stat Comput"},{"key":"2825_CR15","unstructured":"Sun L, Huang Z, Peng H et al.: (2024) Lsenet: Lorentz structural entropy neural network for deep graph clustering. In: Proceedings of the 41st International Conference on Machine Learning (ICML 2024), pp. 47078\u201347104 Paper presented at the 2024 International Conference on Machine Learning(ICML), Vienna, Austria, 21-27 July 2024"},{"key":"2825_CR16","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1109\/TKDE.2024.3486530","volume":"37","author":"G Zeng","year":"2025","unstructured":"Zeng G, Peng H, Li A et al (2025) Scalable semi-supervised clustering via structural entropy with different constraints. IEEE Trans Knowl Data Eng 37:478\u2013492. https:\/\/doi.org\/10.1109\/TKDE.2024.3486530","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2825_CR17","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:1492\u20131496. https:\/\/doi.org\/10.1126\/science.1242072","journal-title":"Science"},{"key":"2825_CR18","doi-asserted-by":"publisher","first-page":"1913","DOI":"10.1007\/s13042-021-01284-x","volume":"12","author":"L Sun","year":"2021","unstructured":"Sun L, Qin X, Ding W et al (2021) Density peaks clustering based on k-nearest neighbors and self-recommendation. Int J Mach Learn Cybern 12:1913\u20131938. https:\/\/doi.org\/10.1007\/s13042-021-01284-x","journal-title":"Int J Mach Learn Cybern"},{"key":"2825_CR19","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.knosys.2016.02.001","volume":"99","author":"M Du","year":"2016","unstructured":"Du M, Ding S, Jia H (2016) Study on density peaks clustering based on k-nearest neighbors and principal component analysis. Knowl-Based Syst 99:135\u2013145. https:\/\/doi.org\/10.1016\/j.knosys.2016.02.001","journal-title":"Knowl-Based Syst"},{"key":"2825_CR20","doi-asserted-by":"publisher","first-page":"34301","DOI":"10.1109\/ACCESS.2019.2904254","volume":"7","author":"D Yu","year":"2019","unstructured":"Yu D, Liu G, Guo M et al (2019) Density peaks clustering based on weighted local density sequence and nearest neighbor assignment. IEEE Access 7:34301\u201334317. https:\/\/doi.org\/10.1109\/ACCESS.2019.2904254","journal-title":"IEEE Access"},{"key":"2825_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2023.119788","volume":"653","author":"J Xie","year":"2024","unstructured":"Xie J, Liu X, Wang M (2024) Sfknn-dpc: Standard deviation weighted distance based density peak clustering algorithm. Inf Sci 653:119788. https:\/\/doi.org\/10.1016\/j.ins.2023.119788","journal-title":"Inf Sci"},{"key":"2825_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2024.108883","volume":"136","author":"X Yang","year":"2024","unstructured":"Yang X, Xiao F (2024) An improved density peaks clustering algorithm based on the generalized neighbors similarity. Eng Appl Artif Intell 136:108883. https:\/\/doi.org\/10.1016\/j.engappai.2024.108883","journal-title":"Eng Appl Artif Intell"},{"key":"2825_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2024.125934","volume":"265","author":"X Li","year":"2025","unstructured":"Li X, Zhuang Q (2025) A density clustering algorithm based on fermat neighbor points and partition allocation strategy. Eng Appl Artif Intell 265:125934. https:\/\/doi.org\/10.1016\/j.eswa.2024.125934","journal-title":"Eng Appl Artif Intell"},{"key":"2825_CR24","doi-asserted-by":"publisher","first-page":"1609","DOI":"10.1007\/s12559-021-09906-w","volume":"13","author":"X Qin","year":"2021","unstructured":"Qin X, Han X, Chu J et al (2021) Density peaks clustering based on jaccard similarity and label propagation. Cogn Comput 13:1609\u20131626. https:\/\/doi.org\/10.1007\/s12559-021-09906-w","journal-title":"Cogn Comput"},{"key":"2825_CR25","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.116573","volume":"195","author":"Z Zhou","year":"2022","unstructured":"Zhou Z, Si G, Sun H et al (2022) A robust clustering algorithm based on the identification of core points and knn kernel density estimation. Expert Syst Appl 195:116573. https:\/\/doi.org\/10.1016\/j.eswa.2022.116573","journal-title":"Expert Syst Appl"},{"key":"2825_CR26","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2024.111773","volume":"161","author":"Y Li","year":"2024","unstructured":"Li Y, Sun L, Tang Y et al (2024) Dpc-dng: Graph-based label propagation of k-nearest higher-density neighbors for density peaks clustering. Appl Soft Comput 161:111773. https:\/\/doi.org\/10.1016\/j.asoc.2024.111773","journal-title":"Appl Soft Comput"},{"key":"2825_CR27","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2023.111217","volume":"152","author":"H Ju","year":"2024","unstructured":"Ju H, Lu Y, Ding W et al (2024) Three-way evidence theory-based density peak clustering with the principle of justifiable granularity. Appl Soft Comput 152:111217. https:\/\/doi.org\/10.1016\/j.asoc.2023.111217","journal-title":"Appl Soft Comput"},{"key":"2825_CR28","doi-asserted-by":"publisher","first-page":"1830","DOI":"10.1109\/TETCI.2024.3452687","volume":"9","author":"L Sun","year":"2025","unstructured":"Sun L, Huang F, Zheng X et al (2025) Density peaks clustering based on label propagation and k-mutual-nearest neighbors. IEEE Trans Emerg Topics Comput Intel 9:1830\u20131842. https:\/\/doi.org\/10.1109\/TETCI.2024.3452687","journal-title":"IEEE Trans Emerg Topics Comput Intel"},{"key":"2825_CR29","doi-asserted-by":"publisher","first-page":"12689","DOI":"10.1007\/s10586-024-04592-3","volume":"27","author":"W Hu","year":"2024","unstructured":"Hu W, Feng J, Yang D (2024) An improved density peaks clustering algorithm using similarity assignment strategy with k-nearest neighbors. Clust Comput 27:12689\u201312706. https:\/\/doi.org\/10.1007\/s10586-024-04592-3","journal-title":"Clust Comput"},{"key":"2825_CR30","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.108501","volume":"243","author":"W Guo","year":"2022","unstructured":"Guo W, Wang W, Zhao S et al (2022) Density peak clustering with connectivity estimation. Knowl-Based Syst 243:108501. https:\/\/doi.org\/10.1016\/j.knosys.2022.108501","journal-title":"Knowl-Based Syst"},{"key":"2825_CR31","doi-asserted-by":"publisher","first-page":"74612","DOI":"10.1109\/ACCESS.2019.2918772","volume":"7","author":"L Zhuo","year":"2019","unstructured":"Zhuo L, Li K, Liao B et al (2019) Hcfs: a density peak based clustering algorithm employing a hierarchical strategy. IEEE Access 7:74612\u201374624. https:\/\/doi.org\/10.1109\/ACCESS.2019.2918772","journal-title":"IEEE Access"},{"key":"2825_CR32","doi-asserted-by":"publisher","first-page":"5629","DOI":"10.13328\/j.cnki.jos.006756","volume":"34","author":"Q Zhang","year":"2023","unstructured":"Zhang Q, Zhou J, Dai Y et al (2023) Density peaks clustering algorithm based on representative points and k-nearest neighbors. J Softw 34:5629\u20135648. https:\/\/doi.org\/10.13328\/j.cnki.jos.006756","journal-title":"J Softw"},{"key":"2825_CR33","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2024.121209","volume":"681","author":"W Zang","year":"2024","unstructured":"Zang W, Che J, Ma L et al (2024) Density peaks clustering based on density voting and neighborhood diffusion. Inf Sci 681:121209. https:\/\/doi.org\/10.1016\/j.ins.2024.121209","journal-title":"Inf Sci"},{"key":"2825_CR34","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2024.111748","volume":"294","author":"H Yan","year":"2024","unstructured":"Yan H, Wang M, Xie J (2024) Ann-dpc: Density peak clustering by finding the adaptive nearest neighbors. Knowl-Based Syst 294:111748. https:\/\/doi.org\/10.1016\/j.knosys.2024.111748","journal-title":"Knowl-Based Syst"},{"key":"2825_CR35","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. https:\/\/doi.org\/10.1016\/j.patrec.2016.05.007","journal-title":"Pattern Recogn Lett"},{"key":"2825_CR36","doi-asserted-by":"publisher","first-page":"151339","DOI":"10.1109\/ACCESS.2019.2948422","volume":"7","author":"D Cheng","year":"2019","unstructured":"Cheng D, Huang J, Zhang S et al (2019) Improved density peaks clustering based on shared-neighbors of local cores for manifold data sets. IEEE Access 7:151339\u2013151349. https:\/\/doi.org\/10.1109\/ACCESS.2019.2948422","journal-title":"IEEE Access"},{"key":"2825_CR37","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"JL Bentley","year":"1975","unstructured":"Bentley JL (1975) Multidimensional binary search trees used for associative searching. Assoc Comput Machine 18:509\u2013517. https:\/\/doi.org\/10.1145\/361002.361007","journal-title":"Assoc Comput Machine"},{"key":"2825_CR38","doi-asserted-by":"publisher","unstructured":"Tang G, Jia S, Li J (2015) An enhanced density peak-based clustering approach for hyperspectral band selection. In: 2015 IEEE International Geoscience and Remote Sensing Symposium (IGARSS), pp. 1116\u20131119 . Paper presented at 2015 IEEE International Geoscience and Remote Sensing Symposium (IGARSS), Milan, Italy, 26-31 July 2015 https:\/\/doi.org\/10.1109\/IGARSS.2015.7325966","DOI":"10.1109\/IGARSS.2015.7325966"},{"key":"2825_CR39","doi-asserted-by":"publisher","first-page":"17202","DOI":"10.1109\/TNNLS.2023.3300916","volume":"35","author":"D Cheng","year":"2024","unstructured":"Cheng D, Li Y, Xia S et al (2024) A fast granular-ball-based density peaks clustering algorithm for large-scale data. IEEE Trans Neural Netw Learn Syst 35:17202\u201317215. https:\/\/doi.org\/10.1109\/TNNLS.2023.3300916","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"2825_CR40","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1145\/304181.304187","volume":"28","author":"M Ankerst","year":"1999","unstructured":"Ankerst M, Breunig MM, Kriegel H-P et al (1999) Optics: ordering points to identify the clustering structure. Assoc Comput Machine 28:49\u201360. https:\/\/doi.org\/10.1145\/304181.304187","journal-title":"Assoc Comput Machine"},{"key":"2825_CR41","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3068335","volume":"42","author":"E Schubert","year":"2017","unstructured":"Schubert E, Sander J, Ester M et al (2017) Dbscan revisited, revisited: why and how you should (still) use dbscan. Assoc Comput Machine 42:1\u201321. https:\/\/doi.org\/10.1145\/3068335","journal-title":"Assoc Comput Machine"},{"key":"2825_CR42","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/j.ins.2022.11.139","volume":"622","author":"AM Ikotun","year":"2023","unstructured":"Ikotun AM, Ezugwu AE, Abualigah L et al (2023) K-means clustering algorithms: a comprehensive review, variants analysis, and advances in the era of big data. Inf Sci 622:178\u2013210. https:\/\/doi.org\/10.1016\/j.ins.2022.11.139","journal-title":"Inf Sci"},{"key":"2825_CR43","doi-asserted-by":"publisher","first-page":"2837","DOI":"10.5555\/1756006.1953024","volume":"11","author":"NX Vinh","year":"2010","unstructured":"Vinh NX, Epps J, Bailey J (2010) Information theoretic measures for clusterings comparison: Variants, properties, normalization and correction for chance. J Machine Learn Res 11:2837\u20132854. https:\/\/doi.org\/10.5555\/1756006.1953024","journal-title":"J Machine Learn Res"},{"key":"2825_CR44","doi-asserted-by":"publisher","unstructured":"Wang Y, Hu B (2009) Derivations of normalized mutual information in binary classifications. In: 2009 Sixth International Conference on Fuzzy Systems and Knowledge Discovery, pp. 155\u2013163 . Paper presented at 2009 Sixth International Conference on Fuzzy Systems and Knowledge Discovery (FSKD), Tianjin, China, 14-16 August 2009 https:\/\/doi.org\/10.1109\/FSKD.2009.342","DOI":"10.1109\/FSKD.2009.342"},{"key":"2825_CR45","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1080\/01621459.1983.10478008","volume":"78","author":"EB Fowlkes","year":"1983","unstructured":"Fowlkes EB, Mallows CL (1983) A method for comparing two hierarchical clusterings. J Am Stat Assoc 78:553\u2013569. https:\/\/doi.org\/10.1080\/01621459.1983.10478008","journal-title":"J Am Stat Assoc"},{"key":"2825_CR46","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.121860","volume":"238","author":"Y Wang","year":"2024","unstructured":"Wang Y, Qian J, Hassan M et al (2024) Density peak clustering algorithms: A review on the decade 2014\u20132023. Expert Syst Appl 238:121860. https:\/\/doi.org\/10.1016\/j.eswa.2023.121860","journal-title":"Expert Syst Appl"},{"key":"2825_CR47","unstructured":"Dua D, Graff C (2019) UCI Machine Learning Repository. figsharehttp:\/\/archive.ics.uci.edu\/ml"},{"key":"2825_CR48","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1016\/j.eswa.2018.07.075","volume":"115","author":"SA Seyedi","year":"2019","unstructured":"Seyedi SA, Lotfi A, Moradi P et al (2019) Dynamic graph-based label propagation for density peaks clustering. Expert Syst Appl 115:314\u2013328. https:\/\/doi.org\/10.1016\/j.eswa.2018.07.075","journal-title":"Expert Syst Appl"},{"key":"2825_CR49","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/j.ins.2022.09.006","volume":"613","author":"H Ju","year":"2022","unstructured":"Ju H, Ding W, Shi Z et al (2022) Attribute reduction with personalized information granularity of nearest mutual neighbors. Inf Sci 613:114\u2013138. https:\/\/doi.org\/10.1016\/j.ins.2022.09.006","journal-title":"Inf Sci"},{"key":"2825_CR50","doi-asserted-by":"publisher","first-page":"1","DOI":"10.5555\/1248547.1248548","volume":"7","author":"J Dem\u0161ar","year":"2006","unstructured":"Dem\u0161ar J (2006) Statistical comparisons of classifiers over multiple data sets. J Mach Learn Res 7:1\u201330. https:\/\/doi.org\/10.5555\/1248547.1248548","journal-title":"J Mach Learn Res"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-025-02825-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13042-025-02825-4","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-025-02825-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T16:29:28Z","timestamp":1778689768000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13042-025-02825-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,7]]},"references-count":50,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2026,4]]}},"alternative-id":["2825"],"URL":"https:\/\/doi.org\/10.1007\/s13042-025-02825-4","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"value":"1868-8071","type":"print"},{"value":"1868-808X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,7]]},"assertion":[{"value":"25 February 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 December 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 March 2026","order":3,"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 no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"177"}}