Iterative Feature Construction For Improving Inductivelearning Algorithms

摘要

Inductive learning algorithms, in general, perform well on data that have been pre-processed to reduce complexity. By themselves they arc not particularly effective in reducing data complexity while learning difficult concepts. Feature construction has been shown to reduce complexity of space spanned by input data. In this paper, we present an iterative algorithm for enhancing the performance of any inductive learning process through the use of feature construction as a pre-processing step. We apply the procedure on three learning methods, namely genetic algorithms, C4.5 and lazy learner, and show improvement in performance.