{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,25]],"date-time":"2024-08-25T00:16:26Z","timestamp":1724544986636},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"16","license":[{"start":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T00:00:00Z","timestamp":1720396800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T00:00:00Z","timestamp":1720396800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"the National Social Science Foundation of China","award":["20BMZ092"],"award-info":[{"award-number":["20BMZ092"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2024,11]]},"DOI":"10.1007\/s11227-024-06337-w","type":"journal-article","created":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T13:02:00Z","timestamp":1720443720000},"page":"24358-24378","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient MST-based clustering with leader node selection and outlier edge cutting"],"prefix":"10.1007","volume":"80","author":[{"given":"Yuzhuo","family":"Yao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,7,8]]},"reference":[{"unstructured":"MacQueen JB (1967) Some methods for classification and analysis of multivariate observations. In: Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability 1:281\u2013297","key":"6337_CR1"},{"key":"6337_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.buildenv.2023.110097","volume":"233","author":"AM Bueno","year":"2023","unstructured":"Bueno AM, Mendes da Luz I, Niza IL, Broday EE (2023) Hierarchical and k-means clustering to assess thermal dissatisfaction and productivity in university classrooms. Build Environ 233:110097. https:\/\/doi.org\/10.1016\/j.buildenv.2023.110097","journal-title":"Build Environ"},{"doi-asserted-by":"publisher","unstructured":"Paul S, De S, Dey S (2020) A novel approach of data clustering using an improved particle swarm optimization based k-means clustering algorithm. In: 2020 IEEE International Conference on Electronics, Computing and Communication Technologies (CONECCT), pp 1\u20136 . https:\/\/doi.org\/10.1109\/CONECCT50063.2020.9198685","key":"6337_CR3","DOI":"10.1109\/CONECCT50063.2020.9198685"},{"doi-asserted-by":"publisher","unstructured":"Shukla A, Cheema GS, Anand S (2020) Semi-supervised clustering with neural networks. In: 2020 IEEE Sixth International Conference on Multimedia Big Data (BigMM), pp 152\u2013161. https:\/\/doi.org\/10.1109\/BigMM50055.2020.00030","key":"6337_CR4","DOI":"10.1109\/BigMM50055.2020.00030"},{"key":"6337_CR5","volume-title":"Algorithms for clustering data","author":"AK Jain","year":"1988","unstructured":"Jain AK, Dubes RC (1988) Algorithms for clustering data. Prentice-Hall, Inc, Hoboken"},{"issue":"3","key":"6337_CR6","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, Kriegel HP, Xu X (2017) Dbscan revisited, revisited: why and how you should (still) use dbscan. ACM Trans Database Syst (TODS) 42(3):1\u201321","journal-title":"ACM Trans Database Syst (TODS)"},{"issue":"6191","key":"6337_CR7","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(6191):1492\u20131496","journal-title":"Science"},{"unstructured":"Ester M, Kriegel H-P, Sander J, Xu X et al (1996) A density-based algorithm for discovering clusters in large spatial databases with noise. In: kbb, 96:226\u2013231","key":"6337_CR8"},{"key":"6337_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2022.109273","volume":"137","author":"Y Wang","year":"2023","unstructured":"Wang Y, Pang W, Jiao Z (2023) An adaptive mutual k-nearest neighbors clustering algorithm based on maximizing mutual information. Pattern Recognit 137:109273. https:\/\/doi.org\/10.1016\/j.patcog.2022.109273","journal-title":"Pattern Recognit"},{"key":"6337_CR10","first-page":"849","volume":"14","author":"A Ng","year":"2001","unstructured":"Ng A, Jordan M, Weiss Y (2001) On spectral clustering: analysis and an algorithm. Adv Neural Inf Process Syst 14:849","journal-title":"Adv Neural Inf Process Syst"},{"unstructured":"Bianchi F.M, Grattarola D, Alippi C (2020). Spectral clustering with graph neural networks for graph pooling. In: III, H.D., Singh, A. (eds.) Proceedings of the 37th International Conference on Machine Learning. Proceedings of Machine Learning Research, 119, 874\u2013883","key":"6337_CR11"},{"key":"6337_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2022.102159","author":"Q-F Yang","year":"2023","unstructured":"Yang Q-F, Gao W-Y, Han G, Li Z-Y, Tian M, Zhu S-H, Deng Y-h (2023) Hcdc: a novel hierarchical clustering algorithm based on density-distance cores for data sets with varying density. Inf Syst. https:\/\/doi.org\/10.1016\/j.is.2022.102159","journal-title":"Inf Syst"},{"issue":"2","key":"6337_CR13","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1109\/TKDE.2019.2930056","volume":"33","author":"D Cheng","year":"2021","unstructured":"Cheng D, Zhu Q, Huang J, Wu Q, Yang L (2021) Clustering with local density peaks-based minimum spanning tree. IEEE Trans Knowl Data Eng 33(2):374\u2013387. https:\/\/doi.org\/10.1109\/TKDE.2019.2930056","journal-title":"IEEE Trans Knowl Data Eng"},{"doi-asserted-by":"crossref","unstructured":"Kruskal JB (1956) On the shortest spanning subtree of a graph and the traveling salesman problem. In: Proceedings of the American Mathematical Society 7(1):48\u201350","key":"6337_CR14","DOI":"10.1090\/S0002-9939-1956-0078686-7"},{"key":"6337_CR15","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1109\/T-C.1971.223083","volume":"20","author":"CT Zahn","year":"1971","unstructured":"Zahn CT (1971) Graph-theoretical methods for detecting and describing gestalt clusters. IEEE Trans Comput C 20:68\u201386","journal-title":"IEEE Trans Comput C"},{"issue":"5","key":"6337_CR16","doi-asserted-by":"publisher","first-page":"1523","DOI":"10.1016\/j.dsp.2013.03.009","volume":"23","author":"X Wang","year":"2013","unstructured":"Wang X, Wang XL, Chen C, Wilkes DM (2013) Enhancing minimum spanning tree-based clustering by removing density-based outliers. Digit Signal Process 23(5):1523\u20131538. https:\/\/doi.org\/10.1016\/j.dsp.2013.03.009","journal-title":"Digit Signal Process"},{"key":"6337_CR17","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/j.ins.2020.12.016","volume":"557","author":"Y Ma","year":"2021","unstructured":"Ma Y, Lin H, Wang Y, Huang H, He X (2021) A multi-stage hierarchical clustering algorithm based on centroid of tree and cut edge constraint. Inf Sci 557:194\u2013219. https:\/\/doi.org\/10.1016\/j.ins.2020.12.016","journal-title":"Inf Sci"},{"issue":"1","key":"6337_CR18","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1109\/TKDE.2020.2982400","volume":"34","author":"G Mishra","year":"2022","unstructured":"Mishra G, Mohanty SK (2022) Rdmn: a relative density measure based on MST neighborhood for clustering multi-scale datasets. IEEE Trans Knowl Data Eng 34(1):419\u2013432. https:\/\/doi.org\/10.1109\/TKDE.2020.2982400","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"9","key":"6337_CR19","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. Commun ACM 18(9):509\u2013517. https:\/\/doi.org\/10.1145\/361002.361007","journal-title":"Commun ACM"},{"doi-asserted-by":"publisher","unstructured":"Grygorash O, Zhou Y, Jorgensen Z (2006) Minimum spanning tree based clustering algorithms. In: 2006 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI\u201906), pp 73\u201381 . https:\/\/doi.org\/10.1109\/ICTAI.2006.83","key":"6337_CR20","DOI":"10.1109\/ICTAI.2006.83"},{"unstructured":"Anadkat M (2021) Clustering datasets. https:\/\/github.com\/milaan9\/Clustering-Datasets","key":"6337_CR21"},{"issue":"3","key":"6337_CR22","doi-asserted-by":"publisher","first-page":"982","DOI":"10.1109\/TSMCB.2012.2220543","volume":"43","author":"Y Liu","year":"2013","unstructured":"Liu Y, Li Z, Xiong H, Gao X, Wu J, Wu S (2013) Understanding and enhancement of internal clustering validation measures. IEEE Trans Cybern 43(3):982\u2013994. https:\/\/doi.org\/10.1109\/TSMCB.2012.2220543","journal-title":"IEEE Trans Cybern"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-06337-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-024-06337-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-06337-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,24]],"date-time":"2024-08-24T12:12:44Z","timestamp":1724501564000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-024-06337-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,8]]},"references-count":22,"journal-issue":{"issue":"16","published-print":{"date-parts":[[2024,11]]}},"alternative-id":["6337"],"URL":"https:\/\/doi.org\/10.1007\/s11227-024-06337-w","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2024,7,8]]},"assertion":[{"value":"1 July 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 July 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"I declare that we have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not Applicable","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}