An empirical study on class probability estimates in decision tree learning

作者：Jiang Liangxiao^*; Li Chaoqun

来源：Journal of Software, 2011, 6(7): 1368-1373.

DOI：10.4304/jsw.6.7.1368-1373

• Class probabilities
• Critical problems
• Data sets
• Decision tree learning
• Empirical studies
• Laplace estimate
• Maximum-likelihood estimate
• Ranking performance

Decision tree is one of the most effective and widely used models for classification and ranking and has received a great deal of attention from researchers in the domain of data mining and machine learning. A critical problem in decision tree learning is how to estimate the classmembership probabilities from decision trees. In this paper, we firstly survey all kinds of class probability estimation methods, mainly include the maximum-likelihood estimate, the Laplace estimate, the m-estimate, the similarity-weighted estimate, the naive Bayes-based estimate, and so on. Then, we provide an empirical study on the classification and ranking performance of the resulting decision trees using different class probability estimation methods. The experimental results based on a large number of UCI data sets verify our conclusions.

• 出版日期2011