Abstract-The goal of the feature selection process is, given a dataset described by n attributes (features), to find the minimum number m of relevant attributes which describe the data as well as the original set of attributes do. Genetic algorithms have been already used to implement feature selection algorithms. Previous algorithms presented in the literature used the predictive accuracy of a specific learning algorithm as the fitness function to maximize over the space of possible feature subsets. Such an approach to feature selection requires a large amount of CPU time to reach a good solution on large datasets. This paper presents a genetic algorithm for feature selection which improves previous results presented in the literature for genetic-based feature selection and: (i) is independent from a specific learning algorithm; (ii) requires less CPU time to reach a relevant subset of features. Reported experiments shows that proposed algorithm is at least ten times faster than standard genetic algorithm for feature selection without no loss of predictive accuracy when a learning algorithm is applied to reduced data.
In this paper, a filter approach is used and also this approach shows that the feature selection requires a large amountof CPU time to reach a good solution on large datasets REF .
Fast feature selection with genetic algorithms: a filter approach
Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97)
Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97)
Computer Science