A Multi-Objective Genetic Local Search Algorithm for Optimal Feature Subset Selection

David Tian · 2016

Feature selection algorithms select the most relevant features of a data set to improve the classification performance of the machine learning classifiers trained using the data set. This paper proposes a feature selection algorithm called ultiobjective genetic local search (MOGLS) which integrates a 3-objective genetic algorithm with a local search heuristic to find feature subsets with the maximum prediction accuracy, the smallest sizes and the minimum redundancy. The performance of MOGLS is compared with 4 algorithms: a wrapper genetic algorithm, correlation-based feature selection, mutual information ranking and C4.5 on 8 datasets from the UCI machine learning repository. MOGLS performs better than or as good as the 4 algorithms on the 8 datasets.

Read the paper · More papers on PaperTik