返回
A Length-Adaptive Non-Dominated Sorting Genetic Algorithm for Bi-Objective High-Dimensional Feature Selection
DOI:10.1109/JAS.2023.123648.png)
摘要
En 中文
As a crucial data preprocessing method in data mining, feature selection (FS) can be regarded as a bi-objective optimization problem that aims to maximize classification accuracy and minimize the number of selected features. Evolutionary computing (EC) is promising for FS owing to its powerful search capability. However, in traditional EC-based methods, feature subsets are represented via a length-fixed individual encoding. It is ineffective for high-dimensional data, because it results in a huge search space and prohibitive training time. This work proposes a length-adaptive non-dominated sorting genetic algorithm (LA-NSGA) with a length-variable individual encoding and a length-adaptive evolution mechanism for bi-objective high-dimensional FS. In LA-NSGA, an initialization method based on correlation and redundancy is devised to initialize individuals of diverse lengths, and a Pareto dominance-based length change operator is introduced to guide individuals to explore in promising search space adaptively. Moreover, a dominance-based local search method is employed for further improvement. The experimental results based on 12 high-dimensional gene datasets show that the Pareto front of feature subsets produced by LA-NSGA is superior to those of existing algorithms.
Keyword:
Bi-objective optimization
feature selection (FS)
genetic algorithm
high-dimensional data
length-adaptive
期刊
I
IF:
19.2
论文数:
1.4K
被引数:
1.1W
机构
引用论文
A Duplication Analysis-Based Evolutionary Algorithm for Biobjective Feature Selection基于重复分析的双目标特征选择进化算法
Variable-Length Particle Swarm Optimization for Feature Selection on High-Dimensional Classification高维分类特征选择的变长粒子群算法

