Estimating class probabilities in random forests

Proceedings - 6th International Conference on Machine Learning and Applications, ICMLA 2007

Volumn , Issue , 2007, Pages 211-216

  Boström, Henrik ^a  

^a UNIVERSITY OF SKÖVDE   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; EDUCATION; EXPERIMENTS; FINANCIAL DATA PROCESSING; FREQUENCY ESTIMATION; LAPLACE TRANSFORMS; LEARNING SYSTEMS; PROBABILITY; RANDOM PROCESSES; ROBOT LEARNING;

AREA UNDER THE ROC CURVE (AUC); BRIER SCORE; CLASS PROBABILITIES; CLASSIFICATION TREES; INTERNATIONAL CONFERENCES; LAPLACE ESTIMATE; MACHINE-LEARNING; PROBABILITY ESTIMATE; PROBABILITY ESTIMATIONS; RANDOM FORESTS; SMALL SAMPLES; UCI REPOSITORY;

ESTIMATION;

EID: 47349133606     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICMLA.2007.45     Document Type: Conference Paper

References (16)

1. E. Bauer and R. Kohavi. An empirical comparison of voting classification algorithms: Bagging, boosting, and variants. Machine Learning, 36(1-2): 105-139, 1999.
2. C. Blake and C. Merz. UCI repository of machine learning databases, 1998.
3. A. Bradley. The use of the area under the roc curve in the evaluation of machine learning algorithms. Pattern Recognition, 30(6): 1145-1159, 1997.
4. L. Breiman. Bagging predictors. Machine Learning, 24(2): 123-140, 1996.
5. L. Breiman. Random forests. Machine Learning, 45(1):5-32, 2001.
6. L. Breiman, J. H. Friedman, R. A. Olshen, and C. J. Stone. Classification and Regression Trees. Wadsworth, 1984.
7. G. W. Brier. Verification of forecasts expressed in terms of probability. Monthly Weather Review, 78:1-3, 1950.
8. I. Cohen and M. Goldszmidt. Properties and benefits of calibrated classifiers. In Proceedings of the 15th European Machine Learning Conference. Springer-Verlag, 2004.
9. T. F. F. Provost and R. Kohavi. The case against accuracy estimation for comparing induction algorithms. In Proceedings of the 15th International Conference on Machine Learning, pages 445-453, 1998.
10. T. Fawcett. Using rule sets to maximize roc performance. In Proceedings of the IEEE International Conference on Data Mining, pages 131-138. IEEE Computer Society, 2001.
11. T. Fawcett. Roc graphs: Notes and practical considerations for data mining researchers. Technical report, HP Laboratories, Palo Alto, 2003.
12. C. Ferri, P. Flach, and J. Hernndez-Orallo. Improving the auc of probabilistic estimators trees. In Proceedings of the 14th European Conference on Artifical Intelligence, volume 2837, pages 121-132. Springer, 2003.
13. C. X. Ling and R. J. Yan. Decision tree with better ranking. In Proceedings of the Twentieth International Conference on Machine Learning, pages 480-487, 2003.
14. D. Margineantu and T. Dietterich. Improved class probability estimates from decision tree models. Technical report, Department of Computer Science, Oregon State Univ., 2002.
15. F. Provost and P. Domingos. Tree induction for probabilitybased ranking. Machine Learning, 52(3), 2003.
16. J. R. Quinlan. Induction of decision trees. Machine Learning, 1:81-106, 1986.