Binary Fox Optimization Algorithm for Feature Selection

Read full text Summarise with VIRAT
Authors: Athraa Jasim Mohammed, Khalil Ibrahim Ghathwan, Yuhanis Yusof
Cited by: 0
References: 28

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

Abstract There is an urgent need for algorithms capable of improving the selection of appropriate features that directly affect the improvement process of the algorithm’s accuracy efficiently. Therefore, in this paper, a new feature selection algorithm for binary classification is proposed, which is called binary FOX Optimization Feature Selection (BFOXFS), where BFOXFS is combined with the KNN algorithm, which is used for binary classification, and the classification error is utilized as the objective function for the proposed BFOXFS. For evaluation, BFOXFS is compared with Binary Particle Swarm Optimization Feature Selection (BPSOFS), and two versions of Binary Grey Wolf optimization algorithm for Feature Selection (BGW1FS and BGW2FS algorithms). The experimental results show the superiority of BFOXFS in feature reduction, where it chooses the minimum features with a lower fitness value comparable with others. Further, BFOXFS has better convergence capabilities, well at finding optimal values, which results in more reliable and efficient optimization algorithms. It is very suitable for implementing in real-world problems.

Fields of Study & Subjects

Metaheuristic Optimization Algorithms Research Face and Expression Recognition Evolutionary Algorithms and Applications

Publication details

Journal / source
Cybernetics and Information Technologies
Volume
26
Issue
1
Pages
159–173
Publication date
1 March 2026
Language
EN