1. Binary Giza Pyramids Construction For Feature Selection.
- Author
-
Nssibi, Maha, Manita, Ghaith, and Korbaa, Ouajdi
- Subjects
PARTICLE swarm optimization ,PYRAMIDS ,ALGORITHMS ,MACHINE learning ,FEATURE selection ,METAHEURISTIC algorithms ,DIFFERENTIAL evolution ,MULTICASTING (Computer networks) - Abstract
Feature selection (FS) is considered a challenging machine learning problem that handles the large size of features. The main purpose of FS is to remove irrelevant and redundant variables to improve the performance of the learning algorithms. Consequently, the FS process is considered as an optimization problem where metaheuristics approaches prove efficiency in solving it. In this paper, we propose new binary versions of a new ancient inspired metaheuristic approach called Giza Pyramids Construction (GPC) to select the most relevant subset of features. The proposed binary versions of the algorithm called BGPC-S and BGPC-V are implemented with two transfer functions, with the main objective of maximizing classification accuracy and minimizing the number of selected features. The two versions of BGPC were compared to six well-known binary metaheuristics for feature selection problem, namely Binary Atom Search Optimisation (BASO), Binary Bat Algorithm (BBA), Binary Differential Evolution (BDE), Binary Grey Wolf Optimizer (BGWO), Binary Particle Swarm Optimization (BPSO), and Binary Harris Hawks Optimizer (BHHO), and evaluated over 20 datasets from the UCI repository. Experiments have demonstrated that the proposed approaches outperformed the other algorithms in terms of classification accuracy and the number of selected features. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF