{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T16:44:25Z","timestamp":1764175465232},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,7,25]],"date-time":"2023-07-25T00:00:00Z","timestamp":1690243200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,7,25]],"date-time":"2023-07-25T00:00:00Z","timestamp":1690243200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2024,1]]},"DOI":"10.1007\/s11227-023-05508-5","type":"journal-article","created":{"date-parts":[[2023,7,25]],"date-time":"2023-07-25T17:02:02Z","timestamp":1690304522000},"page":"1990-2024","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["DG-means: a superior greedy algorithm for clustering distributed data"],"prefix":"10.1007","volume":"80","author":[{"given":"Ramzi A.","family":"Haraty","sequence":"first","affiliation":[]},{"given":"Ali","family":"Assaf","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,7,25]]},"reference":[{"key":"5508_CR1","doi-asserted-by":"publisher","first-page":"115549","DOI":"10.1016\/j.apenergy.2020.115549","volume":"277","author":"W Yi","year":"2020","unstructured":"Yi W, Yan J (2020) Energy consumption and emission influences from shared mobility in China: a national annual data analysis. Appl Energy 277:115549","journal-title":"Appl Energy"},{"key":"5508_CR2","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1016\/j.renene.2019.09.005","volume":"147","author":"SG Anton","year":"2020","unstructured":"Anton SG, Afloarei Nucu AE (2020) The effect of financial development on renewable energy consumption. A panel data approach. Renew Energy 147:330\u2013338","journal-title":"Renew Energy"},{"issue":"8","key":"5508_CR3","doi-asserted-by":"publisher","first-page":"3140","DOI":"10.3390\/su12083140","volume":"12","author":"P Pei","year":"2020","unstructured":"Pei P, Huo Z, Mart\u0131nez OS, Crespo RG (2020) Minimal green energy consumption and workload management for data centers on smart city platforms. Sustainability 12(8):3140","journal-title":"Sustainability"},{"key":"5508_CR4","doi-asserted-by":"crossref","unstructured":"Enokido T, Takizawa M (2020) The power consumption model of a server to perform data access application processes in virtual machine environments, advanced information networking, and applications. In: Proceedings of the International Conference on Advanced Information Networking and Applications. Springer, Toronto, pp 184\u2013192","DOI":"10.1007\/978-3-030-44041-1_17"},{"issue":"1","key":"5508_CR5","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1109\/TC.2020.2974461","volume":"70","author":"Q Zhou","year":"2020","unstructured":"Zhou Q, Guo S, Lu H (2020) Falcon: addressing stragglers in heterogeneous parameter server via multiple parallelisms. IEEE Trans Comput 70(1):139\u2013155","journal-title":"IEEE Trans Comput"},{"key":"5508_CR6","doi-asserted-by":"publisher","first-page":"107633","DOI":"10.1016\/j.cpc.2020.107633","volume":"259","author":"KG Miller","year":"2021","unstructured":"Miller KG, Lee RP, Tableman A et al (2021) Dynamic load balancing with enhanced shared-memory parallelism for particle-in-cell codes. Comput Phys Commun 259:107633","journal-title":"Comput Phys Commun"},{"key":"5508_CR7","doi-asserted-by":"publisher","first-page":"80716","DOI":"10.1109\/ACCESS.2020.2988796","volume":"8","author":"KP Sinaga","year":"2020","unstructured":"Sinaga KP, Yang M-S (2020) Unsupervised k-means clustering algorithm. IEEE Access 8:80716\u201380727","journal-title":"IEEE Access"},{"issue":"6","key":"5508_CR8","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1038\/nmeth.4299","volume":"14","author":"N Altman","year":"2017","unstructured":"Altman N, Krzywinski M (2017) Points of significance: clustering. J Nat Methods 14(6):545\u2013546","journal-title":"J Nat Methods"},{"issue":"2","key":"5508_CR9","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/s12652-017-0660-8","volume":"10","author":"M Wu","year":"2018","unstructured":"Wu M, Li X, Liu C et al (2018) Robust global motion estimation for video security based on improved k-means clustering. J Amb Intell Hum Comput 10(2):439\u2013448","journal-title":"J Amb Intell Hum Comput"},{"key":"5508_CR10","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.bdr.2017.09.002","volume":"11","author":"B Lorbeer","year":"2018","unstructured":"Lorbeer B, Kosareva A, Deva B et al (2018) Variations on the clustering algorithm. BIRCH J Big Data Res 11:44\u201353","journal-title":"BIRCH J Big Data Res"},{"key":"5508_CR11","unstructured":"Chauhan NS (2022) DBSCAN clustering algorithm in machine learning. In: Kdnuggets, p 4. https:\/\/www.kdnuggets.com\/dbscan-clustering-algorithm-in-machine-learning.html\/"},{"key":"5508_CR12","doi-asserted-by":"crossref","unstructured":"Bureva V, Sotirova E, Popov S et al (2017) Generalized net of cluster analysis process using STING: a statistical information grid approach to spatial data mining. In: International Conference on Flexible Query Answering Systems. University of Westminster, London, pp 239\u2013248","DOI":"10.1007\/978-3-319-59692-1_21"},{"key":"5508_CR13","unstructured":"Guha S, Rastogi R, Shim K (eds) Cure: an efficient clustering algorithm for large databases. In: Proceedings from ACM SIGMOD International Conference on Management of Data, Snowbird"},{"key":"5508_CR14","unstructured":"MacQueen J (1967) Some methods for classification and analysis of multivariate observations. In: Proceedings from the Fifth Berkeley Symposium on Mathematical Statistics and Probability, Berkeley"},{"key":"5508_CR15","first-page":"585","volume":"7","author":"L Bottou","year":"1995","unstructured":"Bottou L, Bengio Y (1995) Convergence properties of the k-means algorithm. Adv Neural Inf Process Syst 7:585\u2013592","journal-title":"Adv Neural Inf Process Syst"},{"key":"5508_CR16","doi-asserted-by":"crossref","unstructured":"Parthasarathy S, Ogihara M (2000) Clustering distributed homogeneous datasets. In: Proceedings from the Fourth European Conference on Principles of Data Mining and Knowledge Discovery. Springer, London","DOI":"10.1007\/3-540-45372-5_67"},{"issue":"2","key":"5508_CR17","first-page":"1","volume":"22","author":"AK Sangaiah","year":"2019","unstructured":"Sangaiah AK, Fakhry AE, Abdel-Basset M (2019) Arabic text clustering using improved clustering algorithms with dimensionality reduction. Clust Comput 22(2):1\u201315","journal-title":"Clust Comput"},{"issue":"2","key":"5508_CR18","first-page":"459","volume":"125","author":"S Soukaina Mjahed","year":"2020","unstructured":"Soukaina Mjahed S, Bouzaachane K, Taher Azar A, El Hadaj S, Raghay S (2020) Hybridization of fuzzy and hard semi-supervised clustering algorithms tuned with ant lion optimizer applied to Higgs boson search. Comput Model Eng Sci 125(2):459\u2013494","journal-title":"Comput Model Eng Sci"},{"issue":"10","key":"5508_CR19","first-page":"1","volume":"13","author":"JJ Jay","year":"2012","unstructured":"Jay JJ, Eblen J, Zhang Y (2012) A systematic comparison of genome-scale clustering algorithms. BMC Bioinf 13(10):1\u201312","journal-title":"BMC Bioinf"},{"key":"5508_CR20","first-page":"1","volume":"9","author":"MS Yang","year":"2019","unstructured":"Yang MS, Sinaga KP (2019) A feature-reduction multi-view k-means clustering algorithm. IEEE Access 9:1","journal-title":"IEEE Access"},{"issue":"10","key":"5508_CR21","first-page":"177","volume":"9","author":"J Song","year":"2015","unstructured":"Song J, Li X, Liu Y (2015) An optimized k-means algorithm for selecting initial clustering centers. Int J Secur Appl 9(10):177\u2013186","journal-title":"Int J Secur Appl"},{"key":"5508_CR22","doi-asserted-by":"publisher","first-page":"337","DOI":"10.4028\/www.scientific.net\/AMR.1022.337","volume":"1022","author":"HB Zhou","year":"2014","unstructured":"Zhou HB, Gao JT (2014) An improved initial clustering center selection method for k-means algorithm. Adv Mater Res 1022:337\u2013340","journal-title":"Adv Mater Res"},{"key":"5508_CR23","doi-asserted-by":"crossref","unstructured":"Haraty R, Dimishkieh M, Masud M (2015) An enhanced k-means clustering algorithm for pattern discovery in healthcare data","DOI":"10.1155\/2015\/615740"},{"key":"5508_CR24","first-page":"25","volume-title":"Survey of clustering data mining techniques","author":"P Berkhin","year":"2006","unstructured":"Berkhin P (2006) Survey of clustering data mining techniques. Grouping Multidimensional Data, Sunnyvale, pp 25\u201371"},{"key":"5508_CR25","unstructured":"Samatova F, Ostrouchov G, Geist A, Melechko A (2002) RACHET: an efficient cover-based merging of clustering hierarchies from distributed datasets, TN, United States"},{"key":"5508_CR26","unstructured":"Hess T, Moshkovitz M, Sabato S (2021) A constant approximation algorithm for sequential no-substitution k-median clustering under a random arrival order. arXiv preprint arXiv:2102.04050"},{"issue":"02","key":"5508_CR27","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1109\/CC.2017.7868161","volume":"14","author":"JE Judith","year":"2017","unstructured":"Judith JE, Jayakumari J (2017) Distributed document clustering analysis based on a hybrid method. China Commun 14(02):131\u2013142","journal-title":"China Commun"},{"key":"5508_CR28","unstructured":"Eberhart RC, Kennedy J (1995) A new optimizer using particle swarm theory. In: Proceedings of the 6th international symposium on micro machine and human science, Nagoya, Japan, pp 39\u201343"},{"key":"5508_CR29","unstructured":"van den Bergh F (2001) An analysis of particle swarm optimizers. Ph.D. dissertation, University of Pretoria, Pretoria, South Africa"},{"issue":"01","key":"5508_CR30","first-page":"155","volume":"40","author":"X Xie","year":"2018","unstructured":"Xie X, Li X, Mo L (2018) Microblog public opinion analysis based on improved k-means algorithm. Comput Eng Sci 40(01):155\u2013158","journal-title":"Comput Eng Sci"},{"key":"5508_CR31","doi-asserted-by":"crossref","unstructured":"Vaidya J, Clifton C (2003) Privacy-preserving k-means clustering over vertically partitioned data. In: Proceedings of ACM SIGKDD03, pp 206\u2013215","DOI":"10.1145\/775047.775142"},{"issue":"1","key":"5508_CR32","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/s10115-004-0148-7","volume":"8","author":"X Lin","year":"2005","unstructured":"Lin X, Clifton C, Zhu M (2005) Privacy-preserving clustering with distributed em mixture modeling. Knowl Inf Syst 8(1):68\u201381","journal-title":"Knowl Inf Syst"},{"issue":"8","key":"5508_CR33","doi-asserted-by":"publisher","first-page":"1145","DOI":"10.3390\/e24081145.PMID:36010809;PMCID:PMC9407146","volume":"24","author":"W Wei","year":"2022","unstructured":"Wei W, Tang C, Chen Y (2022) Efficient privacy-preserving K-means clustering from secret-sharing-based secure three-party computation. Entropy (Basel) 24(8):1145. https:\/\/doi.org\/10.3390\/e24081145.PMID:36010809;PMCID:PMC9407146","journal-title":"Entropy (Basel)"},{"issue":"3","key":"5508_CR34","first-page":"675","volume":"35","author":"B Wang","year":"2018","unstructured":"Wang B, Yu X (2018) Parallel k-means clustering algorithm for adaptive cuckoo search. Comput Appl Res 35(3):675\u2013679","journal-title":"Comput Appl Res"},{"key":"5508_CR35","volume-title":"Nature-inspired metaheuristic algorithms","author":"X-S Yang","year":"2008","unstructured":"Yang X-S (2008) Nature-inspired metaheuristic algorithms. Luniver Press"},{"key":"5508_CR36","unstructured":"Xin-She Y, Deb S (2009) Cuckoo search via l\u00e9vy flights. World Congress Nat Biol Inspired Comput"},{"key":"5508_CR37","doi-asserted-by":"crossref","unstructured":"Cobos C et al (2014) Clustering of web search results based on the cuckoo search algorithm and balanced bayesian information criterion","DOI":"10.1109\/IFSA-NAFIPS.2013.6608452"},{"key":"5508_CR38","first-page":"916","volume":"2011","author":"S Goel","year":"2011","unstructured":"Goel S, Sharma A, Bedi P (2011) Cuckoo search clustering algorithm: a novel strategy of biomimicry. World Congress Inf Commun Technol 2011:916\u2013921","journal-title":"World Congress Inf Commun Technol"},{"key":"5508_CR39","doi-asserted-by":"crossref","unstructured":"Senthilnath J, Das V, Omkar SN, Mani V (2012) Clustering using levy flight cuckoo search. In: Bansal JC, Singh P, Deep K, Pant M, Nagar A (eds) Proceedings of Seventh International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA, 2012), Springer, India","DOI":"10.1007\/978-81-322-1041-2_6"},{"key":"5508_CR40","doi-asserted-by":"crossref","unstructured":"Nguyen QH, Ong YS, Krasnogor N (2007) A study on the design issues of memetic algorithm. In: IEEE Congress on Evolutionary Computation","DOI":"10.1109\/CEC.2007.4424770"},{"key":"5508_CR41","doi-asserted-by":"publisher","DOI":"10.1002\/0471739383","volume-title":"Parallel metaheuristics: a new class of algorithms","author":"E Alba","year":"2005","unstructured":"Alba E (2005) Parallel metaheuristics: a new class of algorithms. Wiley-Interscience"},{"key":"5508_CR42","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1109\/TEVC.2002.800880","volume":"6","author":"E Alba","year":"2002","unstructured":"Alba E, Tomassini M (2002) Parallelism and evolutionary algorithms. IEEE Trans Evol Comput 6:443\u2013462","journal-title":"IEEE Trans Evol Comput"},{"key":"5508_CR43","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22084-5","volume-title":"Parallel Genetic algorithms: theory and real world applications","author":"G Luque","year":"2011","unstructured":"Luque G, Alba E (2011) Parallel Genetic algorithms: theory and real world applications. Springer, Berlin"},{"key":"5508_CR44","doi-asserted-by":"publisher","unstructured":"Boushaki SI, Bendjeghaba O, Brakta N (2021) Document clustering analysis based on hybrid cuckoo search and K-means algorithm. In: IEEE 12th Annual Information Technology, Electronics and Mobile Communication Conference (IEMCON), Vancouver, pp 0058\u20130062. https:\/\/doi.org\/10.1109\/IEMCON53756.2021.9623204","DOI":"10.1109\/IEMCON53756.2021.9623204"},{"issue":"20","key":"5508_CR45","doi-asserted-by":"publisher","first-page":"e41091","DOI":"10.1002\/cpe.4109","volume":"29","author":"Z Tang","year":"2017","unstructured":"Tang Z, Liu K, Xiao J et al (2017) A parallel k-means clustering algorithm based on redundancy elimination and extreme points optimization employing MapReduce. Concurr Comput 29(20):e41091\u2013e410918","journal-title":"Concurr Comput"},{"key":"5508_CR46","doi-asserted-by":"publisher","first-page":"377","DOI":"10.3390\/axioms11080377","volume":"11","author":"J P\u00e9rez-Ortega","year":"2022","unstructured":"P\u00e9rez-Ortega J, Roblero-Aguilar SS, Almanza-Ortega NN, Frausto Sol\u00eds J, Zavala-D\u00edaz C, Hern\u00e1ndez Y, Landero-N\u00e1jera V (2022) Hybrid fuzzy C-means clustering algorithm oriented to big data realms. Axioms 11:377. https:\/\/doi.org\/10.3390\/axioms11080377","journal-title":"Axioms"},{"key":"5508_CR47","unstructured":"Sobeh S (2023) A survey of clustering algorithms. Master\u2019s Thesis. Lebanese American University, Beirut"},{"key":"5508_CR48","unstructured":"Zaharia M et al (2012) Resilient distributed datasets: a fault-tolerant abstraction for in-memory cluster computing. In: Proceedings of the 9th USENIX Conference on Networked Systems Design and Implementation. USENIX Association"},{"key":"5508_CR49","volume-title":"Hadoop: the definitive guide","author":"T White","year":"2011","unstructured":"White T (2011) Hadoop: the definitive guide. O\u2019Reilly Media"},{"key":"5508_CR50","unstructured":"Zaharia M (2014) An architecture for fast and general data processing on large clusters. Technical Report UCB\/EECS-2014-12. University of California, Berkeley"},{"key":"5508_CR51","unstructured":"Kakde HM (2022) Range searching using Kd tree\u201d (Online). http:\/\/www.cs.utah.edu\/lifeifei\/cs6931\/kdtree.pdf. Retrieved December 28, 2022"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-023-05508-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-023-05508-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-023-05508-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,15]],"date-time":"2024-01-15T09:25:12Z","timestamp":1705310712000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-023-05508-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,25]]},"references-count":51,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,1]]}},"alternative-id":["5508"],"URL":"https:\/\/doi.org\/10.1007\/s11227-023-05508-5","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7,25]]},"assertion":[{"value":"16 June 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 July 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"There are no conflict of interest in this work.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}