We explore the use of genetic programming to evolve decision trees directly for classification problems with both discrete and continuous predictors. We demonstrate that the derived hypotheses of standard algorithms can substantially deviated from the optimum. This deviation is partly due to their top-down style procedures. The performance of the system is measured on a set of real and simulated data sets and compared with the performance of well-known algorithms like CHAID, CART, C5.0, and QUEST. Proposed algorithm seems to be effective in handling problems caused by top-down style procedures of existing algorithms.

Keywords

Classification;Decision Tree;Genetic Programming;Mixed Predictors;

Language

Korean

Cited by

References

1.

Lecture Notes in Computer Science 1802, 2000.
pp.247-258

2.

Genetic and Evolutionary Computation Conference (GECCO) 2000, 2000.

3.

Machine Learning, 1997.
vol.24.
pp.123-140

4.

Classification and Regression Trees, 1984.

5.

A Computational Study of Using Genetic Algorithms to Develop Intelligent Decision Trees, 2001.