Quasi-reflection learning arithmetic optimization algorithm firefly search for feature selection
Related Experiment Video
Updated: Aug 1, 2025

Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances
Published on: October 11, 2018
Nebojsa Bacanin1, Nebojsa Budimirovic1, K Venkatachalam2
1Singidunum University, Danijelova 32, 11000 Belgrade, Serbia.
Abstract:
With the whirlwind evolution of technology, the quantity of stored data within datasets is rapidly expanding. As a result, extracting crucial and relevant information from said datasets is a gruelling task. Feature selection is a critical preprocessing task for machine learning to reduce the excess data in a set. This research presents a novel quasi-reflection learning arithmetic optimization algorithm - firefly search, an enhanced version of the original arithmetic optimization algorithm. Quasi-reflection learning mechanism was implemented for enhancement of population diversity, while firefly algorithm metaheuristics were used to improve the exploitation abilities of the original arithmetic optimization algorithm. The aim of this wrapper-based method is to tackle a specific classification problem by selecting an optimal feature subset. The proposed algorithm is tested and compared with various well-known methods on ten unconstrained benchmark functions, then on twenty-one standard datasets gathered from the University of California, Irvine Repository and Arizona State University. Additionally, the proposed approach is applied to the Corona disease dataset. The experimental results verify the improvements of the presented method and their statistical significance.
More Related Videos
03:37Author Spotlight: Impact of Intergenic Interactions on Disease-Identifying Dark Biomarkers
Published on: March 1, 2024
10:36Author Spotlight: Optimization of Airflow Velocities in Battery Cooling Systems for Enhanced Thermal Performance and Reduced Energy Consumption
Published on: November 3, 2023
Related Concept Videos
Woodward–Hoffmann Selection Rules and Microscopic Reversibility
Heuristics
People often rely on heuristics when faced with an overload of information, limited time, low importance of the decision, limited information, or when a heuristic readily comes to mind. For...
Linear Approximation in Frequency Domain
In contrast, nonlinear systems do not inherently possess these properties. However, for small deviations around an operating point, a nonlinear system can often be approximated as linear....
Fast Fourier Transform
The computational efficiency of the FFT becomes...
Frequency-dependent Selection
Observational Learning