Discretization-Based Feature Selection as a Bilevel Optimization Problem

doi:10.1109/TEVC.2022.3192113

Return

Discretization-Based Feature Selection as a Bilevel Optimization Problem

2023-08-01

Rihab Said *

Maha Elarbi

Slim Bechikh

Carlos A. Coello Coello

Lamjed Ben Saïd

DOI：10.1109/TEVC.2022.3192113

Original

Original request for help

Save

Abstract

En 中文

Discretization-based feature selection (DBFS) approaches have shown interesting results when using several metaheuristic algorithms, such as particle swarm optimization (PSO), genetic algorithm (GA), ant colony optimization (ACO), etc. However, these methods share the same shortcoming which consists in encoding the problem solution as a sequence of cut-points. From this cut-points vector, the decision of deleting or selecting any feature is induced. Indeed, the number of generated cut-points varies from one feature to another. Thus, the higher the number of cut-points, the higher the probability of selecting the considered feature; and vice versa. This fact leads to the deletion of possibly important features having a single or a low number of cut-points, such as the infection rate, the glycemia level, and the blood pressure. In order to solve the issue of the dependency relation between the feature selection (or removal) event and the number of its generated potential cut-points, we propose to model the DBFS task as a bilevel optimization problem and then solve it using an improved version of an existing co-evolutionary algorithm, named I-CEMBA. The latter ensures the variation of the number of features during the migration process in order to deal with the multimodality aspect. The resulting algorithm, termed bilevel discretization-based feature selection (Bi-DFS), performs selection at the upper level while discretization is done at the lower level. The experimental results on several high-dimensional datasets show that Bi-DFS outperforms relevant state-of-the-art methods in terms of classification accuracy, generalization ability, and feature selection bias.

Keywords:

Bilevel optimization

co-evolutionary algorithm

cut-points search

discretization-based feature selection (DBFS)

features interactions