Mohammad Ansari Shiri - Department of Computer Science, Shahid Bahonar University of Kerman, Kerman, Iran
Mohammad Omidi - Department of Computer Science, Shahid Bahonar University of Kerman, Kerman, Iran
Najme Mansouri - Department of Computer Science, Shahid Bahonar University of Kerman, Kerman, Iran

Data dimensions and networks have grown exponentially with the Internet and communications. The challenge of high-dimensional data is increasing for machine learning and data science. This paper presents a hybrid filter-wrapper feature selection method based on Equilibrium Optimization (EO) and Simulated Annealing (SA). The proposed algorithm is named Filter-Wrapper Binary Equilibrium Optimizer Simulated Annealing (FWBEOSA). We used SA to solve the local optimal problem so that EO could be more accurate and better able to select the best subset of features. FWBEOSA utilizes a filtering phase that increases accuracy as well as reduces the number of selected features. The proposed method is evaluated on ۱۷ standard UCI datasets using Support Vector Machine (SVM) and K-Nearest Neighbors (KNN) classifiers and compared with ten state-of-the-art algorithms (i.e., Binary Equilibrium Optimizer (BEO), Binary Gray Wolf Optimization (BGWO), Binary Swarm Slap Algorithm (BSSA), Binary Genetic Algorithm (BGA), Binary Particle Swarm Optimization (BPSO), Binary Social Mimic Optimization (BSMO), Binary Atom Search Optimization (BASO), Modified Flower Pollination Algorithm (MFPA), Bar Bones Particle Swarm Optimization (BBPSO) and Two-phase Mutation Gray Wolf Optimization (TMGWO)). Based on the results of the SVM classification, the highest level of accuracy was achieved in ۱۳ out of ۱۷ data sets (۷۶%), and the lowest number of selected features was achieved in ۱۵ out of ۱۷ data sets (۸۸%). Furthermore, the proposed algorithm using class KNN achieved the highest accuracy rate in ۱۴ datasets (۸۲%) and the lowest selective feature rate in ۱۳ datasets (۷۶%).

Feature Selection, Equilibrium Optimizer, Simulated Annealing, Filter, Wrapper