Reinforced covariance weighted mean of vectors optimizer: insight, diversity, deep analysis and feature selection

被引:0
作者
Boyang Xu
Ali Asghar Heidari
Huiling Chen
机构
[1] Wenzhou University,Key Laboratory of Intelligent Informatics for Safety & Emergency of Zhejiang Province
[2] University of Tehran,School of Surveying and Geospatial Engineering, College of Engineering
来源
Applied Intelligence | 2024年 / 54卷
关键词
Weighted mean of vectors; Swarm intelligence; Benchmark; Metaheuristic; Efficiency; Feature selection;
D O I
暂无
中图分类号
学科分类号
摘要
The WeIghted meaN oF vectOrs (INFO) algorithm is widely used as an efficient optimization tool due to its simple structure and superior performance. However, achieving a balance in solving complex high-dimensional problems is difficult and quickly falls into premature convergence or local optimality. To better balance the conflict between exploration and exploitation capabilities, a Q-learning Covariance weIghted meaN oF vectOrs Algorithm (QCINFOCMA) based on reinforcement learning is designed in this study to solve the global optimization problem. QCINFOCMA incorporates a covariance matrix adaptation evolution strategy and Cauchy mutation as a new exploration scheme. The Q-learning strategy in reinforcement learning is also integrated into the original INFO to achieve adaptive switching between the original local search and the new exploration scheme. This allows search agents to use rewards and penalties to select exploration methods without following established models or strategies. In this study, a comprehensive analysis is conducted, pitting QCINFOCMA against 10 heuristics and 9 state-of-the-art algorithms, utilizing the IEEE CEC 2017 test functions. The experimental results show that QCINFOCMA outperforms other advanced algorithms in terms of convergence speed and convergence accuracy. Subsequently, QCINFOCMA was subjected to a discretization process, effectively transforming it into a binary tool through the application of a specific transformation function. This binary tool was then employed to address the real-world challenge of feature selection across a cohort of 36 datasets obtained from the UCI machine learning library. Empirical findings demonstrate that QCINFOCMA attains superior classification accuracy and requires fewer features in comparison to alternative optimization algorithms. The proposed QCINFOCMA can be a novel optimization tool for implementing global optimization and wrapper-based feature selection tasks.
引用
收藏
页码:3351 / 3402
页数:51
相关论文
共 142 条
[81]  
Cai X(2017)High-resolution transport-of-intensity quantitative phase microscopy with annular illumination Sci Rep 7 undefined-undefined
[82]  
Mesejo P(2016)Binary fireworks algorithm for profit based unit commitment (PBUC) problem Int J Electr Power Energy Syst 83 undefined-undefined
[83]  
Jang S(2018)Binary dragonfly optimization for feature selection using time-varying transfer functions Knowl-Based Syst 161 undefined-undefined
[84]  
Yoo S(2019)Cost-sensitive feature selection using two-archive multi-objective artificial bee colony algorithm Expert Syst Appl 137 undefined-undefined
[85]  
Kang N(2018)Information gain directed genetic algorithm wrapper feature selection for credit rating Appl Soft Comput 69 undefined-undefined
[86]  
Drugan MM(2020)Enhanced binary moth flame optimization as a feature selection algorithm to predict software fault prediction IEEE Access 8 undefined-undefined
[87]  
Beyer H-G(2013)S-shaped versus V-shaped transfer functions for binary particle swarm optimization Swarm Evol Comput 9 undefined-undefined
[88]  
Schwefel H-P(2016)Binary ant lion approaches for feature selection Neurocomputing 213 undefined-undefined
[89]  
Salgotra R(2014)Binary bat algorithm Neural Comput Appl 25 undefined-undefined
[90]  
Singh U(2018)An efficient binary Salp Swarm Algorithm with crossover scheme for feature selection problems Knowl-Based Syst 154 undefined-undefined