{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T12:53:23Z","timestamp":1774011203370,"version":"3.50.1"},"reference-count":47,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61373004"],"award-info":[{"award-number":["61373004"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Neurocomputing"],"published-print":{"date-parts":[[2026,4]]},"DOI":"10.1016\/j.neucom.2026.132957","type":"journal-article","created":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T01:00:21Z","timestamp":1770253221000},"page":"132957","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Density-increment and cut-edge optimized clustering via minimum spanning forest"],"prefix":"10.1016","volume":"674","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-9106-0169","authenticated-orcid":false,"given":"Haoyu","family":"Zhai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3109-472X","authenticated-orcid":false,"given":"Jie","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hantao","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4626-1401","authenticated-orcid":false,"given":"Yan","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.neucom.2026.132957_bib1","doi-asserted-by":"crossref","first-page":"22469","DOI":"10.1007\/s11042-022-14199-8","article-title":"Interactive image segmentation based on multi-layer random forest classifiers","volume":"82","author":"Shan","year":"2023","journal-title":"Multimed. Tools Appl."},{"key":"10.1016\/j.neucom.2026.132957_bib2","doi-asserted-by":"crossref","first-page":"1685","DOI":"10.1007\/s10044-023-01195-3","article-title":"Expanded relative density peak clustering for image segmentation","volume":"26","author":"Li","year":"2023","journal-title":"Pattern Anal. Appl."},{"key":"10.1016\/j.neucom.2026.132957_bib3","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2025.126608","article-title":"Categorical data clustering: 25 years beyond K-modes","volume":"272","author":"Dinh","year":"2025","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.neucom.2026.132957_bib4","doi-asserted-by":"crossref","first-page":"100","DOI":"10.2307\/2346830","article-title":"A k-means clustering algorithm","volume":"28","author":"Hartigan","year":"1979","journal-title":"Appl. Stat."},{"key":"10.1016\/j.neucom.2026.132957_bib5","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/BF02289588","article-title":"Hierarchical clustering schemes","volume":"32","author":"Johnson","year":"1967","journal-title":"Psychometrika"},{"key":"10.1016\/j.neucom.2026.132957_bib6","first-page":"226","article-title":"A density-based algorithm for discovering clusters in large spatial databases with noise","author":"Ester","year":"1996","journal-title":"KDD"},{"key":"10.1016\/j.neucom.2026.132957_bib7","doi-asserted-by":"crossref","first-page":"8219","DOI":"10.1007\/s10462-022-10366-3","article-title":"Comprehensive survey on hierarchical clustering algorithms and the recent developments","volume":"56","author":"Ran","year":"2023","journal-title":"Artif. Intell. Rev."},{"key":"10.1016\/j.neucom.2026.132957_bib8","article-title":"An adaptive mutual K-nearest neighbors clustering algorithm based on maximizing mutual information","volume":"137","author":"Wang","year":"2022","journal-title":"Pattern Recognit."},{"key":"10.1016\/j.neucom.2026.132957_bib9","doi-asserted-by":"crossref","first-page":"152616","DOI":"10.1109\/ACCESS.2021.3126854","article-title":"KNN-SC: Novel spectral clustering algorithm using k-nearest neighbors","volume":"9","author":"Kim","year":"2021","journal-title":"IEEE Access"},{"key":"10.1016\/j.neucom.2026.132957_bib10","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1016\/j.knosys.2017.07.010","article-title":"Adaptive density peak clustering based on K-nearest neighbors with aggregating strategy","volume":"133","author":"Liu","year":"2017","journal-title":"Knowl. Based Syst."},{"key":"10.1016\/j.neucom.2026.132957_bib11","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1007\/s10844-020-00602-z","article-title":"A minimum spanning tree based partitioning and merging technique for clustering heterogeneous data sets","volume":"55","author":"Mishra","year":"2020","journal-title":"J. Intell. Inf. Syst."},{"key":"10.1016\/j.neucom.2026.132957_bib12","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/j.eswa.2019.04.048","article-title":"A fast hybrid clustering technique based on local nearest neighbor using minimum spanning tree","volume":"132","author":"Mishra","year":"2019","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.neucom.2026.132957_bib13","doi-asserted-by":"crossref","first-page":"43707","DOI":"10.1109\/ACCESS.2019.2904995","article-title":"A novel hybrid clustering algorithm based on minimum spanning tree of natural core points","volume":"7","author":"Huang","year":"2019","journal-title":"IEEE Access"},{"key":"10.1016\/j.neucom.2026.132957_bib14","doi-asserted-by":"crossref","DOI":"10.1016\/j.patcog.2020.107206","article-title":"A novel density-based clustering algorithm using nearest neighbor graph","volume":"102","author":"Li","year":"2020","journal-title":"Pattern Recognit."},{"issue":"7","key":"10.1016\/j.neucom.2026.132957_bib15","doi-asserted-by":"crossref","first-page":"11875","DOI":"10.3934\/mbe.2023528","article-title":"A novel density peaks clustering algorithm for automatic selection of clustering centers based on K-nearest neighbors","volume":"20","author":"Wang","year":"2023","journal-title":"Math. Biosci. Eng. MBE"},{"key":"10.1016\/j.neucom.2026.132957_bib16","doi-asserted-by":"crossref","first-page":"6307","DOI":"10.1109\/TPAMI.2022.3213574","article-title":"SMMP: A stable-membership-based auto-tuning multi-peak clustering algorithm","volume":"45","author":"Guan","year":"2022","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/j.neucom.2026.132957_bib17","doi-asserted-by":"crossref","first-page":"1341","DOI":"10.23919\/cje.2022.00.165","article-title":"Reverse-nearest-neighbor-based clustering by fast search and find of density peaks","volume":"32","author":"Zhang","year":"2023","journal-title":"Chin. J. Electron."},{"key":"10.1016\/j.neucom.2026.132957_bib18","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2021.115763","article-title":"KR-DBSCAN: A density-based clustering algorithm based on reverse nearest neighbor and influence space","volume":"186","author":"Hu","year":"2021","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.neucom.2026.132957_bib19","doi-asserted-by":"crossref","first-page":"1109","DOI":"10.1109\/TKDE.2017.2787640","article-title":"RNN-DBSCAN: A density-based clustering algorithm using reverse nearest neighbor density estimates","volume":"30","author":"Bryant","year":"2018","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.neucom.2026.132957_bib20","article-title":"Information entropy peaks clustering using dynamic reverse nearest neighbor sequence and 3D decision graph","author":"Lu","year":"2025","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.neucom.2026.132957_bib21","doi-asserted-by":"crossref","DOI":"10.1016\/j.patcog.2023.109341","article-title":"DCSNE: Density-based clustering using graph shared neighbors and entropy","volume":"137","author":"Maheshwari","year":"2023","journal-title":"Pattern Recognit."},{"key":"10.1016\/j.neucom.2026.132957_bib22","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1109\/TKDE.2020.2982400","article-title":"RDMN: A relative density measure based on MST neighborhood for clustering multi-scale datasets","volume":"34","author":"Mishra","year":"2022","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.neucom.2026.132957_bib23","series-title":"International Joint Conference on Rough Sets","first-page":"405","article-title":"Fast minimum spanning tree clustering algorithm based on granular-ball computing","author":"Jiang","year":"2025"},{"key":"10.1016\/j.neucom.2026.132957_bib24","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2022.116573","article-title":"A robust clustering algorithm based on the identification of core points and KNN kernel density estimation","volume":"195","author":"Zhou","year":"2022","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.neucom.2026.132957_bib25","article-title":"A split-merge clustering algorithm based on the k-nearest neighbor graph","volume":"111","author":"Wang","year":"2022","journal-title":"Inf. Syst."},{"key":"10.1016\/j.neucom.2026.132957_bib26","doi-asserted-by":"crossref","first-page":"32379","DOI":"10.1007\/s11042-021-11171-w","article-title":"A neighborhood-based three-stage hierarchical clustering algorithm","volume":"80","author":"Wang","year":"2021","journal-title":"Multimed. Tools Appl."},{"key":"10.1016\/j.neucom.2026.132957_bib27","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1016\/j.ins.2020.12.016","article-title":"A multi-stage hierarchical clustering algorithm based on centroid of tree and cut edge constraint","volume":"557","author":"Ma","year":"2021","journal-title":"Inf. Sci."},{"key":"10.1016\/j.neucom.2026.132957_bib28","doi-asserted-by":"crossref","first-page":"3397","DOI":"10.1016\/j.ins.2011.04.013","article-title":"Minimum spanning tree based split-and-merge: a hierarchical clustering method","volume":"181","author":"Zhong","year":"2011","journal-title":"Inf. Sci."},{"key":"10.1016\/j.neucom.2026.132957_bib29","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1109\/TKDE.2019.2930056","article-title":"Clustering with local density peaks-based minimum spanning tree","volume":"33","author":"Cheng","year":"2021","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.neucom.2026.132957_bib30","doi-asserted-by":"crossref","DOI":"10.1155\/2022\/8496265","article-title":"A novel minimum spanning tree clustering algorithm based on density core","volume":"2022","author":"Gao","year":"2022","journal-title":"Comput. Intell. Neurosci."},{"key":"10.1016\/j.neucom.2026.132957_bib31","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2023.119784","article-title":"A novel cluster validity index based on augmented non-shared nearest neighbors","volume":"223","author":"Duan","year":"2023","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.neucom.2026.132957_bib32","doi-asserted-by":"crossref","DOI":"10.1155\/2018\/8451796","article-title":"CciMST: A clustering algorithm based on minimum spanning tree and cluster centers","volume":"2018","author":"Lv","year":"2018","journal-title":"Math. Probl. Eng."},{"key":"10.1016\/j.neucom.2026.132957_bib33","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/j.compbiomed.2016.02.007","article-title":"Functional grouping of similar genes using eigenanalysis on minimum spanning tree based neighborhood graph","volume":"71","author":"Jothi","year":"2016","journal-title":"Comput. Biol. Med."},{"key":"10.1016\/j.neucom.2026.132957_bib34","unstructured":"C.L. Blake, UCI repository of machine learning databases, http:\/\/www. ics. uci. edu\/\u223c mlearn\/MLRepository. html, (1998)."},{"key":"10.1016\/j.neucom.2026.132957_bib35","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2025.113250","article-title":"Discovering generalized clusters with adaptive mixture density-based clustering","volume":"314","author":"Fei","year":"2025","journal-title":"Knowl. Based Syst."},{"key":"10.1016\/j.neucom.2026.132957_bib36","doi-asserted-by":"crossref","DOI":"10.1016\/j.ins.2024.121602","article-title":"KNEG-CL: Unveiling data patterns using a k-nearest neighbor evolutionary graph for efficient clustering","volume":"690","author":"Fei","year":"2025","journal-title":"Inf. Sci."},{"key":"10.1016\/j.neucom.2026.132957_bib37","doi-asserted-by":"crossref","first-page":"13239","DOI":"10.1007\/s00521-023-08386-3","article-title":"A. \u015eenol, MCMSTClustering: defining non-spherical clusters by using minimum spanning tree over KD-tree-based micro-clusters","volume":"35","year":"2023","journal-title":"Neural Comput. Appl."},{"key":"10.1016\/j.neucom.2026.132957_bib38","first-page":"13177","article-title":"CDC: A simple framework for complex data clustering","author":"Kang","year":"2024","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"10.1016\/j.neucom.2026.132957_bib39","doi-asserted-by":"crossref","DOI":"10.1016\/j.ins.2024.121023","article-title":"Multi-scale graph clustering network","volume":"678","author":"Li","year":"2024","journal-title":"Inf. Sci."},{"key":"10.1016\/j.neucom.2026.132957_bib40","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0377-0427(87)90125-7","article-title":"Silhouettes: a graphical aid to the interpretation and validation of cluster analysis","volume":"20","author":"Rousseeuw","year":"1987","journal-title":"J. Comput. Appl. Math."},{"key":"10.1016\/j.neucom.2026.132957_bib41","first-page":"224","article-title":"A cluster separation measure","author":"Davies","year":"2009","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/j.neucom.2026.132957_bib42","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1016\/j.jmva.2006.11.013","article-title":"Comparing clusterings\u2014an information based distance","volume":"98","author":"Meil\u0103","year":"2007","journal-title":"J. Multivar. Anal."},{"key":"10.1016\/j.neucom.2026.132957_bib43","first-page":"02","article-title":"Detecting highly overlapping communities with model-based","volume":"1","author":"McDaid","year":"2010","journal-title":"Communities"},{"key":"10.1016\/j.neucom.2026.132957_bib44","doi-asserted-by":"crossref","first-page":"2274","DOI":"10.1109\/TPAMI.2012.120","article-title":"SLIC superpixels compared to state-of-the-art superpixel methods","volume":"34","author":"Achanta","year":"2012","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/j.neucom.2026.132957_bib45","first-page":"10","article-title":"Color image segmentation metrics","volume":"95","author":"Harouni","year":"2018","journal-title":"Encycl. Image Process."},{"key":"10.1016\/j.neucom.2026.132957_bib46","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1080\/01621459.1937.10503522","article-title":"The use of ranks to avoid the assumption of normality implicit in the analysis of variance","volume":"32","author":"Friedman","year":"1937","journal-title":"J. Am. Stat. Assoc."},{"key":"10.1016\/j.neucom.2026.132957_bib47","doi-asserted-by":"crossref","first-page":"1767","DOI":"10.1214\/aop\/1176991596","article-title":"Growth rates of Euclidean minimal spanning trees with power weighted edges","volume":"16","author":"Steele","year":"1988","journal-title":"Ann. Probab."}],"container-title":["Neurocomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925231226003541?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925231226003541?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T10:43:04Z","timestamp":1774003384000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925231226003541"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4]]},"references-count":47,"alternative-id":["S0925231226003541"],"URL":"https:\/\/doi.org\/10.1016\/j.neucom.2026.132957","relation":{},"ISSN":["0925-2312"],"issn-type":[{"value":"0925-2312","type":"print"}],"subject":[],"published":{"date-parts":[[2026,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Density-increment and cut-edge optimized clustering via minimum spanning forest","name":"articletitle","label":"Article Title"},{"value":"Neurocomputing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.neucom.2026.132957","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"132957"}}