.png){kind=icon}
返回
Discretization-Based Feature Selection as a Bilevel Optimization Problem
.png){kind=icon}
OA
AI
DOI：10.1109/TEVC.2022.3192113.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Bilevel optimization
co-evolutionary algorithm
cut-points search
discretization-based feature selection (DBFS)
features interactions
期刊
IF:
12
论文数:
1.9K
被引数:
2.4W
机构
引用论文
Variable-Length Particle Swarm Optimization for Feature Selection on High-Dimensional Classification高维分类特征选择的变长粒子群算法
OAAI
OAAI分享收藏A Multi-objective hybrid filter-wrapper evolutionary approach for feature selection一种用于特征选择的多目标混合过滤器-包装器进化方法.png)
MEMETIC COMPUTING
MEMETIC COMPUTINGIF2.3
PREAI
分享收藏分享收藏Solving Combinatorial Multi-Objective Bi-Level Optimization Problems Using Multiple Populations and Migration SchemesIEEE ACCESS
IEEE ACCESSIF3.6
PREAI
分享收藏MLACO: A multi-label feature selection algorithm based on ant colony optimizationMLACO: 一种基于蚁群优化的多标签特征选择算法
PREAI
分享收藏
查看更多内容