Arctic Puffin Algorithm with local escaping operator for feature selection in high-dimensional datasets

Abstract Large datasets might make data mining more difficult due to their high dimensionality. To minimize the dimensionality of large datasets, feature selection is an essential step that maximizes classification accuracy by choosing the most informative features. In this study, a binary adaptation of the enhanced Arctic Puffin Optimization (EAPO) algorithm, which builds on the Arctic Puffin Optimization (APO) algorithm, is introduced within a wrapper-based framework to identify the optimal subset of features for classification tasks. To improve the search performance of APO, a local escaping operator is incorporated to effectively balance exploration and exploitation and enhance its ability to escape local optima. Furthermore, a key aspect of EAPO is the design of the transfer function, which facilitates the transformation of the continuous search space into a binary domain. To evaluate its effectiveness, three transfer functions, S-shaped, V-shaped, and U-shaped, are investigated. The proposed EAPO method is assessed on 14 benchmark datasets using the k-Nearest Neighbor classifier as the evaluation metric. To control overfitting, k-fold cross-validation employs a partitioning strategy in which the dataset is divided into k folds, and each fold is used as the test set once while the remaining folds form the training set. Comparisons are made with state-of-the-art methods, including the beluga whale optimization, sine cosine algorithm, kepler optimization algorithm, grey wolf optimizer, coati optimization algorithm, salp swarm algorithm, arithmetic optimization algorithm, and bat optimization algorithm. The results obtained from the experiments show that the EAPO technique is better in terms of consistency, feature reduction, and classification accuracy. Statistical analysis further confirms the effectiveness and robustness of the proposed method.

Authors

Institutions

Publication Details

Journal
Scientific Reports
Published
2026-11-17
DOI
https://doi.org/10.1038/s41598-026-64999-3
Primary Topic
Metaheuristic Optimization Algorithms Research
Type
article
Field-Weighted Citation Impact
0.00

Funders

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

Arctic Puffin Algorithm with local escaping operator for feature selection in high-dimensional datasets

Ahmed Fahim, Dina A. Elmanakhly, Mona Selim
5 links
Scientific Reports
Metaheuristic Optimization Algorithms Research
article

Arctic Puffin Algorithm with local escaping operator for feature selection in high-dimensional datasets

Ahmed Fahim, Dina A. Elmanakhly, Mona Selim
article en

Abstract

Abstract Large datasets might make data mining more difficult due to their high dimensionality. To minimize the dimensionality of large datasets, feature selection is an essential step that maximizes classification accuracy by choosing the most informative features. In this study, a binary adaptation of the enhanced Arctic Puffin Optimization (EAPO) algorithm, which builds on the Arctic Puffin Optimization (APO) algorithm, is introduced within a wrapper-based framework to identify the optimal subset of features for classification tasks. To improve the search performance of APO, a local escaping operator is incorporated to effectively balance exploration and exploitation and enhance its ability to escape local optima. Furthermore, a key aspect of EAPO is the design of the transfer function, which facilitates the transformation of the continuous search space into a binary domain. To evaluate its effectiveness, three transfer functions, S-shaped, V-shaped, and U-shaped, are investigated. The proposed EAPO method is assessed on 14 benchmark datasets using the k-Nearest Neighbor classifier as the evaluation metric. To control overfitting, k-fold cross-validation employs a partitioning strategy in which the dataset is divided into k folds, and each fold is used as the test set once while the remaining folds form the training set. Comparisons are made with state-of-the-art methods, including the beluga whale optimization, sine cosine algorithm, kepler optimization algorithm, grey wolf optimizer, coati optimization algorithm, salp swarm algorithm, arithmetic optimization algorithm, and bat optimization algorithm. The results obtained from the experiments show that the EAPO technique is better in terms of consistency, feature reduction, and classification accuracy. Statistical analysis further confirms the effectiveness and robustness of the proposed method.

Scientific Reports
Suez Canal University (EG), Suez University (EG), Sinai University (EG), Prince Sattam Bin Abdulaziz University (SA)
Science and Technology Development Fund, Suez University
Metaheuristic Optimization Algorithms Research
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.

Laika access coming soon