{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,8]],"date-time":"2026-06-08T20:57:55Z","timestamp":1780952275775,"version":"3.54.1"},"reference-count":46,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"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","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1016\/j.ins.2026.123753","type":"journal-article","created":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T06:33:57Z","timestamp":1780641237000},"page":"123753","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["GB-IMST: Adaptive granular ball generation and minimum spanning tree clustering fusing interquartile range"],"prefix":"10.1016","volume":"754","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-3911-1875","authenticated-orcid":false,"given":"Ting","family":"Wu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0061-1664","authenticated-orcid":false,"given":"Xueling","family":"Ma","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3180-7347","authenticated-orcid":false,"given":"Weiping","family":"Ding","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2510-9515","authenticated-orcid":false,"given":"Jianming","family":"Zhan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"8","key":"10.1016\/j.ins.2026.123753_bib0005","doi-asserted-by":"crossref","first-page":"4068","DOI":"10.1109\/TNNLS.2021.3121224","article-title":"Fusion of centroid-based clustering with graph clustering: an expectation-maximization-based hybrid clustering","volume":"34","author":"Uykan","year":"2023","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"10.1016\/j.ins.2026.123753_bib0010","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2026.131240","article-title":"Graph cohesiveness based clustering","volume":"311","author":"Chen","year":"2026","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.ins.2026.123753_bib0015","doi-asserted-by":"crossref","first-page":"25229","DOI":"10.1109\/ACCESS.2026.3664482","article-title":"DFCN-CE3: a three-way clustering algorithm based on deep-fusion clustering network","volume":"14","author":"Lin","year":"2026","journal-title":"IEEE Access"},{"issue":"12","key":"10.1016\/j.ins.2026.123753_bib0020","article-title":"Spatial bootstrapping using deep clustering methods: spatial machine learning applied to Lombardy HIGH-TECH businesses","volume":"17","author":"Alessio","year":"2025","journal-title":"Regional Science Policy&Practice"},{"issue":"7","key":"10.1016\/j.ins.2026.123753_bib0025","doi-asserted-by":"crossref","first-page":"714","DOI":"10.1016\/j.clbc.2025.07.027","article-title":"Prediction of overall and relapse-free survival in triple-negative breast cancer patients through machine learning-based clustering on clinical data","volume":"25","author":"Alzate-Granados","year":"2025","journal-title":"Clin. Breast Cancer"},{"issue":"2","key":"10.1016\/j.ins.2026.123753_bib0030","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1016\/j.ejor.2025.07.025","article-title":"Social network-based overlapping community clustering and feedback mechanism for large-scale group decision making","volume":"329","author":"Ding","year":"2026","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"10.1016\/j.ins.2026.123753_bib0035","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1016\/S0031-3203(02)00060-2","article-title":"The global k-means clustering algorithm","volume":"36","author":"Likas","year":"2003","journal-title":"Pattern Recognit."},{"key":"10.1016\/j.ins.2026.123753_bib0040","series-title":"Proceedings of the Second International Conference on Knowledge Discovery and Data Mining","first-page":"226","article-title":"A density-based algorithm for discovering clusters in large spatial databases with noise","volume":"vol. 96","author":"Ester","year":"1996"},{"issue":"2","key":"10.1016\/j.ins.2026.123753_bib0045","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1145\/276305.276312","article-title":"CURE: an efficient clustering algorithm for large databases","volume":"27","author":"Guha","year":"1998","journal-title":"ACM SIGMOD Rec."},{"issue":"12","key":"10.1016\/j.ins.2026.123753_bib0050","doi-asserted-by":"crossref","first-page":"9150","DOI":"10.1109\/TKDE.2024.3423307","article-title":"Robust multi-view clustering with noisy correspondence","volume":"36","author":"Sun","year":"2024","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.ins.2026.123753_bib0055","doi-asserted-by":"crossref","first-page":"828","DOI":"10.1109\/TIP.2025.3529378","article-title":"Prototype matching learning for incomplete multi-view clustering","volume":"34","author":"Yuan","year":"2025","journal-title":"IEEE Trans. Image Process."},{"key":"10.1016\/j.ins.2026.123753_bib0060","series-title":"2025 IEEE\/CVF Conference on Computer Vision and Pattern Recognition (CVPR)","first-page":"30732","article-title":"ROLL: robust noisy pseudo-label learning for multi-view clustering with noisy correspondence","author":"Sun","year":"2025"},{"key":"10.1016\/j.ins.2026.123753_bib0065","doi-asserted-by":"crossref","DOI":"10.1016\/j.inffus.2025.103134","article-title":"Triplets-based large-scale multi-view spectral clustering","volume":"121","author":"Yang","year":"2025","journal-title":"Inf. Fusion"},{"key":"10.1016\/j.ins.2026.123753_bib0070","article-title":"Clustering for power system stability using graph theory and electrical distance, sustainable Energy","volume":"43","author":"Diahovchenko","year":"2025","journal-title":"Grids and Networks"},{"key":"10.1016\/j.ins.2026.123753_bib0075","doi-asserted-by":"crossref","DOI":"10.1016\/j.neucom.2026.132957","article-title":"Density-increment and cut-edge optimized clustering via minimum spanning forest","volume":"674","author":"Zhai","year":"2026","journal-title":"Neurocomputing"},{"key":"10.1016\/j.ins.2026.123753_bib0080","first-page":"849","article-title":"On spectral clustering: analysis and an algorithm","volume":"14","author":"Ng","year":"2001","journal-title":"Neural Inf. Process. Syst."},{"issue":"1","key":"10.1016\/j.ins.2026.123753_bib0085","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1109\/T-C.1971.223083","article-title":"Graph-theoretical methods for detecting and describing gestalt clusters","volume":"100","author":"Zahn","year":"1971","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"10.1016\/j.ins.2026.123753_bib0090","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1002\/1097-0037(200103)37:2<74::AID-NET2>3.0.CO;2-E","article-title":"A branch and cut method for the degree-constrained minimum spanning tree problem","volume":"37","author":"Caccetta","year":"2001","journal-title":"Networks"},{"issue":"16","key":"10.1016\/j.ins.2026.123753_bib0095","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."},{"issue":"2","key":"10.1016\/j.ins.2026.123753_bib0100","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."},{"issue":"5","key":"10.1016\/j.ins.2026.123753_bib0105","doi-asserted-by":"crossref","first-page":"4767","DOI":"10.1109\/TKDE.2022.3150403","article-title":"Fast LDP-MST: an efficient density-peak-based clustering method for large-size datasets","volume":"35","author":"Qiu","year":"2023","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"2","key":"10.1016\/j.ins.2026.123753_bib0110","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/S0165-0114(97)00077-8","article-title":"Toward a theory of fuzzy information granulation and its centrality in human reasoning and fuzzy logic","volume":"90","author":"Zadeh","year":"1997","journal-title":"Fuzzy Sets Syst."},{"key":"10.1016\/j.ins.2026.123753_bib0115","doi-asserted-by":"crossref","DOI":"10.1016\/j.inffus.2023.101833","article-title":"An overview of granular computing in decision-making: extensions, applications, and challenges","volume":"98","author":"Qin","year":"2023","journal-title":"Inf. Fusion"},{"key":"10.1016\/j.ins.2026.123753_bib0120","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2024.123313","article-title":"Granular-ball computing-based manifold clustering algorithms for ultra-scalable data","volume":"247","author":"Cheng","year":"2024","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.ins.2026.123753_bib0125","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1016\/j.ins.2019.03.052","article-title":"Sequential three-way decisions via multi-granularity-science direct","volume":"507","author":"Qian","year":"2020","journal-title":"Inf. Sci."},{"key":"10.1016\/j.ins.2026.123753_bib0130","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1016\/j.ins.2019.01.010","article-title":"Granular ball computing classifiers for efficient, scalable and robust learning","volume":"483","author":"Xia","year":"2019","journal-title":"Inf. Sci."},{"key":"10.1016\/j.ins.2026.123753_bib0135","doi-asserted-by":"crossref","DOI":"10.1016\/j.neucom.2025.132200","article-title":"A novel hierarchical clustering approach based on granular-ball computing","volume":"665","author":"Jin","year":"2026","journal-title":"Neurocomputing"},{"key":"10.1016\/j.ins.2026.123753_bib0140","doi-asserted-by":"crossref","DOI":"10.1016\/j.neucom.2025.131458","article-title":"Adaptive granular-ball based density peak clustering","volume":"656","author":"Zhang","year":"2025","journal-title":"Neurocomputing"},{"issue":"7","key":"10.1016\/j.ins.2026.123753_bib0145","doi-asserted-by":"crossref","first-page":"12159","DOI":"10.1109\/TNNLS.2024.3497174","article-title":"GBCT: efficient and adaptive clustering via granular-ball computing for complex data","volume":"36","author":"Xia","year":"2025","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"10.1016\/j.ins.2026.123753_bib0150","series-title":"Unsupervised Granular-Ball Partitioning Algorithm Based on KL Divergence, Rough Sets, Lecture Notes in Computer Science (LNCS)","author":"Xu","year":"2025"},{"key":"10.1016\/j.ins.2026.123753_bib0155","series-title":"2024 IEEE 40th International Conference on Data Engineering","first-page":"901","article-title":"An efficient fuzzy stream clustering method based on granular-ball structure","author":"Xie","year":"2024"},{"key":"10.1016\/j.ins.2026.123753_bib0160","doi-asserted-by":"crossref","DOI":"10.1016\/j.patcog.2025.112243","article-title":"GBK-DPC: density peak clustering based on granular ball with K-nearest neighbor","volume":"171","author":"Ni","year":"2026","journal-title":"Pattern Recognit."},{"key":"10.1016\/j.ins.2026.123753_bib0165","series-title":"Proceedings of the American Mathematical Society","first-page":"48","article-title":"On the shortest spanning subtree of a graph and the traveling salesman problem","volume":"vol. 7","author":"Kruskal","year":"1956"},{"issue":"6","key":"10.1016\/j.ins.2026.123753_bib0170","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","article-title":"Shortest connection networks and some generalizations","volume":"36","author":"Prim","year":"1957","journal-title":"Bell Syst. Tech. J."},{"key":"10.1016\/j.ins.2026.123753_bib0175","first-page":"24","article-title":"Minimum spanning trees for gene expression data clustering","volume":"12","author":"Xu","year":"2001","journal-title":"Genome Informatics"},{"key":"10.1016\/j.ins.2026.123753_bib0180","author":"Xia"},{"key":"10.1016\/j.ins.2026.123753_bib0185","series-title":"Outliers in statistical data","author":"Barnett","year":"1984"},{"issue":"3","key":"10.1016\/j.ins.2026.123753_bib0190","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1214\/ss\/1076102418","article-title":"Tukey and data analysis","volume":"18","author":"Hoaglin","year":"2003","journal-title":"Stat. Sci."},{"key":"10.1016\/j.ins.2026.123753_bib0195","series-title":"A local learning approach for clustering, advances in neural information processing systems 20 (NIPS 2007)","first-page":"1529","author":"Wu","year":"2007"},{"key":"10.1016\/j.ins.2026.123753_bib0200","first-page":"617","article-title":"Agglomerative information bottleneck","author":"Slonim","year":"1999","journal-title":"Advances in Neural Information Processing Systems 13 (NIPS 1999)"},{"key":"10.1016\/j.ins.2026.123753_bib0205","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/978-3-031-92747-8_26","article-title":"Fast minimum spanning tree clustering algorithm based on granular-ball computing, rough sets","volume":"15708","author":"Jiang","year":"2025","journal-title":"Lecture Notes in Computer Science (LNCS)"},{"issue":"12","key":"10.1016\/j.ins.2026.123753_bib0210","doi-asserted-by":"crossref","first-page":"17202","DOI":"10.1109\/TNNLS.2023.3300916","article-title":"A fast granular-ball-based density peaks clustering algorithm for large-scale data","volume":"35","author":"Cheng","year":"2024","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"10.1016\/j.ins.2026.123753_bib0215","doi-asserted-by":"crossref","DOI":"10.1016\/j.inffus.2024.102273","article-title":"An adaptive density clustering approach with multi-granularity fusion","volume":"106","author":"Xie","year":"2024","journal-title":"Inf. Fusion"},{"issue":"2","key":"10.1016\/j.ins.2026.123753_bib0220","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1109\/TPAMI.1979.4766909","article-title":"A cluster separation measure","author":"Davies","year":"1979","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/j.ins.2026.123753_bib0225","series-title":"On the Surprising Behavior of Distance Metrics in High Dimensional Space","author":"Aggarwal","year":"2001"},{"issue":"1","key":"10.1016\/j.ins.2026.123753_bib0230","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1497577.1497578","article-title":"Clustering high-dimensional data: a survey on subspace clustering, pattern-based clustering, and correlation clustering","volume":"3","author":"Kriegel","year":"2009","journal-title":"ACM Trans. Knowl. Discov. Data"}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025526006845?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025526006845?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,8]],"date-time":"2026-06-08T20:06:47Z","timestamp":1780949207000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020025526006845"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":46,"alternative-id":["S0020025526006845"],"URL":"https:\/\/doi.org\/10.1016\/j.ins.2026.123753","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"GB-IMST: Adaptive granular ball generation and minimum spanning tree clustering fusing interquartile range","name":"articletitle","label":"Article Title"},{"value":"Information Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ins.2026.123753","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"123753"}}