Atom Search Optimization with Simulated Annealing -- a Hybrid Metaheuristic Approach for Feature Selection
'Hybrid meta-heuristics' is one of the most interesting recent trends in the field of optimization and feature selection (FS). In this paper, we have proposed a binary variant of Atom Search Optimization (ASO) and its hybrid with Simulated Annealing called ASO-SA techniques for FS. In order to map the real values used by ASO to the binary domain of FS, we have used two different transfer functions: S-shaped and V-shaped. We have hybridized this technique with a local search technique called, SA We have applied the proposed feature selection methods on 25 datasets from 4 different categories: UCI, Handwritten digit recognition, Text, non-text separation, and Facial emotion recognition. We have used 3 different classifiers (K-Nearest Neighbor, Multi-Layer Perceptron and Random Forest) for evaluating the strength of the selected featured by the binary ASO, ASO-SA and compared the results with some recent wrapper-based algorithms. The experimental results confirm the superiority of the proposed method both in terms of classification accuracy and number of selected features.
Code (0)
등록된 구현이 없습니다.
Tasks
Emotion RecognitionFacial Emotion Recognitionfeature selectionHandwritten Digit RecognitionMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
A hybrid estimation of distribution algorithm for joint stratification and sample allocation
In this study we propose a hybrid estimation of distribution algorithm (HEDA) to solve the joint stratification and sample allocation problem. This is a complex problem in which each the quality of each stratification fr…
A Simulated Annealing Algorithm for Joint Stratification and Sample Allocation Designs
This study combines simulated annealing with delta evaluation to solve the joint stratification and sample allocation problem. In this problem, atomic strata are partitioned into mutually exclusive and collectively exhau…
Accelerating ground state search of spatial photonic Ising machines with genetic-simulated annealing hybrid algorithm
Spatial photonic Ising machines (SPIMs) based on spatial light modulators (SLMs) have emerged as highly effective solvers for many tasks, including combinatorial optimization problems and spin-glass simulations. However,…
LPBSA: Enhancing Optimization Efficiency through Learner Performance-based Behavior and Simulated Annealing
This study introduces the LPBSA, an advanced optimization algorithm that combines Learner Performance-based Behavior (LPB) and Simulated Annealing (SA) in a hybrid approach. Emphasizing metaheuristics, the LPBSA addresse…
NavigateAdiabatic Quantum Optimization Fails to Solve the Knapsack Problem
In this work, we attempt to solve the integer-weight knapsack problem using the D-Wave 2000Q adiabatic quantum computer. The knapsack problem is a well-known NP-complete problem in computer science, with applications in …