A comparison of pruning criteria for probability trees

Machine Learning

Volumn 78, Issue 1-2, 2010, Pages 251-285

  Fierens, Daan ^a   Ramon, Jan ^a   Blockeel, Hendrik ^a   Bruynooghe, Maurice ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

Decision trees; Probability estimation; Pruning; Randomization tests

Indexed keywords

CLASS PROBABILITIES; CLASS SKEW; CLASSIFICATION ACCURACY; DATA CHARACTERISTICS; EXPERIMENTAL STUDIES; PROBABILITY ESTIMATE; PROBABILITY ESTIMATION; PROBABILITY TREES; PRUNING; RANDOMIZATION TESTS; RELATIVE PERFORMANCE;

DECISION TREES;

PROBABILITY;

EID: 77952428525     PISSN: 08856125     EISSN: 15730565     Source Type: Journal    
DOI: 10.1007/s10994-009-5147-1     Document Type: Article

References (43)

1. Blockeel, H., & De Raedt, L. (1997). Lookahead and discretization in ILP. In Proceedings of the 7th international workshop on inductive logic programming (pp. 77-85). Berlin: Springer.
2. Blockeel, H., & De Raedt, L. (1998). Top-down induction of first order logical decision trees. Artificial Intelligence, 101(1-2), 285-297. (Pubitemid 128387397)
3. Bouckaert, R. (2004). Estimating replicability of classifier learning experiments. In Proceedings of the 21st international conference on machine learning. San Mateo: Morgan Kaufmann.
4. Bradley, A. (1997). The use of the area under the ROC curve in the evaluation of machine learning algorithms. Pattern Recognition, 30, 1145-1159.
5. Caruana, R., & Niculescu-Mizil, A. (2004). Data mining in metric space: an empirical analysis of supervised learning performance criteria. In Proceedings of the 10th international conference on knowledge discovery and data mining (pp. 69-78). New York: ACM Press.
6. Chickering,D.,&Heckerman,D.(1997). Efficientapproximationsforthemarginallikelih oodofBayesiannetworkswithhiddenvariables.MachineLearning,29(2-3),181-212. (Pubitemid127510038)
7. Cohen, P., & Jensen, D. (1997). Overfitting explained. In Preliminary papers of the 6th international workshop on artificial intelligence and statistics (pp. 115-122).
8. Domingos, P. (1998). Occam's two razors: the sharp and the blunt. In Proceedings of the 4th international conference on knowledge discovery and data mining (pp. 37-43).
9. Dougherty, J., Kohavi, R., & Sahami, M. (1995). Supervised and unsupervised discretization of continuous features. In A. Prieditis & S. Russell (Eds.), Proceedings of the 12th international conference on machine learning (pp. 194-202). San Mateo: Morgan Kaufmann.
10. Džeroski, S., & Lavrač, N. (2001). Relational data mining. Berlin: Springer.
11. Esposito,F.,Malerba,D.,&Semeraro,G.(1997). Acomparativeanalysisofmethodsforpruningdecisiontrees. IEEETransactionsonPatternAnalysisandMachineIntelligence,19(5),476-491. (Pubitemid127762239)
12. Fawcett, T. (2001). Using rule sets to maximize ROC performance. In Proceedings of the 2001 IEEE international conference on data mining (pp. 131-138). New York: IEEE Press.
13. Ferri, C., Flach, P., & Hernandez-Orallo, J. (2003a). Decision trees for ranking: effect of new smoothing methods, new splitting criteria and simple pruning methods. Tech. Rep.
14. Ferri, C., Flach, P., & Hernandez-Orallo, J. (2003b). Improving the AUC of probabilistic estimation trees. In Proceedings of 14th European conference on machine learning. Berlin: Springer.
15. Ferri, C., Hernandez-Orallo, J., & Salido, M. A. (2003c). Volume under the ROC surface for multi-class problems. In Proceedings of 14th European conference on machine learning (pp. 108-120). Berlin: Springer.
16. Fierens, D., Ramon, J., Blockeel, H., & Bruynooghe, M. (2005). A comparison of approaches for learning probability trees. In Proceedings of 16th European conference on machine learning (pp. 556-563).
17. Fierens, D., Ramon, J., Blockeel, H., & Bruynooghe, M. (2007). A comparison of pruning criteria for probability trees. Tech. Rep. No. CW 488, Department of Computer Science, Katholieke Universiteit Leuven.
18. Frank, E., & Witten, I. H. (1998). Using a permutation test for attribute selection in decision trees. In Proceedings of the 15th international conference on machine learning (ICML-98) (pp. 152-160). San Mateo: Morgan Kaufmann.
19. Friedman, N., Geiger, D., & Goldszmidt, M. (1997). Bayesian network classifiers. Machine Learning, 29, 131-163.
20. Friedman, N., & Goldszmidt, M. (1998). Learning Bayesian networks with local structure. In M. Jordan (Ed.), Learning in graphical models (pp. 421-459). Dordrecht: Kluwer Academic.
21. Getoor, L., Friedman, N., Koller, D., & Pfeffer, A. (2001). Learning probabilistic relational models. In S. Džeroski & N. Lavrač (Eds.), Relational data mining (pp. 307-334). Berlin: Springer.
22. Grossman, D., & Domingos, P. (2004). Learning Bayesian network classifiers by maximizing conditional likelihood. In Proceedings of 21st international conference on machine learning. San Mateo: Morgan Kaufmann.
23. Hastie, T., Tibshirani, R., & Friedman, J. (2001). The elements of statistical learning. Berlin: Springer.
24. Heckerman, D., Dickering, D., Meek, C., Rounthwaite, R., & Kadie, C. (2000). Dependency networks for inference, collaborative filtering, and data visualization. Journal of Machine Learning Research, 1, 49-75.
25. Jensen, D., & Cohen, P. (2000). Multiple comparisons in induction algorithms. Machine Learning, 38(3), 309-338.
26. Jensen, D., & Schmill, M. (1997). Adjusting for multiple comparisons in decision tree pruning. In Proceedings of the 3rd international conference on knowledge discovery and data mining. New York: ACM Press.
27. Jensen, D., Neville, J., & Rattigan, M. (2003). Randomization tests for relational learning. Tech. Rep. No.03-05, Department of Computer Science, University of Massachusetts.
28. Kersting, K., & De Raedt, L. (2007). Bayesian logic programming: theory and tool. In An introduction to statistical relational learning. Cambridge: MIT Press.
29. Kramer, S., De Raedt, L., & Helma, C. (2001). Molecular feature mining in HIV data. In Proceedings of the 7th international conference on knowledge discovery and data mining (pp. 136-143). New York: ACM Press.
30. Ling, C., & Yan, R. (2003). Decision tree with better ranking. In Proceedings of the 20th international conference on machine learning (pp. 480-487). San Mateo: Morgan Kaufmann.
31. McCallum, A., Nigam, K., Rennie, J., & Seymore, K. (1999). A machine learning approach to building domain-specific search engines. In Proceedings of the 16th international joint conference on artificial intelligence (pp. 662-667).
32. Mehta, M., Rissanen, J., & Agrawal, R. (1995). MDL-based decision tree pruning. In Proceedings of the 1st international conference on knowledge discovery and data mining (pp. 216-221).
33. Merz, C., & Murphy, P. (1996). UCI repository of machine learning databases, http://www.ics.uci.edu/mlearn/MLRepository.html.
34. Neville, J., Jensen, D., Friedland, L., & Hay, M. (2003). Learning relational probability trees. In Proceedings of the 9th international conference on knowledge discovery and data mining. New York: ACM Press.
35. Oates, T., & Jensen, D. (1998). Large datasets lead to overly complex models: an explanation and a solution. In Proceedings of the 4th international conference on knowledge discovery and data mining.
36. Provost, F., & Domingos, P. (2003). Tree induction for probability-based ranking. Machine Learning, 52, 199-216.
37. Quinlan, J. (1993). C4.5: Programs for machine learning. San Mateo: Morgan Kaufmann.
38. Quinlan, J., & Rivest, R. (1989). Inferring decision trees using the Minimum Description Length principle. Information and Computation, 80, 227-248.
39. Schwarz, G. (1978). Estimating the dimension of a model. Annals of Statistics, 6, 461-464.
40. Van Assche, A., Vens, C., Blockeel, H., & Džeroski, S. (2006). First order random forests: learning relational classifiers with complex aggregates. Machine Learning, 64(1-3), 149-182. (Pubitemid 44320250)
41. Wallace, C., & Patrick, J. (1993). Coding decision trees. Machine Learning, 11, 7-22.
42. Wang, B., & Zhang, H. (2006). Improving the ranking performance of decision trees. In Proceedings of the 17th European conference on machine learning (pp. 461-472). Berlin: Springer.
43. Zadrozny, B., & Elkan, C. (2001). Obtaining calibrated probability estimates from decision trees and naive Bayesian classifiers. In Proceedings of the 18th international conference on machine learning (pp. 609- 616). San Mateo: Morgan Kaufmann.