{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:49:35Z","timestamp":1760597375148},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2009,9,19]],"date-time":"2009-09-19T00:00:00Z","timestamp":1253318400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2010,1]]},"DOI":"10.1007\/s10994-009-5147-1","type":"journal-article","created":{"date-parts":[[2009,9,18]],"date-time":"2009-09-18T13:30:35Z","timestamp":1253280635000},"page":"251-285","source":"Crossref","is-referenced-by-count":11,"title":["A comparison of pruning criteria for probability trees"],"prefix":"10.1007","volume":"78","author":[{"given":"Daan","family":"Fierens","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Ramon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hendrik","family":"Blockeel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maurice","family":"Bruynooghe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,9,19]]},"reference":[{"key":"5147_CR1","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/3540635149_36","volume-title":"Proceedings of the 7th international workshop on inductive logic programming","author":"H. Blockeel","year":"1997","unstructured":"Blockeel, H., & De Raedt, L. (1997). Lookahead and discretization in ILP. In Proceedings of the 7th international workshop on inductive logic programming (pp. 77\u201385). Berlin: Springer."},{"issue":"1\u20132","key":"5147_CR2","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/S0004-3702(98)00034-4","volume":"101","author":"H. Blockeel","year":"1998","unstructured":"Blockeel, H., & De Raedt, L. (1998). Top-down induction of first order logical decision trees. Artificial Intelligence, 101(1\u20132), 285\u2013297.","journal-title":"Artificial Intelligence"},{"key":"5147_CR3","volume-title":"Proceedings of the 21st international conference on machine learning","author":"R. Bouckaert","year":"2004","unstructured":"Bouckaert, R. (2004). Estimating replicability of classifier learning experiments. In Proceedings of the 21st international conference on machine learning. San Mateo: Morgan Kaufmann."},{"key":"5147_CR4","doi-asserted-by":"crossref","first-page":"1145","DOI":"10.1016\/S0031-3203(96)00142-2","volume":"30","author":"A. Bradley","year":"1997","unstructured":"Bradley, A. (1997). The use of the area under the ROC curve in the evaluation of machine learning algorithms. Pattern Recognition, 30, 1145\u20131159.","journal-title":"Pattern Recognition"},{"key":"5147_CR5","first-page":"69","volume-title":"Proceedings of the 10th international conference on knowledge discovery and data mining","author":"R. Caruana","year":"2004","unstructured":"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\u201378). New York: ACM Press."},{"issue":"2\u20133","key":"5147_CR6","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1023\/A:1007469629108","volume":"29","author":"D. Chickering","year":"1997","unstructured":"Chickering, D., & Heckerman, D. (1997). Efficient approximations for the marginal likelihood of Bayesian networks with hidden variables. Machine Learning, 29(2\u20133), 181\u2013212.","journal-title":"Machine Learning"},{"key":"5147_CR7","unstructured":"Cohen, P., & Jensen, D. (1997). Overfitting explained. In Preliminary papers of the 6th international workshop on artificial intelligence and statistics (pp. 115\u2013122)."},{"key":"5147_CR8","unstructured":"Domingos, P. (1998). Occam\u2019s two razors: the sharp and the blunt. In Proceedings of the 4th international conference on knowledge discovery and data mining (pp. 37\u201343)."},{"key":"5147_CR9","first-page":"194","volume-title":"Proceedings of the 12th international conference on machine learning","author":"J. Dougherty","year":"1995","unstructured":"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\u2013202). San Mateo: Morgan Kaufmann."},{"key":"5147_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04599-2","volume-title":"Relational data mining","author":"S. D\u017eeroski","year":"2001","unstructured":"D\u017eeroski, S., & Lavra\u010d, N. (2001). Relational data mining. Berlin: Springer."},{"issue":"5","key":"5147_CR11","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1109\/34.589207","volume":"19","author":"F. Esposito","year":"1997","unstructured":"Esposito, F., Malerba, D., & Semeraro, G. (1997). A comparative analysis of methods for pruning decision trees. IEEE Transactions on Pattern Analysis and Machine Intelligence, 19(5), 476\u2013491.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"5147_CR12","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1109\/ICDM.2001.989510","volume-title":"Proceedings of the 2001 IEEE international conference on data mining","author":"T. Fawcett","year":"2001","unstructured":"Fawcett, T. (2001). Using rule sets to maximize ROC performance. In Proceedings of the 2001 IEEE international conference on data mining (pp. 131\u2013138). New York: IEEE Press."},{"key":"5147_CR13","unstructured":"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."},{"key":"5147_CR14","volume-title":"Proceedings of 14th European conference on machine learning","author":"C. Ferri","year":"2003","unstructured":"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."},{"key":"5147_CR15","first-page":"108","volume-title":"Proceedings of 14th European conference on machine learning","author":"C. Ferri","year":"2003","unstructured":"Ferri, C., Hern\u00e1ndez-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\u2013120). Berlin: Springer."},{"key":"5147_CR16","doi-asserted-by":"crossref","unstructured":"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\u2013563).","DOI":"10.1007\/11564096_54"},{"key":"5147_CR17","unstructured":"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."},{"key":"5147_CR18","first-page":"152","volume-title":"Proceedings of the 15th international conference on machine learning (ICML-98)","author":"E. Frank","year":"1998","unstructured":"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\u2013160). San Mateo: Morgan Kaufmann."},{"key":"5147_CR19","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1023\/A:1007465528199","volume":"29","author":"N. Friedman","year":"1997","unstructured":"Friedman, N., Geiger, D., & Goldszmidt, M. (1997). Bayesian network classifiers. Machine Learning, 29, 131\u2013163.","journal-title":"Machine Learning"},{"key":"5147_CR20","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/978-94-011-5014-9_15","volume-title":"Learning in graphical models","author":"N. Friedman","year":"1998","unstructured":"Friedman, N., & Goldszmidt, M. (1998). Learning Bayesian networks with local structure. In M. Jordan (Ed.), Learning in graphical models (pp. 421\u2013459). Dordrecht: Kluwer Academic."},{"key":"5147_CR21","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/978-3-662-04599-2_13","volume-title":"Relational data mining","author":"L. Getoor","year":"2001","unstructured":"Getoor, L., Friedman, N., Koller, D., & Pfeffer, A. (2001). Learning probabilistic relational models. In S.\u00a0D\u017eeroski & N. Lavra\u010d (Eds.), Relational data mining (pp. 307\u2013334). Berlin: Springer."},{"key":"5147_CR22","volume-title":"Proceedings of 21st international conference on machine learning","author":"D. Grossman","year":"2004","unstructured":"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."},{"key":"5147_CR23","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-21606-5","volume-title":"The elements of statistical learning","author":"T. Hastie","year":"2001","unstructured":"Hastie, T., Tibshirani, R., & Friedman, J. (2001). The elements of statistical learning. Berlin: Springer."},{"key":"5147_CR24","first-page":"49","volume":"1","author":"D. Heckerman","year":"2000","unstructured":"Heckerman, D., Chickering, D., Meek, C., Rounthwaite, R., & Kadie, C. (2000). Dependency networks for inference, collaborative filtering, and data visualization. Journal of Machine Learning Research, 1, 49\u201375.","journal-title":"Journal of Machine Learning Research"},{"issue":"3","key":"5147_CR25","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1023\/A:1007631014630","volume":"38","author":"D. Jensen","year":"2000","unstructured":"Jensen, D., & Cohen, P. (2000). Multiple comparisons in induction algorithms. Machine Learning, 38(3), 309\u2013338.","journal-title":"Machine Learning"},{"key":"5147_CR26","volume-title":"Proceedings of the 3rd international conference on knowledge discovery and data mining","author":"D. Jensen","year":"1997","unstructured":"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."},{"key":"5147_CR27","unstructured":"Jensen, D., Neville, J., & Rattigan, M. (2003). Randomization tests for relational learning. Tech. Rep. No. 03-05, Department of Computer Science, University of Massachusetts."},{"key":"5147_CR28","volume-title":"An introduction to statistical relational learning","author":"K. Kersting","year":"2007","unstructured":"Kersting, K., & De Raedt, L. (2007). Bayesian logic programming: theory and tool. In An introduction to statistical relational learning. Cambridge: MIT Press."},{"key":"5147_CR29","first-page":"136","volume-title":"Proceedings of the 7th international conference on knowledge discovery and data mining","author":"S. Kramer","year":"2001","unstructured":"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\u2013143). New York: ACM Press."},{"key":"5147_CR30","first-page":"480","volume-title":"Proceedings of the 20th international conference on machine learning","author":"C. Ling","year":"2003","unstructured":"Ling, C., & Yan, R. (2003). Decision tree with better ranking. In Proceedings of the 20th international conference on machine learning (pp. 480\u2013487). San Mateo: Morgan Kaufmann."},{"key":"5147_CR31","unstructured":"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\u2013667)."},{"key":"5147_CR32","unstructured":"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\u2013221)."},{"key":"5147_CR33","unstructured":"Merz, C., & Murphy, P. (1996). UCI repository of machine learning databases. http:\/\/www.ics.uci.edu\/~mlearn\/MLRepository.html ."},{"key":"5147_CR34","volume-title":"Proceedings of the 9th international conference on knowledge discovery and data mining","author":"J. Neville","year":"2003","unstructured":"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."},{"key":"5147_CR35","unstructured":"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."},{"key":"5147_CR36","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1023\/A:1024099825458","volume":"52","author":"F. Provost","year":"2003","unstructured":"Provost, F., & Domingos, P. (2003). Tree induction for probability-based ranking. Machine Learning, 52, 199\u2013216.","journal-title":"Machine Learning"},{"key":"5147_CR37","volume-title":"C4.5: Programs for machine learning","author":"J. Quinlan","year":"1993","unstructured":"Quinlan, J. (1993). C4.5: Programs for machine learning. San Mateo: Morgan Kaufmann."},{"key":"5147_CR38","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0890-5401(89)90010-2","volume":"80","author":"J. Quinlan","year":"1989","unstructured":"Quinlan, J., & Rivest, R. (1989). Inferring decision trees using the Minimum Description Length principle. Information and Computation, 80, 227\u2013248.","journal-title":"Information and Computation"},{"key":"5147_CR39","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1214\/aos\/1176344136","volume":"6","author":"G. Schwarz","year":"1978","unstructured":"Schwarz, G. (1978). Estimating the dimension of a model. Annals of Statistics, 6, 461\u2013464.","journal-title":"Annals of Statistics"},{"issue":"1\u20133","key":"5147_CR40","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/s10994-006-8713-9","volume":"64","author":"A. Assche Van","year":"2006","unstructured":"Van Assche, A., Vens, C., Blockeel, H., & D\u017eeroski, S. (2006). First order random forests: learning relational classifiers with complex aggregates. Machine Learning, 64(1\u20133), 149\u2013182.","journal-title":"Machine Learning"},{"key":"5147_CR41","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1023\/A:1022646101185","volume":"11","author":"C. Wallace","year":"1993","unstructured":"Wallace, C., & Patrick, J. (1993). Coding decision trees. Machine Learning, 11, 7\u201322.","journal-title":"Machine Learning"},{"key":"5147_CR42","first-page":"461","volume-title":"Proceedings of the 17th European conference on machine learning","author":"B. Wang","year":"2006","unstructured":"Wang, B., & Zhang, H. (2006). Improving the ranking performance of decision trees. In Proceedings of the 17th European conference on machine learning (pp.\u00a0461\u2013472). Berlin: Springer."},{"key":"5147_CR43","first-page":"609","volume-title":"Proceedings of the 18th international conference on machine learning","author":"B. Zadrozny","year":"2001","unstructured":"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\u2013616). San Mateo: Morgan Kaufmann."}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-009-5147-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-009-5147-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-009-5147-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T21:40:27Z","timestamp":1559338827000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-009-5147-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,9,19]]},"references-count":43,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2010,1]]}},"alternative-id":["5147"],"URL":"https:\/\/doi.org\/10.1007\/s10994-009-5147-1","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,9,19]]}}}