Enhanced Binary Kepler Optimization Algorithm for effective feature selection of supervised learning classification

Abstract This study proposes an Enhanced Binary Kepler Optimization Algorithm (BKOA-MUT) improves feature selection (FS) by integrating Kepler’s planetary motion laws with DE/rand and DE/best Mutation Approach. BKOA-MUT balances exploration and exploitation, effectively guiding search for optimal feature subsets. BKOA-MUT was evaluated using k -Nearest Neighbors (k-NN) and Support Vector Machine (SVM) on 25 UCI benchmarks, including three large-scale ones. It outperformed recent Meta-heuristic Algorithms (MHAs) in accuracy, feature reduction, and computational efficiency. The algorithm showed rapid convergence, minimal feature selection, and scalability, making it a robust and adaptable tool for enhancing FS in machine learning, validated through the Wilcoxon rank-sum test.

Authors

Institutions

Publication Details

Journal
Journal Of Big Data
Published
2025-04-15
DOI
https://doi.org/10.1186/s40537-025-01125-6
Citations
4
Primary Topic
Metaheuristic Optimization Algorithms Research
Type
article
Field-Weighted Citation Impact
9.92

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Enhanced Binary Kepler Optimization Algorithm for effective feature selection of supervised learning classification

Amr A. Abd El-Mageed, Amr A. Abohany, Khalid Mohamed Hosny
4 citations
Journal Of Big Data
Metaheuristic Optimization Algorithms Research
9.92
article

Enhanced Binary Kepler Optimization Algorithm for effective feature selection of supervised learning classification

Amr A. Abd El-Mageed, Amr A. Abohany, Khalid Mohamed Hosny
article en
4 citations

Abstract

Abstract This study proposes an Enhanced Binary Kepler Optimization Algorithm (BKOA-MUT) improves feature selection (FS) by integrating Kepler’s planetary motion laws with DE/rand and DE/best Mutation Approach. BKOA-MUT balances exploration and exploitation, effectively guiding search for optimal feature subsets. BKOA-MUT was evaluated using k -Nearest Neighbors (k-NN) and Support Vector Machine (SVM) on 25 UCI benchmarks, including three large-scale ones. It outperformed recent Meta-heuristic Algorithms (MHAs) in accuracy, feature reduction, and computational efficiency. The algorithm showed rapid convergence, minimal feature selection, and scalability, making it a robust and adaptable tool for enhancing FS in machine learning, validated through the Wilcoxon rank-sum test.

Journal Of Big DataVol. 12(1)
Damanhour University (EG), Zagazig University (EG), Sohag University (EG)
Zagazig University
Openalex Percentile: Top 2%
Metaheuristic Optimization Algorithms Research
9.92
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.