arrow
Return

IBJA: An improved binary DJaya algorithm for feature selection

delete2024-01-01
delete15
PRE
AI
B
Bilal H. Abed-alguni *
S
Saqer Hamzeh AL-Jarah
DOI:10.1016/j.jocs.2023.102201delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Feature Selection (FS) is a special preprocessing step in Machine Learning (ML) that reduces the number of unwanted features in datasets to increase the accuracy of ML classifiers. A popular binary variant of the continuous Jaya algorithm is the Discrete Jaya (DJaya) algorithm. It is commonly used for addressing optimization problems with binary design variables (also known as binary decision variables). Nevertheless, DJaya tends to prematurely converge to local optimal solutions, and its performance deteriorates as the complexity of the optimization problem grows. The DJaya algorithm is improved in this article by introducing the Improved Binary DJaya Algorithm (IBJA), which is specially designed to solve the FS problem. IBJA includes three techniques in DJaya. First, it incorporates the update equation of the Harris Hawks Optimization (HHO) algorithm into the optimization loop of DJaya to enhance DJaya's searching process and exploration abilities. Second, it uses a new Dynamic Opposition-based Learning in the final steps of the optimization loop of DJaya to boost its searching and exploring capabilities. Third, it employs binary transfer functions to calculate binary solutions from the real-valued solutions generated by HHO and DOBL. Using 15 UCI datasets, IBJA's performance was assessed and compared against four ML classifiers and ten efficient optimization algorithms. Besides, the Friedman statistical test was employed to investigate the reliability of the experimental findings. According to the overall experimental and statistical findings, IBJA scored the highest accuracy, best objective value, and fewest chosen features for each of the 15 UCI datasets.
Keywords:
DJaya
Harris Hawks optimization
Feature selection
Dynamic opposition-based learning

Journal

Nature Computational Science cover
Nature Computational Science
IF:
18.3
Papers:
3.1K
Citations:
4.0K

Organization

Y
Yarmouk University
Scholars:
1.8K
Papers: 1.5K
Citations: 1.1K
Cited Papers

Cited Papers

Harris hawks optimization: Algorithm and applications
err2019-08-01
err4.1K
PREAI
errHeidari, Ali Asghar; Mirjalili, Seyedali; Faris, Hossam; Aljarah, Ibrahim; Mafarja, Majdi; Chen, Huiling
errShare
errSave
Grey Wolf Optimizer
err2014-03-01
err1.3W
PREAI
errMirjalili, Seyedali; Mirjalili, Seyed Mohammad; Lewis, Andrew
errShare
errSave
Flexible Job-Shop Rescheduling for New Job Insertion by Using Discrete Jaya Algorithm
err2019-05-01
err236
errOAAI
errGao, Kaizhou; Yang, Fajun; Zhou, MengChu; Pan, Quanke; Suganthan, Ponnuthurai Nagaratnam
errShare
errSave
Capsaicin, a Spicy Component of Hot Pepper, Induces Apoptosis by Activation of the Peroxisome Proliferator-Activated Receptor γ in HT-29 Human Colon Cancer Cells
err2004-09-01
err0
PREAI
errChu-Sook Kim; Won-Hyung Park; Jun-Young Park; Ji-Hye Kang; Mi-Ock Kim; Teruo Kawada; Hoon Yoo; In-Seob Han; Rina Yu
errShare
errSave
researcher View more