Small Sample Decision Tree Pruning

Proceedings of the 11th International Conference on Machine Learning, ICML 1994

Volumn , Issue , 1994, Pages 335-342

  Weiss, Sholom M ^a   Indurkhya, Nitin ^b  

^a RUTGERS UNIVERSITY   (United States)

^b UNIVERSITY OF SYDNEY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

MACHINE LEARNING;

10-FOLD CROSS-VALIDATION; CROSS VALIDATION; NOISY DATA; PERFORMANCE; SMALL SAMPLES; TREE PRUNING; TREE SELECTION; WEAKEST LINKS;

DECISION TREES;

EID: 33747426160     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1016/B978-1-55860-335-6.50048-9     Document Type: Conference Paper

References (21)

1. [Apt6 et al, 1994] C. Apt6, F. Damerau, and S. Weiss. A tomated Learning of Decison Rules for Text Categorization. Technical Report R C 18879, I B M TJ. Watson Research Center, 1994. To appear in A C M Transactions on Office Information Systems.
2. [Breiman et al, 1984] L. Breiman, J. Friedman, R. Olshen, and C. Stone. Classification and Regression Tress Wadsworth, Monterrey, Ca., 1984.
3. [Cestnik and Bratko, 1991] B. Cestnik and I. Bratko. O estimating probabilities in tree pruning. In Machine Learning, EWSL-91, Berlin, 1991. Springer Verlag.
4. [Cohen, 1993] W . Cohen. Efficient pruning methods for separate-and-conquer rule learning systems. In Proceedings ofIJCAI-93, pages 988-994, Chambery, 1993.
5. [Crawford, 1989] S. Crawford. Extensions to the cart alg rithm. International Journal of Man-Machine Studies, 31:197-217,1989.
6. [Efron, 1982] B. Efron. The Jackknife, the Bootstrap and Other Resampling Plans. SIAM, Philadelphia, Pa., 1982
7. [Efron, 1983] B. Efron. Estimating the error rate of a p diction rule. Journal of the American Statistical Association, 78:316-333,1983.
8. [Hassibi and Stork, 1993] B. Hassibi and D. Stork. Secon order derivatives for network pruning: Optimal brain surgeon. In Advances in Neural Information Processing Systems 5, pages 164-171. Morgan Kaufmann, San Mateo, CA, 1993.
9. [Mitchell, 1990] T. Mitchell. The need for biases in lear ing generalizations. In Readings in Machine Learning, pages 184-191. Morgan Kaufmann, San Mateo, CA, 1990.
10. [Quinlan, 1987] J. Quinlan. Simplifying decision trees. International Journal of Man-Machine Studies, 27:221-234,1987.
11. [Quinlan, 1993] J. Quinlan. C45: Programs for Machine Learning. Morgan Kaufmann, 1993.
12. [Schaffer, 1992a] C. Schaffer. Deconstructing the digit recognition problem. In Proceedings of the Ninth International Conference on Machine Learning, pages 394-399, San Mateo, CA, 1992. Morgan Kaufmann.
13. [Schaffer, 1992b] C. Schaffer. Sparse data and the effect of overfitting avoidance in decision tree induction. In Proceedings of AAAI-92, pages 147-152, Cambridge, M A, 1992. M I T Press.
14. [Schaffer, 1993] C. Schaffer. Overfitting avoidance as bia Machine Learning, 10:153-178,1993.
15. [Shibata, 1981] R. Shibata. A n optimal selection of regres sion variables. Biometrika, 68:45-54,1981.
16. [Utgoff, 1986] P. Utgoff. Shift of bias for inductive concept learning. In Machine Learning: An Artificial Intelligence Approach. Volume 2, pages 107-148. Morgan Kaufmann, San Mateo, CA, 1986.
17. [Watrous, 1991] R. Watrous. Current status of petersonbarney vowel formant data. Journal of the Acoustical Society of America, 89(3), 1991.
18. [Weiss and Indurkhya, 1993] S. Weiss and N. Indurkhya. Optimized Rule Induction. IEEE EXPERT, 8(6):61-69, 1993.
19. [Weiss and Indurkhya, 1994] S. Weiss and N. Indurkhya. Decision tree pruning: Biased or optimal? submitted for publication, 1994.
20. [Weiss, 1991] S. Weiss. Small sample error rate estimatio for k-nearest neighbor classifiers. IEEE Transactions on Pattern Analysis and Machine Intelligence, 13(3):285-289,1991.
21. [Wolpert, 1992] D. Wolpert. On overfitting avoidance as bias. Technical Report SFI TR 92-03-5001, The Sante Fe Institute, 1992.