Bi-objective feature selection in high-dimensional datasets using improved binary chimp optimization algorithm

Nour Alqudah

doi:10.1007/s13042-024-02308-y

Bi-objective feature selection in high-dimensional datasets using improved binary chimp optimization algorithm

2024-08-10

1

PRE

AI

N

Nour Alqudah

B

Bilal H. Abed-alguni *

M

Malek Barhoush

DOI：10.1007/s13042-024-02308-y

原文链接

原文求助

摘要

En 中文

The machine learning process in high-dimensional datasets is far more complicated than in low-dimensional datasets. In high-dimensional datasets, Feature Selection (FS) is necessary to decrease the complexity of learning. However, FS in high-dimensional datasets is a complex process that requires the combination of several search techniques. The Chimp Optimization Algorithm, known as ChOA, is a new meta-heuristic method inspired by the chimps' individual intellect and sexual incentive in cooperative hunting. It is basically employed in solving complex continuous optimization problems, while its binary version is frequently utilized in solving difficult binary optimization problems. Both versions of ChOA are subject to premature convergence and are incapable of effectively solving high-dimensional optimization problems. This paper proposes the Binary Improved ChOA Algorithm (BICHOA) for solving the bi-objective, high-dimensional FS problems (i.e., high-dimensional FS problems that aim to maximize the classifier's accuracy and minimize the number of selected features from a dataset). BICHOA improves the performance of ChOA using four new exploration and exploitation techniques. First, it employs the opposition-based learning approach to initially create a population of diverse binary feasible solutions. Second, it incorporates the L & eacute;vy mutation function in the main probabilistic update function of ChOA to boost its searching and exploring capabilities. Third, it uses an iterative exploration technique based on an exploratory local search method called the beta-hill climbing algorithm. Finally, it employs a new binary time-varying transfer function to calculate binary feasible solutions from the continuous feasible solutions generated by the update equations of the ChOA and beta-hill climbing algorithms. BICHOA's performance was assessed and compared against six machine learning classifiers, five integer programming methods, and nine efficient popular optimization algorithms using 25 real-world high-dimensional datasets from various domains. According to the overall experimental findings, BICHOA scored the highest accuracy, best objective value, and fewest selected features for each of the 25 real-world high-dimensional datasets. Besides, the reliability of the experimental findings was established using Friedman and Wilcoxon statistical tests.

Keyword:

Chimp optimization algorithm

Opposition-based learning

High-dimensional datasets

Feature selection

Chimp optimization algorithm

Opposition-based learning

Levy flight

beta-Hill climbing algorithm

High-dimensional datasets

Feature selection

Bi-objective feature selection in high-dimensional datasets using improved binary chimp optimization algorithm

摘要

期刊

机构

引用论文