A High-Dimensional Feature Selection Algorithm Based on Multiobjective Differential Evolution
Multiobjective feature selection seeks to determine the most discriminative feature subset by simultaneously optimizing two conflicting objectives: minimizing the number of selected features and the classification error rate. The goal is to enhance the model's predictive performance and computational efficiency. However, feature redundancy and interdependence in high-dimensional data present considerable obstacles to the search efficiency of optimization algorithms and the quality of the resulting solutions. To tackle these issues, we propose a high-dimensional feature selection algorithm based on multiobjective differential evolution. First, a population initialization strategy is designed by integrating feature weights and redundancy indices, where the population is divided into four subpopulations to improve the diversity and uniformity of the initial population. Then, a multiobjective selection mechanism is developed, in which feature weights guide the mutation process. The solution quality is further enhanced through nondominated sorting, with preference given to solutions with lower classification error, effectively balancing global exploration and local exploitation. Finally, an adaptive grid mechanism is applied in the objective space to identify densely populated regions and detect duplicated solutions. Experimental results on 11 UCI datasets of varying difficulty demonstrate that the proposed method significantly outperforms several state-of-the-art multiobjective feature selection approaches regarding feature selection performance.
Code (0)
등록된 구현이 없습니다.
Tasks
Computational Efficiencyfeature selectionMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
MOFSRank: A Multiobjective Evolutionary Algorithm for Feature Selection in Learning to Rank
Learning to rank has attracted increasing interest in the past decade, due to its wide applications in the areas like document retrieval and collaborative filtering. Feature selection for learning to rank is to select a…
Collaborative Filteringfeature selectionLearning-To-RankMultiobjective Optimization of Classifiers by Means of 3-D Convex Hull Based Evolutionary Algorithm
Finding a good classifier is a multiobjective optimization problem with different error rates and the costs to be minimized. The receiver operating characteristic is widely used in the machine learning community to analy…
Binary ClassificationClassificationEvolutionary Algorithmsfeature selection+3A Performance Investigation of Multimodal Multiobjective Optimization Algorithms in Solving Two Types of Real-World Problems
In recent years, multimodal multiobjective optimization algorithms (MMOAs) based on evolutionary computation have been widely studied. However, existing MMOAs are mainly tested on benchmark function sets such as the 2019…
feature selectionMultiobjective OptimizationMultiobjective Programming for Type-2 Hierarchical Fuzzy Inference Trees
This paper proposes a design of hierarchical fuzzy inference tree (HFIT). An HFIT produces an optimum treelike structure, i.e., a natural hierarchical structure that accommodates simplicity by combining several low-dimen…
Classificationfeature selectionTime Series AnalysisTime Series Regression+1Experimental Analysis of Design Elements of Scalarizing Functions-based Multiobjective Evolutionary Algorithms
In this paper we systematically study the importance, i.e., the influence on performance, of the main design elements that differentiate scalarizing functions-based multiobjective evolutionary algorithms (MOEAs). This cl…
Combinatorial OptimizationEvolutionary Algorithms