MutaSwarmClus: enhancing data clustering efficiency with mutation-enhanced swarm algorithm

作     者：Malik, Saleem Patro, S. Gopal Krishna Mahanty, Chandrakanta Lasisi, Ayodele Al-sareji, Osamah J. 

作者机构：PA Coll Engn CSE Dept Mangalore 574153 India Woxsen Univ Sch Technol Hyderabad Telangana India GITAM Deemed Univ GITAM Sch Technol Dept Comp Sci & Engn Visakhapatnam 530045 India King Khalid Univ Coll Comp Sci Dept Comp Sci Abha Saudi Arabia Univ Pannonia Fac Engn Sustainabil Solut Res Lab Egyet Str 10 H-8200 Veszprem Hungary 

出 版 物：《CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS》 (Cluster Comput.)

年 卷 期：2025年第28卷第3期

页      面：1-24页

核心收录：

学科分类：07[理学] 0703[理学-化学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：University of Pannonia [RGP2/496/45] Deanship of Scientific Research at King Khalid University 

主　　题：Data clustering Optimization algorithms Hybrid approaches MBF 

摘      要：Data clustering is a fundamental technique in data mining, pivotal for various applications such as statistical analysis and data compression. Traditional clustering algorithms often struggle with noisy or high-dimensional datasets, hindering their efficacy in addressing real-world challenges. In response, this research introduces MutaSwarmClus, a novel hybrid metaheuristic algorithm that combines Mouth Brooding Fish (MBF), Ant Colony Optimization (ACO), and mutation operators to enhance clustering quality. MutaSwarmClus intends to adaptively control the exploration and exploitation phases of the solution space, solve issues with local optima and changes in the distribution of available data. Moreover, it incorporates an Iterated Local Search (ILS) to refine solutions and avoiding getting stuck in local optima. MutaSwarmClus therefore increases the robustness of the clustering process by incorporating controlled randomness through mutation operators in order to handle noisy and outlier data points well. According to the contributions analysis, the proposed algorithm improves the clustering solution with the combined system of MBF, ACO, and mutation operators, which enables the mechanism of exploration and exploitation in the process of information search. As shown through the results of experimental studies, MutaSwarmClus has high performance when used with various benchmarks, and outperforms or performs as well as or better than compared to other clustering algorithms such as K-means, ALO, Hybrid ALO, and MBF. It achieves an average error rate of only 10%, underscoring its accuracy in clustering tasks. The utilization of MutaSwarmClus offers a solution to the existing problems in clustering large datasets in terms of scalability, efficiency and accuracy. Possible directions for future work can continue to optimize the model parameters of the algorithm and study its adaptability in dynamic conditions and with large amounts of data.