Chaotic RIME optimization algorithm with adaptive mutualism for feature selection problems

• Published in: Computers in biology and medicine 2024-09, Vol.179, p.108803, Article 108803
• Main Authors: Abdel-Salam, Mahmoud, Hu, Gang, Çelik, Emre, Gharehchopogh, Farhad Soleimanian, EL-Hasnony, Ibrahim M.
• Format: Article
• Language: English
• Subjects: Adaptive algorithms; Algorithms; Benchmarks; Chaos theory; Classification; Competitiveness; COVID-19; Datasets; Exploitation; Feature selection; Heuristic methods; Lagrange multiplier; Metaheuristics; Mutation; Mutualism; Optimization; Optimization algorithms; Parameter estimation; Performance evaluation; Rank tests; Reagents; RIME; Searching; Statistical analysis; Statistical tests; Wilcoxon test
• ISSN: 0010-4825; 1879-0534; 1879-0534
• DOI: 10.1016/j.compbiomed.2024.108803

The RIME optimization algorithm is a newly developed physics-based optimization algorithm used for solving optimization problems. The RIME algorithm proved high-performing in various fields and domains, providing a high-performance solution. Nevertheless, like many swarm-based optimization algorithms, RIME suffers from many limitations, including the exploration-exploitation balance not being well balanced. In addition, the likelihood of falling into local optimal solutions is high, and the convergence speed still needs some work. Hence, there is room for enhancement in the search mechanism so that various search agents can discover new solutions. The authors suggest an adaptive chaotic version of the RIME algorithm named ACRIME, which incorporates four main improvements, including an intelligent population initialization using chaotic maps, a novel adaptive modified Symbiotic Organism Search (SOS) mutualism phase, a novel mixed mutation strategy, and the utilization of restart strategy. The main goal of these improvements is to improve the variety of the population, achieve a better balance between exploration and exploitation, and improve RIME's local and global search abilities. The study assesses the effectiveness of ACRIME by using the standard benchmark functions of the CEC2005 and CEC2019 benchmarks. The proposed ACRIME is also applied as a feature selection to fourteen various datasets to test its applicability to real-world problems. Besides, the ACRIME algorithm is applied to the COVID-19 classification real problem to test its applicability and performance further. The suggested algorithm is compared to other sophisticated classical and advanced metaheuristics, and its performance is assessed using statistical tests such as Wilcoxon rank-sum and Friedman rank tests. The study demonstrates that ACRIME exhibits a high level of competitiveness and often outperforms competing algorithms. It discovers the optimal subset of features, enhancing the accuracy of classification and minimizing the number of features employed. This study primarily focuses on enhancing the equilibrium between exploration and exploitation, extending the scope of local search. •An adaptive chaotic ACRIME algorithm is proposed for optimization problems.•Four efficient improvements are introduced to boost the RIME algorithm.•The ACRIME was applied to the CEC functions and feature selection problems.•A set of experiments were conducted to test the performance of the ACRIME.