A novel adaptive memetic binary optimization algorithm for feature selection

被引:0
作者
Ahmet Cevahir Cinar
机构
[1] Selçuk University,Department of Computer Engineering, Faculty of Technology
来源
Artificial Intelligence Review | 2023年 / 56卷
关键词
Memetic computing; Binary optimization; Feature selection; Local search; Logic gates;
D O I
暂无
中图分类号
学科分类号
摘要
Feature selection (FS) determines the beneficial features in data and decreases the disadvantages of the curse of dimensionality. This work proposes a novel adaptive memetic binary optimization (AMBO) algoraaithm for FS. FS is an NP-Hard binary optimization problem. AMBO is a pure binary optimization algorithm that works in binary discrete search space. New candidate individuals are adaptively created by a single point, double point, uniform crossovers, and canonical mutation mechanism. Local improvement for the best and worst individuals is provided with a new binary logic-gate based memetic smart local search mechanism. The balance between exploration and exploitation is achieved by adaptively. A diverse dimension dataset experimental setup is provided for determining the success of the proposed method. AMBO firstly was compared with binary particle swarm optimization (BPSO), a genetic algorithm with a random wheel selection strategy (GARW), a genetic algorithm with a tournaments selection strategy (GATS), and a genetic algorithm with a random selection strategy (GARS). AMBO outperformed the opponents on 11 datasets, especially the largest one. Wilcoxon signed-rank test and Friedman’s test were conducted to show the statistical significance of AMBO. For an additional experiment with state-of-art metaheuristic algorithms in the literature, Population reduction binary gaining sharing knowledge-based algorithm with V-4 shaped transfer function (PbGSK-V4), binary salp swarm algorithm (BSSA), binary differential evolution algorithm (BDE), binary dragonfly algorithm (BDA), binary particle swarm optimization algorithm (BPSO), binary bat algorithm (BBA), binary ant lion optimization (BALO) and binary grey wolf optimizer (BGWO) are used in experiments with 21 datasets. The experimental results of the proposed AMBO algorithm are significantly better than the state-of-art algorithms, in terms of classification error rate, fitness function, and average selected features.
引用
收藏
页码:13463 / 13520
页数:57
相关论文
共 146 条
[1]  
Abu Zaher A(2019)An adaptive memetic algorithm for feature selection using proximity graphs Computational Intell 35 156-183
[2]  
Berretta R(2022)S-shaped and v-shaped gaining-sharing knowledge-based algorithm for feature selection Appl Intell 7 39496-39508
[3]  
Noman N(2019)Binary optimization using hybrid grey wolf optimization for feature selection IEEE Access 8 125076-125096
[4]  
Moscato P(2020)Approaches to multi-objective feature selection: A systematic literature review IEEE Access 183 1148-1164
[5]  
Agrawal P(2020)The monarch butterfly optimization algorithm for solving feature selection problems Neural Comput Applic 22 585-600
[6]  
Ganesh T(2006)Stochastic local search for the feature set problem, with applications to microarray data Appl Math Comput 116 147-160
[7]  
Oliva D(2008)Genetic algorithm based feature selection level fusion using fingerprint and iris biometrics Int J Pattern Recognit Artif Intell 141 105152-3183
[8]  
Mohamed AW(2019)Binary butterfly optimization approaches for feature selection Expert Syst Appl 37 3177-38
[9]  
Al-Tashi Q(2022)Binary Horse herd optimization algorithm with crossover operators for feature selection Computers in Biol Med 32 29-65
[10]  
Kadir SJA(2020)Binary JAYA algorithm with adaptive mutation for feature selection Arab J Sci Eng 146 54-381