{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,9]],"date-time":"2026-08-09T19:41:59Z","timestamp":1786304519218,"version":"build-2736575974"},"reference-count":46,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2027,1,1]],"date-time":"2027-01-01T00:00:00Z","timestamp":1798761600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2027,1,1]],"date-time":"2027-01-01T00:00:00Z","timestamp":1798761600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2027,1,1]],"date-time":"2027-01-01T00:00:00Z","timestamp":1798761600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2027,1,1]],"date-time":"2027-01-01T00:00:00Z","timestamp":1798761600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2027,1,1]],"date-time":"2027-01-01T00:00:00Z","timestamp":1798761600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2027,1,1]],"date-time":"2027-01-01T00:00:00Z","timestamp":1798761600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2027,1,1]],"date-time":"2027-01-01T00:00:00Z","timestamp":1798761600000},"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":[[2027,1]]},"DOI":"10.1016\/j.ins.2026.123967","type":"journal-article","created":{"date-parts":[[2026,7,31]],"date-time":"2026-07-31T15:04:09Z","timestamp":1785510249000},"page":"123967","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["MSGB: Adaptive granular ball clustering via mean shift optimization and graph-based density connectivity"],"prefix":"10.1016","volume":"758","author":[{"given":"Menghui","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xueling","family":"Ma","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Salvador","family":"Garc\u00eda","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":"5","key":"10.1016\/j.ins.2026.123967_bib0005","doi-asserted-by":"crossref","first-page":"917","DOI":"10.1109\/TSMC.2017.2689789","article-title":"Fast reduced set-based exemplar finding and cluster assignment","volume":"49","author":"Zhang","year":"2019","journal-title":"IEEE Trans. Syst. Man Cybern. Syst."},{"key":"10.1016\/j.ins.2026.123967_bib0010","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2020.114264","article-title":"Applications of picture fuzzy similarity measures in pattern recognition, clustering, and MADM","volume":"168","author":"Singh","year":"2021","journal-title":"Expert Syst. Appl."},{"issue":"1","key":"10.1016\/j.ins.2026.123967_bib0015","first-page":"390","article-title":"Robust bistochastic graph regularized matrix factorization for data clustering","volume":"44","author":"Wang","year":"2022","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"1","key":"10.1016\/j.ins.2026.123967_bib0020","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1109\/TCYB.2024.3475034","article-title":"GRESS: grouping belief-based deep contrastive subspace clustering","volume":"55","author":"Chen","year":"2025","journal-title":"IEEE Trans. Cybern."},{"key":"10.1016\/j.ins.2026.123967_bib0025","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1016\/j.asoc.2014.04.017","article-title":"A review on type-2 fuzzy logic applications in clustering, classification and pattern recognition","volume":"21","author":"Melin","year":"2014","journal-title":"Appl. Soft Comput."},{"issue":"9","key":"10.1016\/j.ins.2026.123967_bib0030","doi-asserted-by":"crossref","first-page":"1753","DOI":"10.1109\/TFUZZ.2018.2889018","article-title":"Superpixel-based fast fuzzy C-means clustering for color image SEG- mentation","volume":"27","author":"Lei","year":"2019","journal-title":"IEEE Trans. Fuzzy Syst."},{"key":"10.1016\/j.ins.2026.123967_bib0035","series-title":"Proc. 5th Berkeley Symp, Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability","first-page":"281","article-title":"Some methods for classification and analysis of multivariate observations","author":"Macqueen","year":"1967"},{"issue":"1","key":"10.1016\/j.ins.2026.123967_bib0040","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1002\/widm.53","article-title":"Algorithms for hierarchical clustering: an overview","volume":"2","author":"Murtagh","year":"2017","journal-title":"Wiley Interdiscip. Rev. Data Min. Knowl. Discov."},{"key":"10.1016\/j.ins.2026.123967_bib0045","series-title":"Multi-View and Multiorder Graph Clustering via Constrained L1,2-norm","author":"Xin","year":"2024"},{"issue":"6191","key":"10.1016\/j.ins.2026.123967_bib0050","doi-asserted-by":"crossref","first-page":"1492","DOI":"10.1126\/science.1242072","article-title":"Clustering by fast search and find of density peaks","volume":"344","author":"Rodriguez","year":"2014","journal-title":"Science"},{"key":"10.1016\/j.ins.2026.123967_bib0055","series-title":"Proceedings of the 2nd 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","author":"Ester","year":"1996"},{"key":"10.1016\/j.ins.2026.123967_bib0060","series-title":"Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms","first-page":"1027","article-title":"K-means++: the advantages of careful seeding","author":"Arthur","year":"2007"},{"key":"10.1016\/j.ins.2026.123967_bib0065","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s10618-005-1396-1","article-title":"Automatic subspace clustering of high dimensional data","volume":"11","author":"Agrawal","year":"2005","journal-title":"Data Min. Knowl. Discov."},{"key":"10.1016\/j.ins.2026.123967_bib0070","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2025.113498","article-title":"Anchor graph based connectivity peaks clustering","volume":"319","author":"Cai","year":"2025","journal-title":"Knowl.-Based Syst."},{"issue":"4","key":"10.1016\/j.ins.2026.123967_bib0075","doi-asserted-by":"crossref","first-page":"2348","DOI":"10.1109\/TSMC.2021.3049490","article-title":"A novel approximate spectral clustering algorithm with dense cores and density peaks","volume":"52","author":"Cheng","year":"2022","journal-title":"IEEE Trans. Syst. Man Cybern. Syst."},{"issue":"8","key":"10.1016\/j.ins.2026.123967_bib0080","doi-asserted-by":"crossref","first-page":"11077","DOI":"10.1109\/TNNLS.2023.3248064","article-title":"K-means clustering with natural density peaks for discovering arbitrary-shaped clusters","volume":"35","author":"Cheng","year":"2024","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"10.1016\/j.ins.2026.123967_bib0085","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.123967_bib0090","doi-asserted-by":"crossref","DOI":"10.1016\/j.patcog.2025.112021","article-title":"Enhancing robustness and efficiency of least square twin SVM via granular computing","volume":"170","author":"Tanveer","year":"2026","journal-title":"Pattern Recognit."},{"key":"10.1016\/j.ins.2026.123967_bib0095","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":"12","key":"10.1016\/j.ins.2026.123967_bib0100","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.123967_bib0105","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."},{"issue":"3","key":"10.1016\/j.ins.2026.123967_bib0110","doi-asserted-by":"crossref","first-page":"1700","DOI":"10.1109\/TCYB.2025.3630602","article-title":"An adaptive density distribution clustering method for arbitrary-shaped datasets","volume":"56","author":"Wu","year":"2026","journal-title":"IEEE Trans. Cybern."},{"issue":"2","key":"10.1016\/j.ins.2026.123967_bib0115","doi-asserted-by":"crossref","first-page":"2022","DOI":"10.1109\/TETCI.2024.3359091","article-title":"GBG++: a fast and stable granular ball generation method for classification","volume":"8","author":"Xie","year":"2024","journal-title":"IEEE Trans. Emerg. Top. Comput. Intell."},{"issue":"9","key":"10.1016\/j.ins.2026.123967_bib0120","doi-asserted-by":"crossref","first-page":"9743","DOI":"10.1109\/TKDE.2023.3249475","article-title":"An efficient spectral clustering algorithm based on granular-ball","volume":"35","author":"Xie","year":"2023","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.ins.2026.123967_bib0125","series-title":"Rough Sets, IJCRS 2025, Lecture Notes in Computer Science","first-page":"391","article-title":"MOGBC: multi-objective driven granular ball clustering,in","volume":"vol. 15708","author":"Ni","year":"2025"},{"issue":"4","key":"10.1016\/j.ins.2026.123967_bib0130","doi-asserted-by":"crossref","first-page":"1687","DOI":"10.1109\/TCYB.2025.3534195","article-title":"Generation of granular-balls for clustering based on the principle of justifiable granularity","volume":"55","author":"Jia","year":"2025","journal-title":"IEEE Trans. Cybern."},{"issue":"4573","key":"10.1016\/j.ins.2026.123967_bib0135","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1126\/science.7134969","article-title":"Topological structure in visual perception","volume":"218","author":"Chen","year":"1982","journal-title":"Science"},{"issue":"4","key":"10.1016\/j.ins.2026.123967_bib0140","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/s41066-017-0048-3","article-title":"Data-driven granular cognitive computing","volume":"2","author":"Wang","year":"2017","journal-title":"Granul. Comput."},{"key":"10.1016\/j.ins.2026.123967_bib0145","author":"Xia"},{"issue":"1","key":"10.1016\/j.ins.2026.123967_bib0150","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1109\/TIT.1975.1055330","article-title":"The estimation of the gradient of a density function, with applications in pattern recognition","volume":"21","author":"Fukunaga","year":"1975","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"10.1016\/j.ins.2026.123967_bib0155","doi-asserted-by":"crossref","first-page":"790","DOI":"10.1109\/34.400568","article-title":"Mean shift, mode seeking, and clustering","volume":"17","author":"Cheng","year":"1995","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"5","key":"10.1016\/j.ins.2026.123967_bib0160","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1109\/34.1000236","article-title":"Mean shift: a robust approach toward feature space analysis","volume":"24","author":"Comaniciu","year":"2002","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/j.ins.2026.123967_bib0165","series-title":"Proceedings of the Ninth IEEE International Conference on Computer Vision","first-page":"456","article-title":"Mean shift based clustering in high dimensions: a texture classification example","author":"Georgescu","year":"2003"},{"issue":"4\u20136","key":"10.1016\/j.ins.2026.123967_bib0170","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/S0020-0190(00)00142-3","article-title":"A clustering algorithm based on graph connectivity","volume":"76","author":"Hartuv","year":"2000","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/j.ins.2026.123967_bib0175","series-title":"18th IEEE International Conference on Automated Software Engineering","first-page":"106","article-title":"Parallel breadth-first search LTL model-checking","author":"Barnat","year":"2003"},{"issue":"3","key":"10.1016\/j.ins.2026.123967_bib0180","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0020-0190(85)90083-3","article-title":"A new distributed depth-first-search algorithm","volume":"20","author":"Awerbuch","year":"1985","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/j.ins.2026.123967_bib0185","doi-asserted-by":"crossref","DOI":"10.1016\/j.ins.2025.122445","article-title":"NaGB-DBSCAN: an improved DBSCAN clustering algorithm by natural neighbor and granular-ball","volume":"719","author":"Luo","year":"2025","journal-title":"Inf. Sci."},{"issue":"7","key":"10.1016\/j.ins.2026.123967_bib0190","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.123967_bib0195","series-title":"Advances in Neural Information Processing Systems 19: Proceedings of the 2006 Conference","first-page":"1529","article-title":"A local learning approach for clustering","author":"Sch\u00f6lkopf","year":"2007"},{"issue":"1","key":"10.1016\/j.ins.2026.123967_bib0200","first-page":"2837","article-title":"Information theoretic measures for clusterings comparison: variants, properties, normalization and correction for chance","volume":"11","author":"Nguyen","year":"2010","journal-title":"J. Mach. Learn. Res."},{"issue":"9","key":"10.1016\/j.ins.2026.123967_bib0205","doi-asserted-by":"crossref","first-page":"3034","DOI":"10.1016\/j.patcog.2014.03.017","article-title":"Centroid index: cluster level similarity measure","volume":"47","author":"Fr\u00f6nti","year":"2014","journal-title":"Pattern Recognit."},{"key":"10.1016\/j.ins.2026.123967_bib0210","series-title":"Proceedings of the 14th SIAM International Conference on Data Mining (SDM)","first-page":"839","article-title":"Density-based clustering validation","author":"Moulavi","year":"2014"},{"key":"10.1016\/j.ins.2026.123967_bib0215","doi-asserted-by":"crossref","DOI":"10.1016\/j.inffus.2025.103873","article-title":"An effective and robust shadowed granular ball generation method in classification problems","volume":"127","author":"Zhang","year":"2026","journal-title":"Inf. Fusion"},{"key":"10.1016\/j.ins.2026.123967_bib0220","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"},{"issue":"1","key":"10.1016\/j.ins.2026.123967_bib0225","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1214\/aoms\/1177731944","article-title":"A comparison of alternative tests of signicance for the problem ofmrankings","volume":"11","author":"Friedman","year":"1940","journal-title":"Ann. Math. Stat."},{"issue":"293","key":"10.1016\/j.ins.2026.123967_bib0230","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1080\/01621459.1961.10482090","article-title":"Multiple comparisons among means","volume":"56","author":"Dunn","year":"1961","journal-title":"J. Am. Stat. Assoc."}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025526008984?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025526008984?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,8,9]],"date-time":"2026-08-09T19:16:59Z","timestamp":1786303019000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020025526008984"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2027,1]]},"references-count":46,"alternative-id":["S0020025526008984"],"URL":"https:\/\/doi.org\/10.1016\/j.ins.2026.123967","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[2027,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"MSGB: Adaptive granular ball clustering via mean shift optimization and graph-based density connectivity","name":"articletitle","label":"Article Title"},{"value":"Information Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ins.2026.123967","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":"123967"}}