God doesn't always shave with Occam's razor — Learning when and how to prune
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1398)
The work shows how a meta-learning technique can be successfully applied to decide when to prune, how much pruning is appropriate and what the best pruning technique is for a given learning task.
Unable to display preview. Download preview PDF.
- 1.H. Bensusan and P. Williams. Learning to learn boolean tasks by decision tree descriptors. In M. V. Someren and G. Widmer, editors, Poster Papers — 9th European Conference on Machine Learning, pages 1–11. 1997.Google Scholar
- 2.P. Brazdil, J. Gama, and B. Henery. Characterizing the applicability of classification algorithms using Meta-Level Learning. In Francesco Bergadano and Luc de Raedt, editors, Proceedings of the European Conference on Machine Learning, volume 784 of LNAI, pages 83–102, Berlin, April 1994. Springer.Google Scholar
- 3.S. Thrun et al. The monk's problems. Technical Report CMU-CS-91-197, School of Computer Science, Carnegie-Mellon University., Pittsburgh, PA-USA, 1991.Google Scholar
- 4.D. Gamberger and N. Lavrac. Conditions for Occam's Razor applicability and noise elimination. In Marteen van Someren and Gerhard Widmer, editors, Proceedings of the 9th European Conference on Machine Learning, pages 108–123. Springer, 1997.Google Scholar
- 6.P. Murphy and M. Pazzani. Exploring the decision forest: An emprical imvestigation of occam's razor in decision tree induction. Journal of Artificial Intelligence Research, 1:257–275, 1994.Google Scholar
- 7.J. R. Quinlan. C4.5: Programs for Machine Learning. Morgan Kaufmann, San Mateo, CA, USA, 1993.Google Scholar
- 8.G. Webb. Further experimental evidence against the utility of occam's razor. Journal of Artificial Intelligence Research, 4:397–417, 1996.Google Scholar
© Springer-Verlag 1998