Obtaining calibrated probabilities from boosting

Proceedings of the 21st Conference on Uncertainty in Artificial Intelligence, UAI 2005

Volumn , Issue , 2005, Pages 413-420

  Niculescu Mizil, Alexandru ^a   Caruana, Rich ^a  

^a Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE BOOSTING; ARTIFICIAL INTELLIGENCE; CALIBRATION; FORESTRY; LEARNING SYSTEMS; PROBABILITY;

BOOSTED DECISION TREES; CALIBRATION METHOD; DECISION STUMPS; DISTORTED PROBABILITIES; ISOTONIC REGRESSION; LEARNING METHODS; POOR PERFORMANCE; POSTERIOR PROBABILITY;

DECISION TREES;

EID: 80053274482     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. M. Ayer, H. Brunk, G. Ewing,W. Reid, and E. Silverman. An empirical distribution function for sampling with incomplete information. Annals of Mathematical Statistics, 5(26):641-647, 1955.
2. C. Blake and C. Merz. UCI repository of machine learning databases, 1998.
3. W. Buntine and R. Caruana. Introduction to ind and recursive partitioning. Technical Report FIA-91-28, NASA Ames Research Center, 10 1991.
4. W. Buntine. Learning classification trees. Statistics and Computing, 2:63-73, 1992.
5. R. Caruana and A. Niculescu-Mizil. An empirical comparison of supervised learning algorithms using different performance metrics. Technical Report TR2005-1973, Cornell University, 2005.
6. Michael Collins, Robert E. Schapire, and Yoram Singer. Logistic regression, adaboost and bregman distances. Machine Learning, 48(1-3), 2002.
7. M.H. DeGroot and S.E. Fienberg. The comparison and evaluation of forecasters. Statistician, 32(1):12-22, 1982.
8. J. Friedman, T. Hastie, and R. Tibshirani. Additive logistic regression: a statistical view of boosting. The Annals of Statistics, 38(2), 2000.
9. A. Gualtieri, S. R. Chettri, R.F. Cromp, and L.F. Johnson. Support vector machine classifiers as applied to aviris data. In Proc. Eighth JPL Airborne Geoscience Workshop, 1999.
10. G. Lebanon and J. Lafferty. Boosting and maximum likelihood for exponential models. In Advances in Neural Information Processing Systems, 2001.
11. A. Niculescu-Mizil and R. Caruana. Predicting good probabilities with supervised learning. In Proc. 22th International Conference on Machine Learning (ICML'05), 2005.
12. J. Platt. Probabilistic outputs for support vector machines and comparison to regularized likelihood methods. In Adv. in Large Margin Classifiers, 1999.
13. F. Provost and P. Domingos. Tree induction for probability-based rankings. Machine Learning, 2003.
14. T. Robertson, F. Wright, and R. Dykstra. Order Restricted Statistical Inference. John Wiley and Sons, New York, 1988.
15. Saharon Rosset, Ji Zhu, and Trevor Hastie. Boosting as a regularized path to a maximum margin classifier. J. Mach. Learn. Res., 5, 2004.
16. R. Schapire, Y. Freund, P. Bartlett, andW. Lee. Boosting the margin: A new explanation for the effectiveness of voting methods. Annals of Statistics, 26(5):1651-1686, 1998. (Pubitemid 128376902)
17. B. Zadrozny and C. Elkan. Obtaining calibrated probability estimates from decision trees and naive bayesian classifiers. In ICML, 2001.
18. B. Zadrozny and C. Elkan. Transforming classifier scores into accurate multiclass probability estimates. In KDD, 2002.