Proceedings

Decision Tree Grafting From the All Tests But One Partition

Download BibTeX Cite

Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence. Machine Learning. Pages 702-706.

© 1999 International Joint Conferences on Artificial Intelligence

Abstract

Decision tree grafting adds nodes to an existing decision tree with the objective of reducing prediction error. A new grafting algorithm is presented that considers one set of training data only for each leaf of the initial decision tree, the set of cases that fail at most one test on the path to the leaf. This new technique is demonstrated to retain the error reduction power of the original grafting algorithm while dramatically reducing compute time and the complexity of the inferred tree. Bias/variance analyses reveal that the original grafting technique operated primarily by variance reduction while the new technique reduces both bias and variance.

  1. Bauer & Kohavi, in press] E. Bauer & R. Kohavi. An empirical comparison of voting classification algo- rithms: Bagging, boosting, and variants. Machine Learning, in press.
  2. [Blake, Keogh, & Merz , 1998] C. Blake, E. Keogh, & C. J. Merz. UCI repository of machine learning databases. [Machine-readable data repository]. Uni- versity of California, Department of Information and Computer Science, Irvine, CA., 1998.
  3. [Breiman, 1996] L. Breiman. Bagging predictors. Ma- chine Learning, 24:123-140, 1996.
  4. [Freund & Schapire, 1996] Y. Freund & R. E. Schapire. Experiments with a new boosting algorithm. In Pro- ceedings of the Thirteenth International Conference on Machine Learning, pages 148-156, Bari, Italy, 1996.
  5. [Morgan Kaufmann. Geman, Bienenstock, & Doursat , 1992] S. Geman, E. Bienenstock, & R. Doursat. Neural networks and the bias/variance dilemma. Neural Computation, 4:1-48, 1992.
  6. [Kohavi & Wolpert, 1996] R. Kohavi & D. Wolpert. Bias plus variance decomposition for zero-one loss functions. In Proceedings of the 13th International Conference on Machine Learning, pages 275-283, Bari, 1996.
  7. Morgan Kaufmann. [Quinlan, 1991]
  8. J . R. Quinlan. Improved estimates for the accuracy of small disjuncts. Machine Learning, 6: 93-98, 1991.
  9. [Quinlan, 1996] J . R. Quinlan. Bagging, boosting, and C4.5. In AAAI-96, 1996.
  10. [Quinlan, 1998] J. R. Quinlan. Miniboosting decision trees. Submitted for publication, August 1998.
  11. [Quinlan & Cameron-Jones, 1995] J. R. Quinlan & R. M. Cameron-Jones. Oversearching and layered search in empirical learning. In IJCAI'95, pages 1019- 1024, Montreal, 1995. IJCAI
  12. Morgan Kaufmann.
  13. [Webb, 1996] G. I. Webb. Further experimental evi- dence against the utility of Occam's razor. Journal of Artificial Intelligence Research, 4:397-417, 1996.
  14. [Webb, 1997] G. I. Webb. Decision tree grafting. In IJCAI-97: Fifteenth International Joint Conference on Artificial Intelligence, pages 846-851, Nagoya, Japan, August 1997.
  15. Morgan Kaufmann.

References were extracted automatically from the PDF and may contain errors.

Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards