On Pruning and Averaging Decision Trees

Proceedings of the 12th International Conference on Machine Learning, ICML 1995

Volumn , Issue , 1995, Pages 430-437

  Oliver, Jonathan J ^a   Hand, David J ^b  

^a MONASH UNIVERSITY   (Australia)

^b OPEN UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONALLY EFFICIENT; EMPIRICAL COMPARISON; METHOD OF AVERAGING; OPTIMAL PRUNING;

DECISION TREES;

EID: 85152618715     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (26)

1. L.R. Bahl, P.F. Brown, P.V. deSouza, and R.L. Mercer (1989). A tree-based statistical language model for natural language speech recognition. IEEE Transactions on Acoustics, Speech, and Signal Processing, 37:1001-1008.
2. R.A. Baxter and J.J. Oliver (1994). MDL and MML: Similarities and differences. Technical report TR 207, Department of Computer Science, Monash University, Clayton, Victoria 3168, Australia.
3. L. Breiman, J.H. Friedman, R.A. Olshen, and C.J. Stone (1984). Classification and Regression Trees. Wadsworth, Belmont.
4. W.L. Buntine (1990). A Theory of Learning Classification Rules. PhD thesis, School of Computing Science in the University of Technology, Sydney.
5. W.L. Buntine (1992). Learning classification trees. Statistics and Computing, 2:63-73.
6. W.L. Buntine (1993). Personal communication.
7. W.L. Buntine and T. Niblett (1992). A further comparison of splitting rules for decision-tree induction. Machine Learning, 8:75-85.
8. L.A. Clark and D. Pregibon (1992). Tree-based models. In J.M. Chambers and T.J. Hastie, editors, Statistical Models in S, pages 377-420. Wadsworth and Brooks, California.
9. S.B. Gelfand, C.S. Ravishankar, and E.J. Delp (1991). An iterative growing and pruning algorithm for classification tree design. IEEE Transactions on Pattern Analysis and Machine Intelligence, 13(2):163-174.
10. T. Hastie and D. Pregibon (1990). Shrinking trees. Technical report, AT&T Bell Laboratories, Murray Hill, New Jersey 07974, USA.
11. I. Kononenko (1992). Combining decisions of multiple rules. In B. du Boulay and V. Sgurev, editors, Artificial Intelligence V: Methodology, Systems, Applications, pages 87-96. Elsevier Science, Amsterdam.
12. S.W. Kwok and C. Carter (1990). Multiple decision trees. In R.D. Schachter, T.S. Levitt, L.N. Kanal, and J.F. Lemmer, editors, Uncertainty in Artificial Intelligence 4, pages 327-335. Elsevier Science, Amsterdam.
13. J. Mingers (1989). An empirical comparison of selection measures for decision-tree induction. Machine Learning, 3:319-342.
14. P.M. Murphy and D.W. Aha (1992). UCI repository of machine learning databases.
15. J.J. Oliver, D.L. Dowe, and C.S. Wallace (1992). Inferring decision graphs using the minimum message length principle. In A. Adams and L. Sterling, editors, Proceedings of the 5th Australian Joint Conference on Artificial Intelligence, pages 361-367. World Scientific, Singapore.
16. J.J. Oliver and D.J. Hand (1994a). Averaging over decision stumps. In Lecture Notes in Artificial Intelligence 784, Machine Learning: ECML- 94, pages 231-241. Springer-Verlag, Berlin.
17. J.J. Oliver and D.J. Hand (1994b). Introduction to minimum encoding inference. Technical report TR 4-94, Dept. of Statistics, Open Uni., Walton Hall, Milton Keynes, MK7 6AA, UK. Also available as TR 205 Dept. Computer Science, Monash Uni., Clayton, Vic 3168, Australia.
18. J.J. Oliver and D.J. Hand (1996). Averaging over decision trees. Journal of Classification, To appear. An extended version is available as Technical Report TR 5-94, Department of Statistics, Open University, Walton Hall, Milton Keynes, MK7 6AA, UK.
19. J.R. Quinlan (1986). Induction of decision trees. Machine Learning, 1:81-106.
20. J.R. Quinlan (1992). Learning with continuous classes. In A. Adams and L. Sterling, editors, Proceedings of the 5th Australian Joint Conference on Artificial Intelligence, pages 343-348. World Scientific, Singapore.
21. J.R. Quinlan (1993). C4-5: Programs for Machine Learning. Morgan Kaufmann, San Mateo, CA.
22. J.R. Quinlan and R.L. Rivest (1989). Inferring decision trees using the minimum description length principle. Information and Computation, 80:227- 248.
23. J. Rissanen (1983). A universal prior for integers and estimation by minimum description length. Annals of Statistics, 11:416-431.
24. J. Rissanen (1987). Stochastic complexity. Journal of the Royal Statistical Society (Series B), 49:223-239.
25. C. Schaffer (1992). Deconstructing the digit recognition problem. In Machine Learning: Proceedings of the Ninth International Workshop, pages 394-399.
26. C.S. Wallace and J.D. Patrick (1993). Coding decision trees. Machine Learning, 11:7-22.