Decision tree pruning as a search in the state space

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 667 LNAI, Issue , 1993, Pages 165-184

  Esposito, Floriana ^a   Malerba, Donate ^a   Semeraro, Giovanni ^a  

^a UNIVERSITY OF BARI   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CLASSIFICATION (OF INFORMATION); MACHINE LEARNING;

BIASED ESTIMATES; BRANCH PRUNING; DECISION TREE INDUCTION; EVALUATION FUNCTION; OPTIMIZATION PROBLEMS; PREDICTIVE ACCURACY; PRUNING METHODS; SEARCH STRATEGIES;

DECISION TREES;

EID: 85016318442     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-56602-3_135     Document Type: Conference Paper

References (17)

1. L. Breiman, J. Friedman, R. Olshen, C. Stone: Classification and regression trees. Belmont, CA: Wadsworth International 1984
2. J. R. Quinlan: Induction of decision trees. Machine Learning 1, 81-106 (1986)
3. J. R. Quinlan: Simplifying decision trees. International Journal of Man-Machine Studies 27, 221-234 (1987) (also appeared in: B. R. Gaines, J. H. Boose (eds.): Knowledge Acquisition for Knowledge-Based Systems. Academic Press 1988)
4. M. Gams, N. Lavrac: Review of five empirical learning systems within a proposed schemata. In: I. Bratko, N. Lavrac (eds.): Progress in Machine Learning. Wilmslow: Sigma Press 1987
5. J. Mingers: An empirical comparison of selection measures for decision-tree induction. Machine Learning 3, 319-342 (1989)
6. J. Mingers: An empirical comparison of pruning methods for decision tree induction. Machine Learning 4, 227-243 (1989)
7. B. Cestnik, I. Kononenko, I. Bratko: ASSISTANT 86: Aknowledge-elicitation tool for sophisticated users. In: I. Bratko, N. Lavrac (eds.): Progress in Machine Learning. Wilmslow: Sigma Press 1987
8. J. R. Quinlan: Determinate literals in inductive logic programming. Proceedings of the IJCAI 91. San Mateo, CA: Morgan Kaufmann 1991, pp. 746-750
9. T. Niblett: Constructing decision trees in noisy domains. In: I. Bratko, N. Lavrac (eds.): Progress in Machine Learning. Wilmslow: Sigma Press 1987
10. A. V. Aho, J. E. Hopcroft, J. D. Ullman: The design and analysis of computer algorithms. Reading, MA: Addison Wesley 1974
11. F. Esposito, D. Malerba, G. Semeraro: Pruning methods in decision tree induction: a unifying view. Technical report (1992)
12. T. Niblett, I. Bratko: Learning decision rules in noisy domains. Proceedings of Expert Systems 86. Cambridge: University Press 1986
13. B. Cestnik, I. Bratko: On estimating probabilities in tree pruning. Proceedings of the EWSL-91. Berlin: Springer-Verlag 1991, pp. 138-150
14. A. Barr, E. Feigenbaum: The handbook of artificial intelligence, (Vol. 1). Reading, MA: Addison Wesley 1981
15. S. B. Gelfand, C. S. Ravishankar, E. J. Delp: An iterative growing and pruning algorithm for classification tree design. IEEE Transactions on Pattern Analysis and Machine Intelligence PAMI-13, 2, 163-174 (1991)
16. W. Buntine, T. Niblett: A further comparison of splitting rules for decision-tree induction. Machine Learning 8, 75-85 (1992)
17. C. Schaffer: Deconstructing the digit recognition problem. In: Machine Learning: Proceedings of the Ninth International Workshop (ML92). San Mateo, CA: Morgan Kaufmann (1992), pp. 394-399