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 条
[1]  
Ren L(2022)Gaussian kernel probability-driven slime mould algorithm with new movement mechanism for multi-level image segmentation Measurement 192 246-269
[2]  
Jati GK(2023)Discrete komodo algorithm for traveling salesman problem Appl Soft Comput 139 283-5211
[3]  
Liu J(2015)A novel differential search algorithm and applications for structure design Appl Math Comput 268 5185-428
[4]  
Liu J(2022)Dynamic multi-swarm differential learning Harris Hawks Optimizer and its application to optimal dispatch problem of cascade hydropower stations Knowl-Based Syst 242 837-818
[5]  
Guan Z(2023)Great wall construction algorithm: a novel meta-heuristic algorithm for engineer problems Expert Syst Appl 233 407-2275
[6]  
Iliyasu AM(2023)Using particle swarm optimization and artificial intelligence to select the appropriate characteristics to determine volume fraction in two-phase flows Fractal Fract 7 797-453
[7]  
Heidari AA(2020)An enhanced associative learning-based exploratory whale optimizer for global optimization Neural Comput Appl 32 2240-318
[8]  
Li S(2023)Hybrid method with parallel-factor theory, a support vector machine, and particle filter optimization for intelligent machinery failure identification Machines 11 441-491
[9]  
Afzal A(2023)Optimizing the thermal performance of solar energy devices using meta-heuristic algorithms: a critical review Renew Sustain Energy Rev 173 303-937
[10]  
Mahdavi S(2015)Metaheuristics in large-scale global continues optimization: a survey Inf Sci 295 478-206