{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T21:58:58Z","timestamp":1776290338309,"version":"3.50.1"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T00:00:00Z","timestamp":1751932800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T00:00:00Z","timestamp":1751932800000},"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":["62306193"],"award-info":[{"award-number":["62306193"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62372085, 62376055, 62276053"],"award-info":[{"award-number":["62372085, 62376055, 62276053"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100012542","name":"Sichuan Provincial Science and Technology Support Program","doi-asserted-by":"publisher","award":["2024YFHZ0144"],"award-info":[{"award-number":["2024YFHZ0144"]}],"id":[{"id":"10.13039\/100012542","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Network and Data Security Key Laboratory of Sichuan Province","award":["NDS2024-2"],"award-info":[{"award-number":["NDS2024-2"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Mach. Learn. & Cyber."],"published-print":{"date-parts":[[2025,11]]},"DOI":"10.1007\/s13042-025-02705-x","type":"journal-article","created":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T05:40:14Z","timestamp":1751953214000},"page":"8731-8753","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Exploring the reliability of clustering models: a case study on interpretation and overlapping issues"],"prefix":"10.1007","volume":"16","author":[{"given":"Mustafa","family":"Kadhim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peilin","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guangxi","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianbo","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruyi","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Songlin","family":"Ye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,7,8]]},"reference":[{"key":"2705_CR1","doi-asserted-by":"publisher","DOI":"10.3390\/app13031903","author":"T Chen","year":"2023","unstructured":"Chen T, Sampath V, May MC, Shan S, Jorg OJ, Mart Aguilarn JJ et al (2023) Machine learning in manufacturing towards industry 4.0: from For now to four-know. Appl Sci. https:\/\/doi.org\/10.3390\/app13031903","journal-title":"Appl Sci"},{"key":"2705_CR2","doi-asserted-by":"crossref","unstructured":"Sarker I. Machine learning: algorithms, real-world applications and research directions. SN Comput Sci 2: 160","DOI":"10.1007\/s42979-021-00592-x"},{"issue":"8","key":"2705_CR3","doi-asserted-by":"publisher","first-page":"8219","DOI":"10.1007\/s10462-022-10366-3","volume":"56","author":"X Ran","year":"2023","unstructured":"Ran X, Xi Y, Lu Y, Wang X, Lu Z (2023) Comprehensive survey on hierarchical clustering algorithms and the recent developments. Artif Intell Rev 56(8):8219\u20138264. https:\/\/doi.org\/10.1007\/s10462-022-10366-3","journal-title":"Artif Intell Rev"},{"key":"2705_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2023.102178","volume":"114","author":"K Taha","year":"2023","unstructured":"Taha K (2023) Semi-supervised and un-supervised clustering: a review and experimental evaluation. Inform Syst 114:102178","journal-title":"Inform Syst"},{"key":"2705_CR5","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, Abuhaija B, Heming J (2023) K-means clustering algorithms: a comprehensive review, variants analysis, and advances in the era of big data. Inform Sci 622:178\u2013210. https:\/\/doi.org\/10.1016\/j.ins.2022.11.139","journal-title":"Inform Sci"},{"key":"2705_CR6","doi-asserted-by":"publisher","DOI":"10.1145\/3533381","author":"D Adhikari","year":"2022","unstructured":"Adhikari D, Jiang W, Zhan J, He Z, Rawat DB, Aickelin U et al (2022) A comprehensive survey on imputation of missing data in internet of things. ACM Comput Surv. https:\/\/doi.org\/10.1145\/3533381","journal-title":"ACM Comput Surv"},{"issue":"7","key":"2705_CR7","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(7):6439\u20136475. https:\/\/doi.org\/10.1007\/s10462-022-10325-y. (NOTE: ID is not typically a field used in BibTeX and has been omitted.)","journal-title":"Artif Intell Rev"},{"key":"2705_CR8","doi-asserted-by":"crossref","unstructured":"Cao N, Cohen-Addad V, Lee E, Li S, Newman A, Vogl L (2024) Understanding the cluster linear program for correlation clustering. In: Proceedings of the 56th annual ACM symposium on theory of computing, pp 1605\u20131616","DOI":"10.1145\/3618260.3649749"},{"key":"2705_CR9","doi-asserted-by":"crossref","unstructured":"Kadhim MR, Lu G (2025) Lightweight on-edge clustering for wireless AI-driven applications. IET Communications","DOI":"10.1049\/cmu2.12874"},{"key":"2705_CR10","unstructured":"Pedregosa F, Varoquaux G, Gramfort A, Michel V, Thirion B, Grisel O, et\u00a0al Scikit-learn: machine learning in python. http:\/\/jmlr.org\/papers\/v12\/pedregosa11a.html"},{"key":"2705_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2021.104388","volume":"104","author":"K Golalipour","year":"2021","unstructured":"Golalipour K, Akbari E, Hamidi SS, Lee M, Enayatifar R (2021) From clustering to clustering ensemble selection: a review. Eng Appl Artif Intell 104:104388","journal-title":"Eng Appl Artif Intell"},{"issue":"9","key":"2705_CR12","first-page":"3247","volume":"43","author":"B Liang","year":"2020","unstructured":"Liang B, JiYe L, Fuyuan C (2020) Semi-supervised clustering with constraints of different types from multiple information sources. IEEE Trans Patt Anal Mach Intell 43(9):3247\u20133258","journal-title":"IEEE Trans Patt Anal Mach Intell"},{"key":"2705_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2024.120685","volume":"672","author":"W Zang","year":"2024","unstructured":"Zang W, Liu X, Ma L, Che J, Sun M, Zhao Y et al (2024) Density peaks clustering based on superior nodes and fuzzy correlation. Inform Sci 672:120685. https:\/\/doi.org\/10.1016\/j.ins.2024.120685","journal-title":"Inform Sci"},{"issue":"7841","key":"2705_CR14","first-page":"7855","volume":"34","author":"K Mustafa","year":"2022","unstructured":"Mustafa K, Guangyao Z, Wenhong T (2022) A novel self-directed learning framework for cluster ensemble. J King Saud Univ Comput Inform Sci 34(7841):7855","journal-title":"J King Saud Univ Comput Inform Sci"},{"key":"2705_CR15","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1007\/978-3-030-16657-1_49","volume-title":"Intelligent systems design and applications","author":"Q He","year":"2020","unstructured":"He Q, Chen Z, Ji K, Wang L, Ma K, Zhao C et al (2020) Cluster center initialization and outlier detection based on distance and density for the K-means algorithm. In: Abraham A, Cherukuri AK, Melin P, Gandhi N (eds) Intelligent systems design and applications. Springer International Publishing, Cham, pp 530\u2013539"},{"issue":"3","key":"2705_CR16","doi-asserted-by":"publisher","first-page":"04023019","DOI":"10.1061\/AJRUA6.RUENG-1015","volume":"9","author":"M Rashki","year":"2023","unstructured":"Rashki M, Faes MGR (2023) No-free-lunch theorems for reliability analysis. ASCE-ASME J Risk Uncert Eng Syst Part A Civil Eng 9(3):04023019. https:\/\/doi.org\/10.1061\/AJRUA6.RUENG-1015","journal-title":"ASCE-ASME J Risk Uncert Eng Syst Part A Civil Eng"},{"issue":"1","key":"2705_CR17","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1080\/0952813X.2022.2080278","volume":"36","author":"G Schurz","year":"2024","unstructured":"Schurz G, Thorn P (2024) Escaping the no free lunch theorem: a priori advantages of regret-based meta-induction. J Exp Theor Artif Intell 36(1):87\u2013119. https:\/\/doi.org\/10.1080\/0952813X.2022.2080278","journal-title":"J Exp Theor Artif Intell"},{"key":"2705_CR18","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-023-49947-9","author":"Y Shan","year":"2023","unstructured":"Shan Y, Li S, Li F, Cui Y, Chen M (2023) Dual-level clustering ensemble algorithm with three consensus strategies. Sci Rep. https:\/\/doi.org\/10.1038\/s41598-023-49947-9","journal-title":"Sci Rep"},{"issue":"2","key":"2705_CR19","doi-asserted-by":"publisher","DOI":"10.1016\/j.joi.2024.101507","volume":"18","author":"J Chakraborty","year":"2024","unstructured":"Chakraborty J, Pradhan DK, Nandi S (2024) A multiple k-means cluster ensemble framework for clustering citation trajectories. J Inform 18(2):101507. https:\/\/doi.org\/10.1016\/j.joi.2024.101507","journal-title":"J Inform"},{"key":"2705_CR20","doi-asserted-by":"publisher","unstructured":"An overview on density peaks clustering. Neurocomputing. 554:12663 (2023) https:\/\/doi.org\/10.1016\/j.neucom.2023.126633","DOI":"10.1016\/j.neucom.2023.126633"},{"key":"2705_CR21","doi-asserted-by":"publisher","first-page":"78703","DOI":"10.1109\/ACCESS.2020.2990651","volume":"8","author":"H Xu","year":"2020","unstructured":"Xu H, Wang D, Yang Y (2020) A survey of density peaks clustering algorithms. IEEE Access 8:78703\u201378728. https:\/\/doi.org\/10.1109\/ACCESS.2020.2990651","journal-title":"IEEE Access"},{"issue":"5814","key":"2705_CR22","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. https:\/\/doi.org\/10.1126\/science.1136800","journal-title":"Science"},{"key":"2705_CR23","doi-asserted-by":"crossref","unstructured":"Tran V, Kammermann M, Baumann P (2023) The MPFCC algorithm: a model-based approach for fair-capacitated clustering. In: 2023 IEEE international conference on industrial engineering and engineering management (IEEM). IEEE, pp 0677\u20130681","DOI":"10.1109\/IEEM58616.2023.10406388"},{"issue":"1","key":"2705_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3597428","volume":"56","author":"J Vatter","year":"2023","unstructured":"Vatter J, Mayer R, Jacobsen HA (2023) The evolution of distributed systems for graph neural networks and their origin in graph processing and deep learning: A survey. ACM Comput Surv 56(1):1\u201337","journal-title":"ACM Comput Surv"},{"key":"2705_CR25","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2021.101804","volume":"101","author":"E Schubert","year":"2021","unstructured":"Schubert E, Rousseeuw PJ (2021) Fast and eager k-medoids clustering: O(k) runtime improvement of the PAM, CLARA, and CLARANS algorithms. Inform Syst 101:101804. https:\/\/doi.org\/10.1016\/j.is.2021.101804","journal-title":"Inform Syst"},{"key":"2705_CR26","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-030-32047-8_16","volume-title":"Similarity search and applications","author":"E Schubert","year":"2019","unstructured":"Schubert E, Rousseeuw PJ (2019) Faster k-medoids clustering: improving the PAM, CLARA, and CLARANS algorithms. In: Amato G, Gennaro C, Oria V, Radovanovi\u0107 M (eds) Similarity search and applications. Springer International Publishing, Cham, pp 171\u2013187"},{"key":"2705_CR27","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/978-3-031-17849-8_15","volume-title":"Similarity search and applications","author":"L Lenssen","year":"2022","unstructured":"Lenssen L, Schubert E (2022) Clustering by direct optimization of the Medoid Silhouette. In: Skopal T, Falchi F, Loko\u010d J, Sapino ML, Bartolini I, Patella M (eds) Similarity search and applications. Springer International Publishing, Cham, pp 190\u2013204"},{"issue":"1","key":"2705_CR28","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1145\/3606274.3606278","volume":"25","author":"E Schubert","year":"2023","unstructured":"Schubert E (2023) Stop using the elbow criterion for k-means and how to choose the number of clusters instead. ACM SIGKDD Explor Newsl 25(1):36\u201342","journal-title":"ACM SIGKDD Explor Newsl"},{"key":"2705_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11704-019-9059-3","volume":"15","author":"P Bhattacharjee","year":"2021","unstructured":"Bhattacharjee P, Mitra P (2021) A survey of density based clustering algorithms. Front Comput Sci 15:1\u201327","journal-title":"Front Comput Sci"},{"key":"2705_CR30","doi-asserted-by":"crossref","unstructured":"Ren Y, Pu J, Yang Z, Xu J, Li G, Pu X, et\u00a0al (2024) Deep clustering: a comprehensive survey. IEEE Trans Neural Netw Learn Syst","DOI":"10.1109\/TNNLS.2024.3403155"},{"issue":"2","key":"2705_CR31","doi-asserted-by":"publisher","first-page":"907","DOI":"10.1007\/s10462-019-09682-y","volume":"53","author":"S Solorio-Fern\u00e1ndez","year":"2020","unstructured":"Solorio-Fern\u00e1ndez S, Carrasco-Ochoa JA, Mart\u00ednez-Trinidad JF (2020) A review of unsupervised feature selection methods. Artif Intell Rev 53(2):907\u2013948","journal-title":"Artif Intell Rev"},{"issue":"9","key":"2705_CR32","doi-asserted-by":"publisher","first-page":"3211","DOI":"10.3390\/app10093211","volume":"10","author":"H Jeon","year":"2020","unstructured":"Jeon H, Oh S (2020) Hybrid-recursive feature elimination for efficient feature selection. Appl Sci 10(9):3211","journal-title":"Appl Sci"},{"issue":"6","key":"2705_CR33","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/s42979-020-00370-1","volume":"1","author":"R Aggrawal","year":"2020","unstructured":"Aggrawal R, Pal S (2020) Sequential feature selection and machine learning algorithm-based patient s death events prediction and diagnosis in heart disease. SN Comput Sci 1(6):344","journal-title":"SN Comput Sci"},{"issue":"18","key":"2705_CR34","doi-asserted-by":"publisher","first-page":"13239","DOI":"10.1007\/s00521-023-08386-3","volume":"35","author":"A \u015eenol","year":"2023","unstructured":"\u015eenol A (2023) MCMSTClustering: defining non-spherical clusters by using minimum spanning tree over KD-tree-based micro-clusters. Neural Comput Appl 35(18):13239\u201313259","journal-title":"Neural Comput Appl"},{"key":"2705_CR35","doi-asserted-by":"publisher","DOI":"10.3390\/app14041649","author":"S Zhu","year":"2024","unstructured":"Zhu S, Zhao Y, Yue S (2024) Double-constraint fuzzy clustering algorithm. Appl Sci. https:\/\/doi.org\/10.3390\/app14041649","journal-title":"Appl Sci"},{"issue":"3","key":"2705_CR36","doi-asserted-by":"publisher","first-page":"3676","DOI":"10.1109\/JIOT.2023.3315137","volume":"11","author":"D Adhikari","year":"2024","unstructured":"Adhikari D, Jiang W, Zhan J, Assefa M, Khorshidi HA, Aickelin U et al (2024) A lightweight-window-portion-based multiple imputation for extreme missing gaps in IoT systems. IEEE Int Things J 11(3):3676\u20133689. https:\/\/doi.org\/10.1109\/JIOT.2023.3315137","journal-title":"IEEE Int Things J"},{"key":"2705_CR37","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/s11263-015-0816-y","volume":"115","author":"O Russakovsky","year":"2015","unstructured":"Russakovsky O, Deng J, Su H, Krause J, Satheesh S, Ma S et al (2015) Imagenet large scale visual recognition challenge. Intern J Comput Vis 115:211\u2013252","journal-title":"Intern J Comput Vis"},{"key":"2705_CR38","doi-asserted-by":"crossref","unstructured":"Ranjie D, Xiaofeng M, K QA, Yuefeng C, Shaokai Y, Yuan H, et\u00a0al (2021) Adversarial laser beam: effective physical-world attack to DNNs in a blink. In: Proceedings of the 2021 IEEE\/CVF conference on computer vision and pattern recognition; pp 16057\u201316066","DOI":"10.1109\/CVPR46437.2021.01580"},{"key":"2705_CR39","unstructured":"Chengyin H, Yilong W, Kalibinuer T, Wen L (2023) Adversarial laser spot: Robust and covert physical-world attack to dnns. In: Proceedings of Asian conference on machine learning. PMLR pp 483\u2013498"},{"key":"2705_CR40","unstructured":"Hanyu\u00a0Wu,  Ke\u00a0Yan P, Tian L (2024) Adversarial cross-laser attack: stable and effective attack to DNNs in the real world. In: Proceedings of the 29th Australasian conference on information security and privacy; p. accepted"}],"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-02705-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13042-025-02705-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-025-02705-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T11:24:26Z","timestamp":1762514666000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13042-025-02705-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,8]]},"references-count":40,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2025,11]]}},"alternative-id":["2705"],"URL":"https:\/\/doi.org\/10.1007\/s13042-025-02705-x","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"value":"1868-8071","type":"print"},{"value":"1868-808X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,7,8]]},"assertion":[{"value":"15 October 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 May 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 July 2025","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 competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}