{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T20:21:38Z","timestamp":1767903698359,"version":"3.49.0"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,4,17]],"date-time":"2024-04-17T00:00:00Z","timestamp":1713312000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,4,17]],"date-time":"2024-04-17T00:00:00Z","timestamp":1713312000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004772","name":"Natural Science Foundation of Ningxia Province","doi-asserted-by":"publisher","award":["2022AAC02043"],"award-info":[{"award-number":["2022AAC02043"]}],"id":[{"id":"10.13039\/501100004772","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2024,8]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Data clustering has attracted the interest of scholars in many fields. In recent years, using heuristic algorithms to solve data clustering problems has gradually become a tendency. The black hole algorithm (BHA) is one of the popular heuristic algorithms among researchers because of its simplicity and effectiveness. In this paper, an improved self-adaptive logarithmic spiral path black hole algorithm (SLBHA) is proposed. SLBHA innovatively introduces a logarithmic spiral path and random vector path to BHA. At the same time, a parameter is used to control the randomness, which enhances the local exploitation ability of the algorithm. Besides, SLBHA designs a replacement mechanism to improve the global exploration ability. Finally, a self-adaptive parameter is introduced to control the replacement mechanism and maintain the balance between exploration and exploitation of the algorithm. To verify the effectiveness of the proposed algorithm, comparison experiments are conducted on 13 datasets creatively using the evaluation criteria including the Jaccard coefficient as well as the Folkes and Mallows index. The proposed methods are compared with the selected algorithms such as the whale optimization algorithm (WOA), compound intensified exploration firefly algorithm (CIEFA), improved black hole algorithm (IBH), etc. The experimental results demonstrate that the proposed algorithm outperforms the compared algorithms on both external criteria and quantization error of the clustering problem.<\/jats:p>","DOI":"10.1007\/s40747-024-01420-4","type":"journal-article","created":{"date-parts":[[2024,4,17]],"date-time":"2024-04-17T05:02:49Z","timestamp":1713330169000},"page":"5083-5106","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["An improved black hole algorithm designed for K-means clustering method"],"prefix":"10.1007","volume":"10","author":[{"given":"Chenyang","family":"Gao","sequence":"first","affiliation":[]},{"given":"Xin","family":"Yong","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2021-2097","authenticated-orcid":false,"given":"Yue-lin","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Teng","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,4,17]]},"reference":[{"key":"1420_CR1","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s40745-015-0040-1","volume":"2","author":"D Xu","year":"2015","unstructured":"Xu D, Tian Y (2015) A comprehensive survey of clustering algorithms. Ann Data Sci 2:165\u2013193. https:\/\/doi.org\/10.1007\/s40745-015-0040-1","journal-title":"Ann Data Sci"},{"key":"1420_CR2","doi-asserted-by":"publisher","first-page":"521","DOI":"10.11591\/ijeecs.v13.i2.pp521-526","volume":"13","author":"MZ Hossain","year":"2019","unstructured":"Hossain MZ, Akhtar MN, Ahmad RB et al (2019) A dynamic K-means clustering for data mining. Indonesian J Elect Eng Comput Sci 13:521\u2013526. https:\/\/doi.org\/10.11591\/ijeecs.v13.i2.pp521-526","journal-title":"Indonesian J Elect Eng Comput Sci"},{"key":"1420_CR3","doi-asserted-by":"publisher","first-page":"764","DOI":"10.1016\/j.procs.2015.06.090","volume":"54","author":"N Dhanachandra","year":"2015","unstructured":"Dhanachandra N, Manglem K, Chanu YJ (2015) Image segmentation using K-means clustering algorithm and subtractive clustering algorithm. Procedia Comput Sci 54:764\u2013771. https:\/\/doi.org\/10.1016\/j.procs.2015.06.090","journal-title":"Procedia Comput Sci"},{"key":"1420_CR4","doi-asserted-by":"publisher","first-page":"1033","DOI":"10.1038\/nmeth.3583","volume":"12","author":"C Wiwie","year":"2015","unstructured":"Wiwie C, Baumbach J, R\u00f6ttger R (2015) Comparing the performance of biomedical clustering methods. Nat Methods 12:1033\u20131038. https:\/\/doi.org\/10.1038\/nmeth.3583","journal-title":"Nat Methods"},{"key":"1420_CR5","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1109\/COMST.2016.2611524","volume":"19","author":"C Cooper","year":"2017","unstructured":"Cooper C, Franklin D, Ros M et al (2017) A comparative survey of VANET clustering techniques. IEEE Commun Surv Tutor 19:657\u2013681. https:\/\/doi.org\/10.1109\/COMST.2016.2611524","journal-title":"IEEE Commun Surv Tutor"},{"key":"1420_CR6","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1093\/comjnl\/41.8.578","volume":"41","author":"C Fraley","year":"1998","unstructured":"Fraley C, Raftery AE (1998) How many clusters? Which clustering method? Answers via model-based cluster analysis. Comput J 41:578\u2013588. https:\/\/doi.org\/10.1093\/comjnl\/41.8.578","journal-title":"Comput J"},{"key":"1420_CR7","doi-asserted-by":"publisher","first-page":"4","DOI":"10.9790\/3021-0204719725","volume":"2","author":"TS Madhulatha","year":"2012","unstructured":"Madhulatha TS (2012) An overview on clustering methods. IOSR J Eng 2:4","journal-title":"IOSR J Eng"},{"key":"1420_CR8","doi-asserted-by":"crossref","unstructured":"Rokach L, Maimo O (2005) Clustering methods. The data mining and knowledge discovery handbook","DOI":"10.1007\/b107408"},{"key":"1420_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.105763","volume":"84","author":"H Xie","year":"2019","unstructured":"Xie H, Zhang L, Lim CP et al (2019) Improving K-means clustering with enhanced Firefly Algorithms. Appl Soft Comput 84:105763. https:\/\/doi.org\/10.1016\/j.asoc.2019.105763","journal-title":"Appl Soft Comput"},{"key":"1420_CR10","doi-asserted-by":"publisher","first-page":"4081","DOI":"10.1007\/s00500-018-3057-5","volume":"23","author":"S Qiao","year":"2019","unstructured":"Qiao S, Zhou Y, Zhou Y et al (2019) A simple water cycle algorithm with percolation operator for clustering analysis. Soft Comput 23:4081\u20134095. https:\/\/doi.org\/10.1007\/s00500-018-3057-5","journal-title":"Soft Comput"},{"key":"1420_CR11","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1016\/j.eswa.2017.12.001","volume":"96","author":"SI Boushaki","year":"2018","unstructured":"Boushaki SI, Kamel N, Bendjeghaba O (2018) A new quantum chaotic cuckoo search algorithm for data clustering. Expert Syst Appl 96:358\u2013372. https:\/\/doi.org\/10.1016\/j.eswa.2017.12.001","journal-title":"Expert Syst Appl"},{"key":"1420_CR12","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1016\/j.asoc.2018.03.011","volume":"67","author":"A Bouyer","year":"2018","unstructured":"Bouyer A, Hatamlou A (2018) An efficient hybrid clustering method based on improved cuckoo optimization and modified particle swarm optimization algorithms. Appl Soft Comput 67:172\u2013182. https:\/\/doi.org\/10.1016\/j.asoc.2018.03.011","journal-title":"Appl Soft Comput"},{"key":"1420_CR13","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1016\/j.engappai.2010.10.001","volume":"24","author":"T Niknam","year":"2011","unstructured":"Niknam T, Fard ET, Pourjafarian N et al (2011) An efficient hybrid algorithm based on modified imperialist competitive algorithm and K-means for data clustering. Eng Appl Artif Intel 24:306\u2013317. https:\/\/doi.org\/10.1016\/j.engappai.2010.10.001","journal-title":"Eng Appl Artif Intel"},{"key":"1420_CR14","doi-asserted-by":"publisher","first-page":"4966","DOI":"10.1016\/j.eswa.2009.12.017","volume":"37","author":"J Xiao","year":"2010","unstructured":"Xiao J, Yan YP, Zhang J et al (2010) A quantum-inspired genetic algorithm for k-means clustering. Expert Syst Appl 37:4966\u20134973. https:\/\/doi.org\/10.1016\/j.eswa.2009.12.017","journal-title":"Expert Syst Appl"},{"key":"1420_CR15","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s12293-013-0110-x","volume":"5","author":"A Hatamlou","year":"2013","unstructured":"Hatamlou A, Hatamlou M (2013) PSOHS: an efficient two-stage approach for data clustering. Memetic Comp 5:155\u2013161. https:\/\/doi.org\/10.1007\/s12293-013-0110-x","journal-title":"Memetic Comp"},{"key":"1420_CR16","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.ins.2012.08.023","volume":"222","author":"A Hatamlou","year":"2013","unstructured":"Hatamlou A (2013) Black hole: a new heuristic optimization approach for data clustering. Inf Sci 222:175\u2013184. https:\/\/doi.org\/10.1016\/j.ins.2012.08.023","journal-title":"Inf Sci"},{"key":"1420_CR17","doi-asserted-by":"publisher","DOI":"10.1155\/2018\/2183214","author":"R Soto","year":"2018","unstructured":"Soto R, Crawford B, Olivares R et al (2018) Adaptive black hole algorithm for solving the set covering problem. Math Probl Eng. https:\/\/doi.org\/10.1155\/2018\/2183214","journal-title":"Math Probl Eng"},{"key":"1420_CR18","doi-asserted-by":"publisher","first-page":"8167","DOI":"10.1007\/s00500-017-2760-y","volume":"22","author":"A Hatamlou","year":"2018","unstructured":"Hatamlou A (2018) Solving travelling salesman problem using black hole algorithm. Soft Comput 22:8167\u20138175. https:\/\/doi.org\/10.1007\/s00500-017-2760-y","journal-title":"Soft Comput"},{"key":"1420_CR19","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.asoc.2017.03.002","volume":"56","author":"E Pashaei","year":"2017","unstructured":"Pashaei E, Aydin N (2017) Binary black hole algorithm for feature selection and classification on biological data. Appl Soft Comput 56:94\u2013106. https:\/\/doi.org\/10.1016\/j.asoc.2017.03.002","journal-title":"Appl Soft Comput"},{"key":"1420_CR20","doi-asserted-by":"publisher","unstructured":"Eskandarzadehalamdary M, Masoumi B, Sojodishijani O (2014) A new hybrid algorithm based on black hole optimization and bisecting k-means for cluster analysis. In: 2014 22nd Iranian Conference on Electrical Engineering (ICEE), 1075\u20131079. https:\/\/doi.org\/10.1109\/IranianCEE.2014.6999695","DOI":"10.1109\/IranianCEE.2014.6999695"},{"key":"1420_CR21","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1016\/j.ygeno.2018.04.004","volume":"111","author":"E Pashaei","year":"2019","unstructured":"Pashaei E, Pashaei E, Aydin N (2019) Gene selection using hybrid binary black hole algorithm and modified binary particle swarm optimization. Genomics 111:669\u2013686. https:\/\/doi.org\/10.1016\/j.ygeno.2018.04.004","journal-title":"Genomics"},{"key":"1420_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.jksuci.2020.12.013","author":"H Deeb","year":"2020","unstructured":"Deeb H, Sarangi A, Mishra D et al (2020) Improved Black Hole optimization algorithm for data clustering. J King Saud Univ Comput Inf Sci. https:\/\/doi.org\/10.1016\/j.jksuci.2020.12.013","journal-title":"J King Saud Univ Comput Inf Sci"},{"key":"1420_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-13-8676-3_35","author":"SS Pal","year":"2020","unstructured":"Pal SS, Pal S (2020) Black hole and k-means hybrid clustering algorithm. Computational intelligence in data mining. Adv Intell Syst Comput. https:\/\/doi.org\/10.1007\/978-981-13-8676-3_35","journal-title":"Adv Intell Syst Comput"},{"key":"1420_CR24","unstructured":"Khairi M S, Zuwairie I, Hamdan D et al (2016) A new hybrid gravitational search-black hole algorithm"},{"key":"1420_CR25","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1016\/10.1080\/18756891.2016.1204114","volume":"9","author":"S Yaghoobi","year":"2016","unstructured":"Yaghoobi S, Mojallali H (2016) Modified black hole algorithm with genetic operators. Int J Comput Intell Syst 9:652\u2013665. https:\/\/doi.org\/10.1016\/10.1080\/18756891.2016.1204114","journal-title":"Int J Comput Intell Syst"},{"key":"1420_CR26","doi-asserted-by":"publisher","DOI":"10.5013\/IJSSST.a.18.04.12","author":"S Mohammed","year":"2017","unstructured":"Mohammed S, Ibrahim Z, Daniyal H et al (2017) Improving the effectiveness of the black hole algorithm using a local search technique. Int J Simul Syst Sci Technol. https:\/\/doi.org\/10.5013\/IJSSST.a.18.04.12","journal-title":"Int J Simul Syst Sci Technol"},{"key":"1420_CR27","doi-asserted-by":"crossref","unstructured":"Ibrahim Z, Mohammed S, Subari N et al (2018) Black hole white hole algorithm with local search. 2018 International Conference on Artificial Life and Robotics (ICAROB2018)","DOI":"10.5954\/ICAROB.2018.GS10-3"},{"key":"1420_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-021-02980-5","author":"L Abualigah","year":"2022","unstructured":"Abualigah L, Elaziz MA, Sumari P et al (2022) Black hole algorithm: a comprehensive survey. Appl Intell. https:\/\/doi.org\/10.1007\/s10489-021-02980-5","journal-title":"Appl Intell"},{"key":"1420_CR29","doi-asserted-by":"publisher","first-page":"1455","DOI":"10.1016\/S0031-3203(99)00137-5","volume":"33","author":"U Maulik","year":"2000","unstructured":"Maulik U, Bandyopadhyay S (2000) Genetic algorithm-based clustering technique. Pattern Recognit 33:1455\u20131465. https:\/\/doi.org\/10.1016\/S0031-3203(99)00137-5","journal-title":"Pattern Recognit"},{"key":"1420_CR30","doi-asserted-by":"publisher","first-page":"1701","DOI":"10.1007\/s10115-019-01413-7","volume":"62","author":"M Fatahi","year":"2020","unstructured":"Fatahi M, Moradi S (2020) An FPA and GA-based hybrid evolutionary algorithm for analyzing clusters. Knowl Inf Syst 62:1701\u20131722. https:\/\/doi.org\/10.1007\/s10115-019-01413-7","journal-title":"Knowl Inf Syst"},{"key":"1420_CR31","doi-asserted-by":"publisher","unstructured":"D W van der M, A P E (2003) Data clustering using particle swarm optimization. The 2003 Congress on Evolutionary Computation, 1: 215\u2013220. https:\/\/doi.org\/10.1109\/CEC.2003.1299577","DOI":"10.1109\/CEC.2003.1299577"},{"key":"1420_CR32","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107924","volume":"113","author":"Y Li","year":"2021","unstructured":"Li Y, Chu X, Tian D et al (2021) Customer segmentation using K-means clustering and the adaptive particle swarm optimization algorithm. Appl Soft Comput 113:107924. https:\/\/doi.org\/10.1016\/j.asoc.2021.107924","journal-title":"Appl Soft Comput"},{"key":"1420_CR33","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.aca.2003.12.032","volume":"509","author":"PS Shelokar","year":"2004","unstructured":"Shelokar PS, Jayaraman VK, Kulkarni BD (2004) An ant colony approach for clustering. Anal Chim Acta 509:187\u2013195. https:\/\/doi.org\/10.1016\/j.aca.2003.12.032","journal-title":"Anal Chim Acta"},{"key":"1420_CR34","doi-asserted-by":"publisher","DOI":"10.3923\/jas.2008.2695.2702","author":"T Niknam","year":"2008","unstructured":"Niknam T, Olamaei J, Amiri B (2008) A hybrid evolutionary algorithm based on ACO and SA for cluster analysis. J Appl Sci. https:\/\/doi.org\/10.3923\/jas.2008.2695.2702","journal-title":"J Appl Sci"},{"key":"1420_CR35","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/j.asoc.2009.07.001","volume":"10","author":"T Niknam","year":"2010","unstructured":"Niknam T, Amiri B (2010) An efficient hybrid approach based on PSO, ACO and k-means for cluster analysis. Appl Soft Comput 10:183\u2013197. https:\/\/doi.org\/10.1016\/j.asoc.2009.07.001","journal-title":"Appl Soft Comput"},{"key":"1420_CR36","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.swevo.2012.02.003","volume":"6","author":"A Hatamlou","year":"2012","unstructured":"Hatamlou A, Abdullah S, Nezamabadi-pour H (2012) A combined approach for clustering based on K-means and gravitational search algorithms. Swarm Evol Comput 6:47\u201352. https:\/\/doi.org\/10.1016\/j.swevo.2012.02.003","journal-title":"Swarm Evol Comput"},{"key":"1420_CR37","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/j.engappai.2014.07.016","volume":"36","author":"MB Dowlatshahi","year":"2014","unstructured":"Dowlatshahi MB, Nezamabadi-pour H (2014) GGSA: a grouping gravitational search algorithm for data clustering. Eng Appl Artif Intell 36:114\u2013121. https:\/\/doi.org\/10.1016\/j.engappai.2014.07.016","journal-title":"Eng Appl Artif Intell"},{"key":"1420_CR38","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.engappai.2016.11.003","volume":"61","author":"XH Han","year":"2017","unstructured":"Han XH, Quan L, Xiong XY et al (2017) A novel data clustering algorithm based on modified gravitational search algorithm. Eng Appl Artif Intell 61:1\u20137. https:\/\/doi.org\/10.1016\/j.engappai.2016.11.003","journal-title":"Eng Appl Artif Intell"},{"key":"1420_CR39","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1016\/j.swevo.2011.06.003","volume":"1","author":"J Senthilnath","year":"2011","unstructured":"Senthilnath J, Omkar SN, Mani V (2011) Clustering using firefly algorithm: performance study. Swarm Evol Comput 1:164\u2013171. https:\/\/doi.org\/10.1016\/j.swevo.2011.06.003","journal-title":"Swarm Evol Comput"},{"key":"1420_CR40","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1016\/j.asoc.2018.05.045","volume":"70","author":"D Pranesh","year":"2018","unstructured":"Pranesh D, Dushmanta KD, Shouvik D (2018) A modified Bee Colony Optimization (MBCO) and its hybridization with k-means for an application to data clustering. Appl Soft Comput 70:590\u2013603. https:\/\/doi.org\/10.1016\/j.asoc.2018.05.045","journal-title":"Appl Soft Comput"},{"key":"1420_CR41","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1016\/j.knosys.2018.09.013","volume":"163","author":"Y Zhou","year":"2019","unstructured":"Zhou Y, Wu H, Luo Q et al (2019) Automatic data clustering using nature-inspired symbiotic organism search algorithm. Knowl Inf Syst 163:546\u2013557. https:\/\/doi.org\/10.1016\/j.knosys.2018.09.013","journal-title":"Knowl Inf Syst"},{"key":"1420_CR42","doi-asserted-by":"publisher","first-page":"8867","DOI":"10.1007\/s00500-022-07780-8","volume":"27","author":"MA Tawhid","year":"2023","unstructured":"Tawhid MA, Ibrahim AM (2023) An efficient hybrid swarm intelligence optimization algorithm for solving nonlinear systems and clustering problems. Soft Comput 27:8867\u20138895. https:\/\/doi.org\/10.1007\/s00500-022-07780-8","journal-title":"Soft Comput"},{"key":"1420_CR43","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2021.107543","volume":"233","author":"S Chakraborty","year":"2021","unstructured":"Chakraborty S, Saha AK, Chakraborty R et al (2021) An enhanced whale optimization algorithm for large scale optimization problems. Knowl Based Syst 233:107543. https:\/\/doi.org\/10.1016\/j.knosys.2021.107543","journal-title":"Knowl Based Syst"},{"key":"1420_CR44","doi-asserted-by":"publisher","first-page":"458","DOI":"10.3390\/sym14030458","volume":"14","author":"KH Almotairi","year":"2022","unstructured":"Almotairi KH, Abualigah L (2022) Hybrid reptile search algorithm and remora optimization algorithm for optimization tasks and data clustering. Symmetry 14:458. https:\/\/doi.org\/10.3390\/sym14030458","journal-title":"Symmetry"},{"key":"1420_CR45","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.advengsoft.2016.01.008","volume":"95","author":"S Mirjalili","year":"2016","unstructured":"Mirjalili S, Lewis A (2016) The whale optimization algorithm. Adv Eng Softw 95:51\u201367. https:\/\/doi.org\/10.1016\/j.advengsoft.2016.01.008","journal-title":"Adv Eng Softw"},{"key":"1420_CR46","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113340","volume":"149","author":"J Wu","year":"2020","unstructured":"Wu J, Wang YG, Burrage K et al (2020) An improved firefly algorithm for global continuous optimization problems. Expert Syst Appl 149:113340. https:\/\/doi.org\/10.1016\/j.eswa.2020.113340","journal-title":"Expert Syst Appl"},{"key":"1420_CR47","doi-asserted-by":"publisher","unstructured":"Sharma S, Kumar S, Nayyar A (2019) Logarithmic Spiral Based Local Search in Artificial Bee Colony Algorithm. Industrial Networks and Intelligent Systems. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, 257. https:\/\/doi.org\/10.1007\/978-3-030-05873-9_2","DOI":"10.1007\/978-3-030-05873-9_2"},{"key":"1420_CR48","doi-asserted-by":"publisher","unstructured":"Kapoor A, Singhal A (2017) A comparative study of K-Means, K-Means++ and Fuzzy C-Means clustering algorithms, 2017 3rd International Conference on Computational Intelligence & Communication Technology (CICT), 1\u20136. https:\/\/doi.org\/10.1109\/CIACT.2017.7977272","DOI":"10.1109\/CIACT.2017.7977272"},{"key":"1420_CR49","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.118656","volume":"211","author":"M Ay","year":"2023","unstructured":"Ay M, \u00d6zbak\u0131r L, Kulluk S et al (2023) FC-Kmeans: fixed-centered K-means algorithm. Expert Syst Appl 211:118656. https:\/\/doi.org\/10.1016\/j.eswa.2022.118656","journal-title":"Expert Syst Appl"},{"key":"1420_CR50","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1016\/j.asoc.2009.12.025","volume":"11","author":"D Karaboga","year":"2011","unstructured":"Karaboga D, Ozturk C (2011) A novel clustering approach: Artificial Bee Colony (ABC) algorithm. Appl Soft Comput 11:652\u2013657. https:\/\/doi.org\/10.1016\/j.asoc.2009.12.025","journal-title":"Appl Soft Comput"},{"key":"1420_CR51","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/j.amc.2009.03.090","volume":"214","author":"D Karaboga","year":"2009","unstructured":"Karaboga D, Akay B (2009) A comparative study of Artificial Bee Colony algorithm. Appl Math Comput 214:108\u2013132. https:\/\/doi.org\/10.1016\/j.amc.2009.03.090","journal-title":"Appl Math Comput"},{"key":"1420_CR52","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/25742558.2018.1483565","volume":"5","author":"N Nasiri","year":"2018","unstructured":"Nasiri N, Khiyabani FM, Yoshise A (2018) A whale optimization algorithm (WOA) approach for clustering. Cogent Math Stat 5:1. https:\/\/doi.org\/10.1080\/25742558.2018.1483565","journal-title":"Cogent Math Stat"},{"key":"1420_CR53","doi-asserted-by":"publisher","first-page":"3117","DOI":"10.1109\/JSYST.2019.2960088","volume":"14","author":"X Chen","year":"2020","unstructured":"Chen X, Cheng L, Liu C et al (2020) A WOA-based optimization approach for task scheduling in cloud computing systems. IEEE Syst J 14:3117\u20133128. https:\/\/doi.org\/10.1109\/JSYST.2019.2960088","journal-title":"IEEE Syst J"},{"key":"1420_CR54","unstructured":"Dua D, Graff C (2019) UCI Machine Learning Repository [http:\/\/archive.ics.uci.edu\/ml]. Irvine, CA: University of California, School of Information and Computer Science."},{"key":"1420_CR55","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1023\/A:1012801612483","volume":"17","author":"M Halkidi","year":"2001","unstructured":"Halkidi M, Batistakis Y, Vazirgiannis M (2001) On clustering validation techniques. Int J Intell Syst 17:107\u2013145. https:\/\/doi.org\/10.1023\/A:1012801612483","journal-title":"Int J Intell Syst"},{"key":"1420_CR56","doi-asserted-by":"publisher","first-page":"664","DOI":"10.1016\/j.neucom.2017.06.053","volume":"267","author":"A Saxena","year":"2017","unstructured":"Saxena A, Prasad M, Gupta A et al (2017) A review of clustering techniques and developments. Neurocomputing 267:664\u2013681. https:\/\/doi.org\/10.1016\/j.neucom.2017.06.053","journal-title":"Neurocomputing"},{"key":"1420_CR57","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106628","volume":"147","author":"A Ibrahim","year":"2020","unstructured":"Ibrahim A, Maria H, Hossam F et al (2020) A dynamic locality multi-objective salp swarm algorithm for feature selection. Comput Ind Eng 147:106628. https:\/\/doi.org\/10.1016\/j.cie.2020.106628","journal-title":"Comput Ind Eng"},{"key":"1420_CR58","doi-asserted-by":"publisher","first-page":"3462","DOI":"10.1007\/s10489-018-1158-6","volume":"48","author":"GI Sayed","year":"2018","unstructured":"Sayed GI, Khoriba G, Haggag MH (2018) A novel chaotic salp swarm algorithm for global optimization and feature selection. Appl Intell 48:3462\u20133481. https:\/\/doi.org\/10.1007\/s10489-018-1158-6","journal-title":"Appl Intell"}],"container-title":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-024-01420-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-024-01420-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-024-01420-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,17]],"date-time":"2024-07-17T17:20:57Z","timestamp":1721236857000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-024-01420-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,17]]},"references-count":58,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,8]]}},"alternative-id":["1420"],"URL":"https:\/\/doi.org\/10.1007\/s40747-024-01420-4","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4,17]]},"assertion":[{"value":"30 May 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 March 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 April 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that there are no conflict of interests, we do not have any possible conflicts of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}