{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T10:58:54Z","timestamp":1774522734769,"version":"3.50.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T00:00:00Z","timestamp":1771286400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T00:00:00Z","timestamp":1771286400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"JST SPRING","award":["JPMJSP2119"],"award-info":[{"award-number":["JPMJSP2119"]}]},{"name":"JSPS KAKENHI","award":["21A402"],"award-info":[{"award-number":["21A402"]}]},{"DOI":"10.13039\/501100001691","name":"KAKENHI","doi-asserted-by":"crossref","award":["24K15098"],"award-info":[{"award-number":["24K15098"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Mach. Learn. & Cyber."],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1007\/s13042-025-02933-1","type":"journal-article","created":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T11:33:08Z","timestamp":1771327988000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["K-means competitive swarm optimizer: performance benchmarking and application in brain tumor detection"],"prefix":"10.1007","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-8394-1474","authenticated-orcid":false,"given":"Yang","family":"Cao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-5271-2298","authenticated-orcid":false,"given":"Zhongmin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-3117-6083","authenticated-orcid":false,"given":"Xingbang","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5029-0294","authenticated-orcid":false,"given":"Jun","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4605-5579","authenticated-orcid":false,"given":"Rui","family":"Zhong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5750-9217","authenticated-orcid":false,"given":"Masaharu","family":"Munetomo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,17]]},"reference":[{"issue":"11","key":"2933_CR1","doi-asserted-by":"publisher","first-page":"13187","DOI":"10.1007\/s10462-023-10470-y","volume":"56","author":"K Rajwar","year":"2023","unstructured":"Rajwar K, Deep K, Das S (2023) An exhaustive review of the metaheuristic algorithms for search and optimization: taxonomy, applications, and open challenges. Artif Intell Rev 56(11):13187\u201313257. https:\/\/doi.org\/10.1007\/s10462-023-10470-y","journal-title":"Artif Intell Rev"},{"key":"2933_CR2","doi-asserted-by":"publisher","first-page":"106304","DOI":"10.1016\/j.cor.2023.106304","volume":"158","author":"AM Fathollahi-Fard","year":"2023","unstructured":"Fathollahi-Fard AM, Tian G, Ke H, Fu Y, Wong KY (2023) Efficient multi-objective metaheuristic algorithm for sustainable harvest planning problem. Comput Opera Res 158:106304. https:\/\/doi.org\/10.1016\/j.cor.2023.106304","journal-title":"Comput Opera Res"},{"key":"2933_CR3","doi-asserted-by":"publisher","first-page":"124857","DOI":"10.1016\/j.eswa.2024.124857","volume":"255","author":"G Li","year":"2024","unstructured":"Li G, Zhang T, Tsai C-Y, Yao L, Lu Y, Tang J (2024) Review of the metaheuristic algorithms in applications: visual analysis based on bibliometrics. Expert Syst Appl 255:124857. https:\/\/doi.org\/10.1016\/j.eswa.2024.124857","journal-title":"Expert Syst Appl"},{"key":"2933_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2024.112524","author":"E Fernandez","year":"2024","unstructured":"Fernandez E, Zarate G, Cruz-Reyes L, Espin-Andrade R, Gomez-Santillan C, Rangel-Valdez N (2024) Aiding decision makers in articulating a preference closeness model through compensatory fuzzy logic for many-objective optimization problems. Knowl Based Syst. https:\/\/doi.org\/10.1016\/j.knosys.2024.112524","journal-title":"Knowl Based Syst"},{"key":"2933_CR5","doi-asserted-by":"publisher","first-page":"100559","DOI":"10.1016\/j.cosrev.2023.100559","volume":"49","author":"M Nssibi","year":"2023","unstructured":"Nssibi M, Manita G, Korbaa O (2023) Advances in nature-inspired metaheuristic optimization for feature selection problem: a comprehensive survey. Comput Sci Rev 49:100559. https:\/\/doi.org\/10.1016\/j.cosrev.2023.100559","journal-title":"Comput Sci Rev"},{"key":"2933_CR6","doi-asserted-by":"publisher","unstructured":"Cao Y, Zhong R, Yu J, Munetomo M (2024) Optimization of electricity consumption forecasting models via hyper-heuristic algorithm. In: 2024 6th International conference on data-driven optimization of complex systems (DOCS), pp 114\u2013120. https:\/\/doi.org\/10.1109\/DOCS63458.2024.10704338","DOI":"10.1109\/DOCS63458.2024.10704338"},{"key":"2933_CR7","doi-asserted-by":"publisher","first-page":"112345","DOI":"10.1016\/j.knosys.2024.112345","volume":"301","author":"H Nematzadeh","year":"2024","unstructured":"Nematzadeh H, Garc\u00eda-Nieto J, Delgado IN, Montes JA (2024) Feature selection using a classification error impurity algorithm and an adaptive genetic algorithm improved with an external repository. Knowl Based Syst 301:112345. https:\/\/doi.org\/10.1016\/j.knosys.2024.112345","journal-title":"Knowl Based Syst"},{"issue":"4","key":"2933_CR8","doi-asserted-by":"publisher","first-page":"4439","DOI":"10.1007\/s40747-022-00957-6","volume":"9","author":"R Zhong","year":"2023","unstructured":"Zhong R, Zhang E, Munetomo M (2023) Cooperative coevolutionary differential evolution with linkage measurement minimization for large-scale optimization problems in noisy environments. Complex Intell Syst 9(4):4439\u20134456. https:\/\/doi.org\/10.1007\/s40747-022-00957-6","journal-title":"Complex Intell Syst"},{"key":"2933_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10586-024-04408-4","volume":"27","author":"H Zhang","year":"2024","unstructured":"Zhang H, Qin X, Gao X (2024) Probe mechanism based particle swarm optimization for feature selection. Clust Comput 27:1\u201319. https:\/\/doi.org\/10.1007\/s10586-024-04408-4","journal-title":"Clust Comput"},{"key":"2933_CR10","doi-asserted-by":"publisher","unstructured":"Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceedings of ICNN\u201995\u2014international conference on neural networks, vol\u00a04, pp 1942\u20131948. https:\/\/doi.org\/10.1109\/ICNN.1995.488968","DOI":"10.1109\/ICNN.1995.488968"},{"key":"2933_CR11","doi-asserted-by":"publisher","first-page":"112699","DOI":"10.1016\/j.knosys.2024.112699","volume":"306","author":"S Gupta","year":"2024","unstructured":"Gupta S, Gupta S (2024) Fitness and historical success information-assisted binary particle swarm optimization for feature selection. Knowl-Based Syst 306:112699. https:\/\/doi.org\/10.1016\/j.knosys.2024.112699","journal-title":"Knowl-Based Syst"},{"key":"2933_CR12","doi-asserted-by":"publisher","unstructured":"Eberhart R, Kennedy J (1995) A new optimizer using particle swarm theory. In: MHS\u201995. Proceedings of the sixth international symposium on micro machine and human science, pp 39\u201343. https:\/\/doi.org\/10.1109\/MHS.1995.494215","DOI":"10.1109\/MHS.1995.494215"},{"issue":"2","key":"2933_CR13","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1109\/TCYB.2014.2322602","volume":"45","author":"R Cheng","year":"2015","unstructured":"Cheng R, Jin Y (2015) A competitive swarm optimizer for large scale optimization. IEEE Trans Cybern 45(2):191\u2013204. https:\/\/doi.org\/10.1109\/TCYB.2014.2322602","journal-title":"IEEE Trans Cybern"},{"issue":"1","key":"2933_CR14","doi-asserted-by":"publisher","first-page":"482032","DOI":"10.1155\/2008\/482032","volume":"2008","author":"P Alessandro","year":"2008","unstructured":"Alessandro P, Antonina S (2008) Particle swarm optimization for multimodal functions: a clustering approach. J Artif Evol Appl 2008(1):482032. https:\/\/doi.org\/10.1155\/2008\/482032","journal-title":"J Artif Evol Appl"},{"key":"2933_CR15","unstructured":"Yu H (2019) A k-means-based multi-subpopulation particle swarm optimization for neural network ensemble arXiv:1907.03743"},{"key":"2933_CR16","doi-asserted-by":"publisher","first-page":"104866","DOI":"10.1016\/j.engappai.2022.104866","volume":"112","author":"Y Yang","year":"2022","unstructured":"Yang Y, Liao Q, Wang J, Wang Y (2022) Application of multi-objective particle swarm optimization based on short-term memory and k-means clustering in multi-modal multi-objective optimization. Eng Appl Artif Intell 112:104866. https:\/\/doi.org\/10.1016\/j.engappai.2022.104866","journal-title":"Eng Appl Artif Intell"},{"key":"2933_CR17","doi-asserted-by":"publisher","unstructured":"Yang J, Wang K, Wang Y, Lei Z, Gao S (2024) Dynamic population structures-based differential evolution algorithm. In: IEEE transactions on emerging topics in computational intelligence, pp 1\u201313. https:\/\/doi.org\/10.1109\/TETCI.2024.3367809","DOI":"10.1109\/TETCI.2024.3367809"},{"issue":"1","key":"2933_CR18","doi-asserted-by":"publisher","first-page":"12744","DOI":"10.1038\/s41598-023-40080-1","volume":"13","author":"J Yang","year":"2023","unstructured":"Yang J, Zhang Y, Jin T, Lei Z, Todo Y, Gao S (2023) Maximum lyapunov exponent-based multiple chaotic slime mold algorithm for real-world optimization. Sci Rep 13(1):12744. https:\/\/doi.org\/10.1038\/s41598-023-40080-1","journal-title":"Sci Rep"},{"key":"2933_CR19","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1016\/j.asoc.2017.05.060","volume":"59","author":"P Mohapatra","year":"2017","unstructured":"Mohapatra P, Das K, Roy S (2017) A modified competitive swarm optimizer for large scale optimization problems. Appl Soft Comput 59:340\u2013362. https:\/\/doi.org\/10.1016\/j.asoc.2017.05.060","journal-title":"Appl Soft Comput"},{"key":"2933_CR20","doi-asserted-by":"publisher","first-page":"112204","DOI":"10.1016\/j.enconman.2019.112204","volume":"203","author":"G Xiong","year":"2020","unstructured":"Xiong G, Zhang J, Shi D, Yuan X (2020) A simplified competitive swarm optimizer for parameter identification of solid oxide fuel cells. Energy Convers Manage 203:112204. https:\/\/doi.org\/10.1016\/j.enconman.2019.112204","journal-title":"Energy Convers Manage"},{"key":"2933_CR21","doi-asserted-by":"publisher","first-page":"112450","DOI":"10.1016\/j.enconman.2019.112450","volume":"206","author":"G Xiong","year":"2020","unstructured":"Xiong G, Zhang J, Shi D, Zhu L, Yuan X, Tan Z (2020) Winner-leading competitive swarm optimizer with dynamic gaussian mutation for parameter extraction of solar photovoltaic models. Energy Convers Manage 206:112450. https:\/\/doi.org\/10.1016\/j.enconman.2019.112450","journal-title":"Energy Convers Manage"},{"key":"2933_CR22","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.ins.2022.11.019","volume":"619","author":"C Huang","year":"2022","unstructured":"Huang C, Zhou X, Ran X, Liu Y, Deng W, Deng W (2022) Co-evolutionary competitive swarm optimizer with three-phase for large-scale complex optimization problem. Inform Sci 619:2\u201318. https:\/\/doi.org\/10.1016\/j.ins.2022.11.019","journal-title":"Inform Sci"},{"key":"2933_CR23","doi-asserted-by":"publisher","DOI":"10.5334\/jors.508","author":"NV Thieu","year":"2024","unstructured":"Thieu NV (2024) Opfunu: an open-source python library for optimization benchmark functions. J Open Res Softw. https:\/\/doi.org\/10.5334\/jors.508","journal-title":"J Open Res Softw"},{"key":"2933_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysarc.2023.102871","author":"N Van Thieu","year":"2023","unstructured":"Van Thieu N, Mirjalili S (2023) Mealpy: an open-source library for latest meta-heuristic algorithms in python. J Syst Arch. https:\/\/doi.org\/10.1016\/j.sysarc.2023.102871","journal-title":"J Syst Arch"},{"key":"2933_CR25","doi-asserted-by":"publisher","first-page":"129034","DOI":"10.1016\/j.jhydrol.2022.129034","volume":"617","author":"N Van Thieu","year":"2023","unstructured":"Van Thieu N, Barma SD, Van Lam T, Kisi O, Mahesha A (2023) Groundwater level modeling using augmented artificial ecosystem optimization. J Hydrol 617:129034. https:\/\/doi.org\/10.1016\/j.jhydrol.2022.129034","journal-title":"J Hydrol"},{"key":"2933_CR26","doi-asserted-by":"publisher","first-page":"107282","DOI":"10.1016\/j.asoc.2021.107282","volume":"105","author":"AN Ahmed","year":"2021","unstructured":"Ahmed AN, Van Lam T, Hung ND, Van Thieu N, Kisi O, El-Shafie A (2021) A comprehensive comparison of recent developed meta-heuristic algorithms for streamflow time series forecasting problem. Appl Soft Comput 105:107282. https:\/\/doi.org\/10.1016\/j.asoc.2021.107282","journal-title":"Appl Soft Comput"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-025-02933-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13042-025-02933-1","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-025-02933-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T10:01:21Z","timestamp":1774519281000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13042-025-02933-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,17]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["2933"],"URL":"https:\/\/doi.org\/10.1007\/s13042-025-02933-1","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"value":"1868-8071","type":"print"},{"value":"1868-808X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,17]]},"assertion":[{"value":"18 February 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 October 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 February 2026","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 no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interests"}}],"article-number":"136"}}