Abstract

Feature selection in high-dimensional data is a large-scale sparse and discrete optimization problem. Most evolutionary algorithms are designed to tackle continuous optimization problems. However, when dealing with high-dimensional feature selection tasks, they often suffer from poor population diversity and are computationally expensive. To address these challenges, this work introduces a roulette wheel-based level learning evolutionary algorithm (RWLLEA). RWLLEA integrates two key components. Firstly, it employs a leveled population mode. Individuals from higher levels provide guidance to those at lower levels during the evolutionary process, thereby exploring the potential combinatorial effects among features. Secondly, recognizing the characteristics associated with the high-dimensional feature selection task, a roulette wheel-based update method is devised to dynamically reduce search space and harmonize the algorithm's exploitation and exploration capacities across different stages. The performance of the proposed method was evaluated by comparing it with six other feature selection techniques across a range of fifteen diverse datasets. The experimental findings demonstrate that the proposed method can achieve a reduced feature set with a shorter runtime and exhibit superior classification accuracy.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call