Framework for efficient feature selection in genetic algorithm based data mining

doi:10.1016/j.ejor.2006.02.040

Framework for efficient feature selection in genetic algorithm based data mining

2007-07-01

85

PRE

AI

DOI：10.1016/j.ejor.2006.02.040

Original

Original request for help

Save

Abstract

En 中文

We present the design of more effective and efficient genetic algorithm based data mining techniques that use the concepts of feature selection. Explicit feature selection is traditionally done as a wrapper approach where every candidate feature subset is evaluated by executing the data mining algorithm on that subset. In this article we present a GA for doing both the tasks of mining and feature selection simultaneously by evolving a binary code along side the chromosome structure used for evolving the rules. We then present a wrapper approach to feature selection based on Hausdorff distance measure. Results from applying the above techniques to a real world data mining problem show that combining both the feature selection methods provides the best performance in terms of prediction accuracy and computational efficiency. (c) 2006 Elsevier B.V. All rights reserved.

Keywords:

genetic algorithms

rule learning

knowledge discover

data mining

evolutionary algorithms

Framework for efficient feature selection in genetic algorithm based data mining

Abstract

Journal

Organization