Large-scale Multi-objective Feature Selection: A Multi-phase Search Space Shrinking Approach

TL;DR

This paper introduces LMSSS, a multi-objective evolutionary algorithm that employs search space shrinking and innovative genetic operators to efficiently select relevant features in large-scale, high-dimensional datasets, improving accuracy and reducing computation.

Contribution

The paper presents a novel large-scale multi-objective feature selection method combining search space shrinking, a ranking-based filtering, and advanced genetic operators for improved efficiency and effectiveness.

Findings

Outperforms state-of-the-art algorithms on 15 large datasets.

Reduces search space significantly before evolutionary process.

Achieves higher classification accuracy with fewer features.

Abstract

Feature selection is a crucial step in machine learning, especially for high-dimensional datasets, where irrelevant and redundant features can degrade model performance and increase computational costs. This paper proposes a novel large-scale multi-objective evolutionary algorithm based on the search space shrinking, termed LMSSS, to tackle the challenges of feature selection particularly as a sparse optimization problem. The method includes a shrinking scheme to reduce dimensionality of the search space by eliminating irrelevant features before the main evolutionary process. This is achieved through a ranking-based filtering method that evaluates features based on their correlation with class labels and frequency in an initial, cost-effective evolutionary process. Additionally, a smart crossover scheme based on voting between parent solutions is introduced, giving higher weight to the parent with better classification accuracy. An intelligent mutation process is also designed to target features prematurely excluded from the population, ensuring they are evaluated in combination with other features. These integrated techniques allow the evolutionary process to explore the search space more efficiently and effectively, addressing the sparse and high-dimensional nature of large-scale feature selection problems. The effectiveness of the proposed algorithm is demonstrated through comprehensive experiments on 15 large-scale datasets, showcasing its potential to identify more accurate feature subsets compared to state-of-the-art large-scale feature selection algorithms. These results highlight LMSSS's capability to improve model performance and computational efficiency, setting a new benchmark in the field.