{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T23:20:49Z","timestamp":1777504849922,"version":"3.51.4"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,5,23]],"date-time":"2025-05-23T00:00:00Z","timestamp":1747958400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2025,5,23]],"date-time":"2025-05-23T00:00:00Z","timestamp":1747958400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"name":"the Basic Research Funds for Central Universities","award":["22CX01001A-5"],"award-info":[{"award-number":["22CX01001A-5"]}]},{"name":"the Key Research and Development Program of Shandong Province, China","award":["No. 2022CXPT030"],"award-info":[{"award-number":["No. 2022CXPT030"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Big Data"],"DOI":"10.1186\/s40537-025-01180-z","type":"journal-article","created":{"date-parts":[[2025,5,23]],"date-time":"2025-05-23T07:05:55Z","timestamp":1747983955000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["An adaptive k-means clustering algorithm based on grid and domain centroid weights for digital twins in the context of digital transformation"],"prefix":"10.1186","volume":"12","author":[{"given":"Wei","family":"Cai","sequence":"first","affiliation":[]},{"given":"Fei","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Bo","family":"Yao","sequence":"additional","affiliation":[]},{"given":"Chuanxian","family":"Li","sequence":"additional","affiliation":[]},{"given":"Guangyu","family":"Sun","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,5,23]]},"reference":[{"issue":"4","key":"1180_CR1","doi-asserted-by":"publisher","first-page":"2405","DOI":"10.1109\/tii.2018.2873186","volume":"15","author":"F Tao","year":"2019","unstructured":"Tao F, Zhan H, Liu A, Nee AYC. Digital twin in industry: state-of-the-art. IEEE Trans Industr Inf. 2019;15(4):2405\u201315. https:\/\/doi.org\/10.1109\/tii.2018.2873186.","journal-title":"IEEE Trans Industr Inf"},{"key":"1180_CR2","doi-asserted-by":"publisher","DOI":"10.1049\/rpg2.12823","author":"LC Liu","year":"2023","unstructured":"Liu LC, Dong SF, Nan B, Lu KC. Construction and simulation analysis of lithium-ion batteries thermoelectric coupling model based on digital twin. IET Renew Power Gener. 2023. https:\/\/doi.org\/10.1049\/rpg2.12823.","journal-title":"IET Renew Power Gener"},{"key":"1180_CR3","unstructured":"Macqueen J. Some methods for classification and analysis of multivariate observations. In: Proceedings of the fifth berkeley symposium on mathematical statistics and probability, volume 1: statistics. University of California press: Oakland. 1967."},{"issue":"1","key":"1180_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10115-007-0114-2","volume":"14","author":"XD Wu","year":"2008","unstructured":"Wu XD, Kumar V, Quinlan JR, Ghosh J, Yang Q, Motoda H, Mclachlan GJ, Ng A, Liu B, Yu PS, Zhou ZH, Steinbach M, Hand DJ, Steinberg D. Top 10 algorithms in data mining. Knowl Inf Syst. 2008;14(1):1\u201337. https:\/\/doi.org\/10.1007\/s10115-007-0114-2.","journal-title":"Knowl Inf Syst"},{"issue":"4","key":"1180_CR5","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BF02289263","volume":"18","author":"RL Thorndike","year":"1953","unstructured":"Thorndike RL. Who belongs in the family? Psychometrika. 1953;18(4):267\u201376. https:\/\/doi.org\/10.1007\/BF02289263.","journal-title":"Psychometrika"},{"key":"1180_CR6","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0377-0427(87)90125-7","volume":"20","author":"PJ Rousseeuw","year":"1987","unstructured":"Rousseeuw PJ. Silhouettes: a graphical aid to the interpretation and validation of cluster analysis. J Comput Appl Math. 1987;20:53\u201365. https:\/\/doi.org\/10.1016\/0377-0427(87)90125-7.","journal-title":"J Comput Appl Math"},{"issue":"2","key":"1180_CR7","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1111\/1467-9868.00293","volume":"63","author":"R Tibshirani","year":"2001","unstructured":"Tibshirani R, Walther G, Hastie T. Estimating the number of clusters in a data set via the gap statistic. J R Stat Soc Ser B Stat Methodol. 2001;63(2):411\u201323. https:\/\/doi.org\/10.1111\/1467-9868.00293.","journal-title":"J R Stat Soc Ser B Stat Methodol"},{"key":"1180_CR8","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.bdr.2018.05.003","volume":"13","author":"H Estiri","year":"2018","unstructured":"Estiri H, Omran BA, Murphy SN. kluster: an efficient scalable procedure for approximating the number of clusters in unsupervised learning. Big Data Res. 2018;13:38\u201351. https:\/\/doi.org\/10.1016\/j.bdr.2018.05.003.","journal-title":"Big Data Res"},{"issue":"2","key":"1180_CR9","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s10723-019-09504-z","volume":"18","author":"DL Xia","year":"2020","unstructured":"Xia DL, Ning FF, He WN. Research on parallel adaptive canopy-k-means clustering algorithm for big data mining based on cloud platform. J Grid Comput. 2020;18(2):263\u201373. https:\/\/doi.org\/10.1007\/s10723-019-09504-z.","journal-title":"J Grid Comput"},{"key":"1180_CR10","doi-asserted-by":"publisher","unstructured":"Arthur D, Vassilvitskii S. k-means++: the advantages of careful seeding. ACM-SIAM Symposium on Discrete Algorithms, 2007; 1027-1035. https:\/\/doi.org\/10.1145\/1283383.1283494.","DOI":"10.1145\/1283383.1283494"},{"key":"1180_CR11","doi-asserted-by":"publisher","DOI":"10.1002\/9780470316801","volume-title":"Finding groups in data: an introduction to cluster analysis","author":"L Kaufman","year":"1990","unstructured":"Kaufman L, Rousseeuw P. Finding groups in data: an introduction to cluster analysis. New York: Wiley; 1990."},{"key":"1180_CR12","doi-asserted-by":"publisher","unstructured":"Hua Z, Du T, Qu SN, Mou GD. A data stream clustering algorithm based on density and extended grid. 13th international conference on intelligent computing (ICIC). Springer International Publishing: Cham 2017. Pp. 689\u2013699. https:\/\/doi.org\/10.1007\/978-3-319-63312-1_61.","DOI":"10.1007\/978-3-319-63312-1_61"},{"issue":"7","key":"1180_CR13","doi-asserted-by":"publisher","first-page":"1345","DOI":"10.1007\/s11432-010-3112-z","volume":"53","author":"SH Yue","year":"2010","unstructured":"Yue SH, Wang JS, Tao G, Wang HX. An unsupervised grid-based approach for clustering analysis. Sci China Inf Sci. 2010;53(7):1345\u201357. https:\/\/doi.org\/10.1007\/s11432-010-3112-z.","journal-title":"Sci China Inf Sci"},{"issue":"2","key":"1180_CR14","doi-asserted-by":"publisher","first-page":"1201","DOI":"10.1007\/s10462-020-09874-x","volume":"54","author":"A Zubaroglu","year":"2021","unstructured":"Zubaroglu A, Atalay V. Data stream clustering: a review. Artif Intell Rev. 2021;54(2):1201\u201336. https:\/\/doi.org\/10.1007\/s10462-020-09874-x.","journal-title":"Artif Intell Rev"},{"key":"1180_CR15","unstructured":"Guha S, Mishra N, Motwani R, O\u2019Callaghan L. Clustering data streams. Proceedings 41st annual symposium on foundations of computer science. 2000; Pp. 359\u2013366."},{"key":"1180_CR16","doi-asserted-by":"crossref","unstructured":"Aggarwal CC, Yu PS, Han J, Wang J. A framework for clustering evolving data streams. In: Freytag JC, Lockemann P, Abiteboul S, Carey M, Selinger P, Heuer A, (EdS.) Proceedings 2003 VLDB conference. Morgan Kaufmann: San Francisco. 2003; 81\u201392.","DOI":"10.1016\/B978-012722442-8\/50016-1"},{"key":"1180_CR17","doi-asserted-by":"publisher","DOI":"10.1186\/s40537-019-0227-y","author":"H Asri","year":"2019","unstructured":"Asri H, Mousannif H, Al Moatassime H. Reality mining and predictive analytics for building smart applications. J Big Data. 2019. https:\/\/doi.org\/10.1186\/s40537-019-0227-y.","journal-title":"J Big Data"},{"key":"1180_CR18","doi-asserted-by":"publisher","DOI":"10.1186\/s40537-024-00951-4","author":"A Alqahtani","year":"2024","unstructured":"Alqahtani A, Alsubai S, Sha MHM, Dutta AK. Examining ALS: reformed PCA and random forest for effective detection of ALS. J Big Data. 2024. https:\/\/doi.org\/10.1186\/s40537-024-00951-4.","journal-title":"J Big Data"},{"key":"1180_CR19","doi-asserted-by":"publisher","DOI":"10.1186\/s40537-024-00977-8","author":"A Jahandoost","year":"2024","unstructured":"Jahandoost A, Torghabeh FA, Hosseini SA, Houshmand M. Crude oil price forecasting using K-means clustering and LSTM model enhanced by dense-sparse-dense strategy. J Big Data. 2024. https:\/\/doi.org\/10.1186\/s40537-024-00977-8.","journal-title":"J Big Data"},{"key":"1180_CR20","doi-asserted-by":"publisher","first-page":"80716","DOI":"10.1109\/access.2020.2988796","volume":"8","author":"KP Sinaga","year":"2020","unstructured":"Sinaga KP, Yang MS. Unsupervised k-means clustering algorithm. Ieee Access. 2020;8:80716\u201327. https:\/\/doi.org\/10.1109\/access.2020.2988796.","journal-title":"Ieee Access"},{"key":"1180_CR21","doi-asserted-by":"publisher","first-page":"67736","DOI":"10.1109\/access.2021.3077622","volume":"9","author":"KP Sinaga","year":"2021","unstructured":"Sinaga KP, Hussain I, Yang MS. Entropy k-means clustering with feature reduction under unknown number of clusters. Ieee Access. 2021;9:67736\u201351. https:\/\/doi.org\/10.1109\/access.2021.3077622.","journal-title":"Ieee Access"},{"key":"1180_CR22","doi-asserted-by":"publisher","DOI":"10.3390\/math10244720","author":"HN Abdulrazzak","year":"2022","unstructured":"Abdulrazzak HN, Hock GC, Radzi NAM, Tan NML, Kwong CF. Modeling and analysis of new hybrid clustering technique for vehicular ad hoc network. Mathematics. 2022. https:\/\/doi.org\/10.3390\/math10244720.","journal-title":"Mathematics"},{"key":"1180_CR23","doi-asserted-by":"publisher","DOI":"10.1186\/s40537-023-00709-4","author":"MS Mahmud","year":"2023","unstructured":"Mahmud MS, Huang JZ, Ruby R, Wu KS. An ensemble method for estimating the number of clusters in a big data set using multiple random samples. J Big Data. 2023. https:\/\/doi.org\/10.1186\/s40537-023-00709-4.","journal-title":"J Big Data"},{"issue":"1","key":"1180_CR24","first-page":"80","volume":"20","author":"Z Pan","year":"2011","unstructured":"Pan Z. Initialization algorithm of clustering using subsample for KD-tree. Comput Syst Appl. 2011;20(1):80\u20133.","journal-title":"Comput Syst Appl"},{"key":"1180_CR25","unstructured":"Zhang GY, Sha Y, He YJ. A new method for selecting initial cluster centers in k-means clustering algorithm. International conference on informational technology and environmental system science. 2008; 879\u2013883."},{"issue":"11","key":"1180_CR26","doi-asserted-by":"publisher","first-page":"1293","DOI":"10.1016\/j.patrec.2004.04.007","volume":"25","author":"SS Khan","year":"2004","unstructured":"Khan SS, Ahmad A. Cluster center initialization algorithm for k-means clustering. Pattern Recogn Lett. 2004;25(11):1293\u2013302. https:\/\/doi.org\/10.1016\/j.patrec.2004.04.007.","journal-title":"Pattern Recogn Lett"},{"key":"1180_CR27","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/j.knosys.2018.01.031","volume":"145","author":"G Zhang","year":"2018","unstructured":"Zhang G, Zhang CC, Zhang HY. Improved k-means algorithm based on density canopy. Knowl-Based Syst. 2018;145:289\u201397. https:\/\/doi.org\/10.1016\/j.knosys.2018.01.031.","journal-title":"Knowl-Based Syst"},{"issue":"11","key":"1180_CR28","doi-asserted-by":"publisher","first-page":"3698","DOI":"10.1016\/j.asoc.2012.07.021","volume":"12","author":"F Khan","year":"2012","unstructured":"Khan F. An initial seed selection algorithm for k-means clustering of georeferenced data to improve replicability of cluster assignments for mapping application. Appl Soft Comput. 2012;12(11):3698\u2013700. https:\/\/doi.org\/10.1016\/j.asoc.2012.07.021.","journal-title":"Appl Soft Comput"},{"key":"1180_CR29","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.neucom.2019.07.048","volume":"363","author":"EZ Zhu","year":"2019","unstructured":"Zhu EZ, Zhang YX, Wen P, Liu F. Fast and stable clustering analysis based on Grid-mapping k-means algorithm and new clustering validity index. Neurocomputing. 2019;363:149\u201370. https:\/\/doi.org\/10.1016\/j.neucom.2019.07.048.","journal-title":"Neurocomputing"},{"issue":"5","key":"1180_CR30","first-page":"1721","volume":"28","author":"X Shiyong","year":"2011","unstructured":"Shiyong X. Novel clustering algorithm based on grid and density. Appl Res Comput. 2011;28(5):1721.","journal-title":"Appl Res Comput"},{"key":"1180_CR31","doi-asserted-by":"publisher","DOI":"10.1186\/s40537-023-00798-1","author":"M Gul","year":"2023","unstructured":"Gul M, Rehman MA. Big data: an optimized approach for cluster initialization. J Big Data. 2023. https:\/\/doi.org\/10.1186\/s40537-023-00798-1.","journal-title":"J Big Data"},{"issue":"1","key":"1180_CR32","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/s11390-014-1416-y","volume":"29","author":"A Amini","year":"2014","unstructured":"Amini A, Teh YW, Saboohi H. On density-based data streams clustering algorithms: a survey. J Comput Sci Technol. 2014;29(1):116\u201341. https:\/\/doi.org\/10.1007\/s11390-014-1416-y.","journal-title":"J Comput Sci Technol"},{"issue":"1","key":"1180_CR33","first-page":"83","volume":"28","author":"NI Weiwei","year":"2007","unstructured":"Weiwei NI, Jieping LU, Geng C, Zhihui SUN. Efficient data stream clustering algorithm based on k-means partitioning and density. Mini Micro Syst. 2007;28(1):83\u20137.","journal-title":"Mini Micro Syst"},{"issue":"8","key":"1180_CR34","first-page":"125","volume":"45","author":"S Yin","year":"2020","unstructured":"Yin S, Wang T, Chen Q, Liu L, Yan S. Clustering of unknownbinary protocols BasedonK-means andAGNES. Fire Control Command Control. 2020;45(8):125.","journal-title":"Fire Control Command Control"},{"key":"1180_CR35","doi-asserted-by":"publisher","unstructured":"Sarris AL, Sidiropoulos E, Paraskevopoulos E, Bamidis P. Towards a digital twin in human brain: brain tumor detection using k-means. 33rd Medical Informatics Europe Conference (MIE)\u2014caring is sharing\u2014exploiting the value in data for health and innovation, 2023. https:\/\/doi.org\/10.3233\/shti230345.","DOI":"10.3233\/shti230345"},{"key":"1180_CR36","doi-asserted-by":"publisher","DOI":"10.1016\/j.energy.2024.132532","author":"J Xu","year":"2024","unstructured":"Xu J, Cui ZP, Ma SX, Wang XW, Zhang ZY, Zhang GX. Data based digital twin for operational performance optimization in CFB boilers. Energy. 2024. https:\/\/doi.org\/10.1016\/j.energy.2024.132532.","journal-title":"Energy"},{"key":"1180_CR37","unstructured":"Setssanjay G, Nagesh HS, Choudhary AN. MAFIA: Efficient and scalable subspace clustering for very large data sets, Technical Report CPDC-TR-9906-010, NorthwestUniversity. 1999."},{"issue":"6191","key":"1180_CR38","doi-asserted-by":"publisher","first-page":"1492","DOI":"10.1126\/science.1242072","volume":"344","author":"A Rodriguez","year":"2014","unstructured":"Rodriguez A, Laio A. Clustering by fast search and find of density peaks. Science. 2014;344(6191):1492\u20136. https:\/\/doi.org\/10.1126\/science.1242072.","journal-title":"Science"},{"issue":"S2","key":"1180_CR39","first-page":"403","volume":"44","author":"QY Xia","year":"2017","unstructured":"Xia QY. An algorithm for automatically selecting cluster centers based on density peaks and grids. Comput Sci. 2017;44(S2):403\u20136.","journal-title":"Comput Sci"},{"key":"1180_CR40","doi-asserted-by":"publisher","DOI":"10.1080\/03610917408548446","author":"T Calinski","year":"1974","unstructured":"Calinski T, Harabasz J. A dendrite method for cluster analysis. Comm Stats Simul Comp. 1974. https:\/\/doi.org\/10.1080\/03610917408548446.","journal-title":"Comm Stats Simul Comp"},{"issue":"7","key":"1180_CR41","doi-asserted-by":"publisher","first-page":"9277","DOI":"10.1007\/s12652-022-04428-1","volume":"14","author":"KK Pandey","year":"2023","unstructured":"Pandey KK, Shukla D. Cancer tissue detection from using improved k-means initialization method for multi\u2014dimensional microarray big data clustering. J Ambient Intell Humaniz Comput. 2023;14(7):9277\u2013303. https:\/\/doi.org\/10.1007\/s12652-022-04428-1.","journal-title":"J Ambient Intell Humaniz Comput"},{"issue":"2","key":"1180_CR42","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s12530-022-09447-z","volume":"14","author":"KK Pandey","year":"2023","unstructured":"Pandey KK, Shukla D. Min max kurtosis distance based improved initial centroid selection approach of k-means clustering for big data mining on gene expression data. Evol Syst. 2023;14(2):207\u201344. https:\/\/doi.org\/10.1007\/s12530-022-09447-z.","journal-title":"Evol Syst"},{"issue":"23","key":"1180_CR43","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/cpe.7185","volume":"34","author":"KK Pandey","year":"2022","unstructured":"Pandey KK, Shukla D. Min\u2013max kurtosis stratum mean: an improved k-means cluster initialization approach for microarray gene clustering on multi-dimensional big data. Concurr Comput Pract Exp. 2022;34(23):1\u201333. https:\/\/doi.org\/10.1002\/cpe.7185.","journal-title":"Concurr Comput Pract Exp"},{"issue":"1","key":"1180_CR44","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1108\/JAMR-07-2021-0242","volume":"20","author":"KK Pandey","year":"2023","unstructured":"Pandey KK, Shukla D. NDPD: an improved initial centroid method of partitional clustering for big data mining. J Adv Manag Res. 2023;20(1):1\u201334. https:\/\/doi.org\/10.1108\/JAMR-07-2021-0242.","journal-title":"J Adv Manag Res"},{"key":"1180_CR45","doi-asserted-by":"publisher","DOI":"10.24432\/C5861T","author":"N Helwig","year":"2016","unstructured":"Helwig N, Hsiao-Wecksler E. Multivariate gait data. UCI Mach Learn Repos. 2016. https:\/\/doi.org\/10.24432\/C5861T.","journal-title":"UCI Mach Learn Repos"},{"key":"1180_CR46","doi-asserted-by":"publisher","DOI":"10.4432\/C58K54","author":"G Hebrail","year":"2006","unstructured":"Hebrail G, Berard A. Individual household electric power consumption. UCI Mach Learn Repos. 2006. https:\/\/doi.org\/10.4432\/C58K54.","journal-title":"UCI Mach Learn Repos"},{"issue":"4","key":"1180_CR47","doi-asserted-by":"publisher","first-page":"1","DOI":"10.8637\/jss.v025.i04","volume":"25","author":"G Brock","year":"2008","unstructured":"Brock G, Pihur V, Datta S, Datta S. clvalid: an r package for cluster validation. J Stat Softw. 2008;25(4):1\u201322. https:\/\/doi.org\/10.8637\/jss.v025.i04.","journal-title":"J Stat Softw"},{"issue":"3","key":"1180_CR48","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1109\/TETC.2014.2330519","volume":"2","author":"A Fahad","year":"2014","unstructured":"Fahad A, Alshatri N, Tari Z, Alamri A, Khalil I, Zomaya AY. A survey of clustering algorithms for big data: taxonomy and empirical analysis. IEEE Trans Emerg Top Comput. 2014;2(3):267\u201379. https:\/\/doi.org\/10.1109\/TETC.2014.2330519.","journal-title":"IEEE Trans Emerg Top Comput"},{"issue":"2","key":"1180_CR49","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1109\/TPAMI.1979.4766909","volume":"1","author":"DL Davies","year":"1979","unstructured":"Davies DL, Bouldin DW. A cluster separation measure. IEEE Trans Pattern Anal Mach Intell. 1979;1(2):224\u20137. https:\/\/doi.org\/10.1109\/TPAMI.1979.4766909.","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"1180_CR50","doi-asserted-by":"publisher","first-page":"2837","DOI":"10.5555\/1756006.1953024","volume":"11","author":"NX Vinh","year":"2010","unstructured":"Vinh NX, Epps J, Bailey J. Information theoretic measures for clusterings comparison: variants, properties, normalization and correction for chance. J Mach Learn Res. 2010;11:2837\u201354. https:\/\/doi.org\/10.5555\/1756006.1953024.","journal-title":"J Mach Learn Res"},{"issue":"1","key":"1180_CR51","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF01908075","volume":"2","author":"H Lawrence","year":"1985","unstructured":"Lawrence H, Phipps A. Comparing partitions. J Classif. 1985;2(1):193\u2013218. https:\/\/doi.org\/10.1007\/BF01908075.","journal-title":"J Classif"},{"issue":"1","key":"1180_CR52","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/s10044-021-01045-0","volume":"25","author":"KK Pandey","year":"2022","unstructured":"Pandey KK, Shukla D. Maxmin distance sort heuristic-based initial centroid method of partitional clustering for big data mining. Pattern Anal Appl. 2022;25(1):139\u201356. https:\/\/doi.org\/10.1007\/s10044-021-01045-0.","journal-title":"Pattern Anal Appl"},{"issue":"9","key":"1180_CR53","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0137246","volume":"10","author":"WC Yeh","year":"2015","unstructured":"Yeh WC, Lai CM. Accelerated simplified swarm optimization with exploitation search scheme for data clustering. PLoS ONE. 2015;10(9): e0137246. https:\/\/doi.org\/10.1371\/journal.pone.0137246.","journal-title":"PLoS ONE"},{"key":"1180_CR54","first-page":"1","volume":"7","author":"J Dem\u0161ar","year":"2006","unstructured":"Dem\u0161ar J. Statistical comparisons of classifiers over multiple data sets. J Mach Learn Res. 2006;7:1\u201330.","journal-title":"J Mach Learn Res"},{"key":"1180_CR55","doi-asserted-by":"publisher","DOI":"10.1016\/j.jksuci.2020.12.013","author":"H Deeb","year":"2020","unstructured":"Deeb H, Sarangi A, Mishra D, Sarangi SK. Improved black hole optimization algorithm for data clustering. J King Saud Univ Comput Inf Sci. 2020. https:\/\/doi.org\/10.1016\/j.jksuci.2020.12.013.","journal-title":"J King Saud Univ Comput Inf Sci"},{"issue":"3","key":"1180_CR56","doi-asserted-by":"publisher","first-page":"1239","DOI":"10.1007\/s13198-021-01424-0","volume":"13","author":"KK Pandey","year":"2021","unstructured":"Pandey KK, Shukla D. Stratified linear systematic sampling based clustering approach for detection of financial risk group by mining of big data. Int J Syst Assur Eng Manag. 2021;13(3):1239\u201353. https:\/\/doi.org\/10.1007\/s13198-021-01424-0.","journal-title":"Int J Syst Assur Eng Manag"}],"container-title":["Journal of Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s40537-025-01180-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s40537-025-01180-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s40537-025-01180-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,23]],"date-time":"2025-05-23T07:06:08Z","timestamp":1747983968000},"score":1,"resource":{"primary":{"URL":"https:\/\/journalofbigdata.springeropen.com\/articles\/10.1186\/s40537-025-01180-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,23]]},"references-count":56,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["1180"],"URL":"https:\/\/doi.org\/10.1186\/s40537-025-01180-z","relation":{},"ISSN":["2196-1115"],"issn-type":[{"value":"2196-1115","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,5,23]]},"assertion":[{"value":"16 October 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 April 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 May 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":"\u201cNot applicable.\u201d For the current work, the authors have not conducted any animal or human trials.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"Not applicable. Individual data or information has not been included by the authors for the current work.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The authors declare no competing interests.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"130"}}