4.7 Article

Adaptive crossover operator based multi-objective binary genetic algorithm for feature selection in classification

期刊

KNOWLEDGE-BASED SYSTEMS
卷 227, 期 -, 页码 -

出版社

ELSEVIER
DOI: 10.1016/j.knosys.2021.107218

关键词

Feature selection; Binary genetic algorithm; Multi-objective optimization; Adaptive operator selection; Classification

资金

  1. National Natural Science Foundation of China [61876089, 61876185, 61902281]
  2. Opening Project of Jiangsu Key Laboratory of Data Science and Smart Software [2019DS301]
  3. Natural Science Foundation of Jiangsu Province [BK20141005]
  4. Natural Science Foundation of the Jiangsu Higher Education Institutions of China [14KJB520025]

向作者/读者索取更多资源

Feature selection is a crucial pre-processing technique for classification, aiming to enhance classification accuracy by removing irrelevant or redundant features. This study introduces a multi-objective genetic algorithm with an adaptive operator selection mechanism, which effectively addresses high-dimensional feature selection problems.
Feature selection is a key pre-processing technique for classification which aims at removing irrelevant or redundant features from a given dataset. Generally speaking, feature selection can be considered as a multi-objective optimization problem, i.e, removing number of features and improving the classification accuracy. Genetic algorithms (GAs) have been widely used for feature selection problems. The crossover operator, as an important technique to search for new solutions in GAs, has a strong impact on the final optimization results. However, many crossover operators are problem-dependent and have different search abilities. Thus, it is a challenge to select the most efficient one to solve different feature selection problems, especially when the nature of feature selection problems is unknown in advance. In order to overcome this challenge, in this paper, a multi-objective binary genetic algorithm integrating an adaptive operator selection mechanism (MOBGA-AOS) is proposed. In MOBGA-AOS, five crossover operators with different search characteristics are used. Each of them is assigned a probability based on the performance in the evolution process. In different phases of evolution, the proper crossover operator is selected by roulette wheel selection according to the probabilities to produce new solutions for the next generation. The proposed algorithm is compared with five well-known evolutionary multi-objective algorithms on ten datasets. The experimental results reveal that MOBGA-AOS is capable of removing a large amount of features while ensuring a small classification error. Moreover, it obtains prominent advantages on large-scale datasets, which demonstrates that MOBGA-AOS is competent to solve high-dimensional feature selection problems. (C) 2021 Elsevier B.V. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据