Estimating class membership probabilities using classifier learners

AISTATS 2005 - Proceedings of the 10th International Workshop on Artificial Intelligence and Statistics

Volumn , Issue , 2005, Pages 198-205

  Langford, John ^a   Zadrozny, Bianca ^b  

^a TOYOTA TECHNOLOGICAL INSTITUTE AT CHICAGO   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ACCURATE ESTIMATION; BINARY CLASSIFICATION; CLASS PROBABILITIES; CLASSIFIER LEARNING; DATA SETS; ERROR RATE; MEMBERSHIP PROBABILITY;

ARTIFICIAL INTELLIGENCE; LEARNING ALGORITHMS; PROBABILITY;

ESTIMATION;

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

References (17)

1. S. Agarwal, T. Graepel, R. Herbrich, S. Har-Peled and D. Roth (2004). Generalization bounds for the Area under an ROC curve. Technical report UIUCDCS-R-2004-2433, Computer Science Department, University of Illinois at Urbana-Champaign.
2. P. Bartlett and A. Tewari (2004). Sparseness versus estimating conditional probabilities: Some asymptotic results. In Proceedings of the 17th Annual Conference on Learning Theory (COLT-2004), 564-578. Springer-Verlag.
3. P. Bennett (2000). Assessing the Calibration of Naive Bayes' Posterior Estimates (2000). Technical Report CMU-CS-00-155, Computer Science Department, Carnegie Mellon University.
4. R. Caruana, A. Niculescu-Mizil (2004). Data mining in metric space: an empirical analysis of supervised learning performance criteria. In Proceedings of the Tenth International Conference on Knowledge Discovery and Data Mining (KDD-2004), 69-78. ACM Press.
5. C. L. Blake and C. J. Merz (1998). UCI Repository of machine learning databases [http://www.ics.uci.edu/~mlearn/MLRepository]. Irvine, CA: University of California, Department of Information and Computer Science.
6. Y. Freund and R. E. Schapire (1997). A decision-theoretic generalization of on-line learning and an application to boosting. In Journal of Computer and System Sciences, 55:1, 119-139.
7. O. M. Halck (2002). Using Hard Classifiers to Estimate Conditional Class Probabilities. In Proceedings of the European Conference on Machine Learning (ECML-2002), 124-134, Springer.
8. S. Hettich and S. D. Bay (1999). The UCI KDD Archive [http://kdd.ics.uci. edu]. Irvine, CA: University of California, Department of Information and Computer Science.
9. Y. LeCun, L. Bottou, G. Orr, and K. Muller (1998). Efficient BackProp. In G. Orr and K. Muller (eds.) Neural Networks: Tricks of the trade. Springer-Verlag.
10. D. Margineantu (2000). On class probability estimates and cost-sensitive evaluation of classifiers. In Workshop on Cost-Sensitive Learning, The Seventeenth International Conference on Machine Learning (ICML-2000).
11. J. Piatt (1999). Probabilistic Outputs for Support Vector Machines and Comparisons to Regularized Likelihood Methods. In A. Smola, P. Bartlett, B. Schölkopf, D. Schuurmans (eds.) Advances in Large Margin Classifiers, 61-74. MIT Press.
12. F. Provost and P. Domingos (2003). Tree Induction for Probability-based Rankings. In Machine Learning, 52:3, 199-216. Kluwer.
13. B. Schölkopf and A. J. Smola (2002). Learning with Kernels. MIT Press.
14. J. R. Quinlan (1993). C4.5: Programs for Machine Learning. San Mateo CA: Morgan Kaufmann.
15. I. H. Witten and E. Frank (1999). Data mining: practical machine learning tools and techniques with Java implementations [http://www.cs.waikato.ac.nz/ml/ weka/]. Morgan Kaufmann.
16. B. Zadrozny and C. Elkan (2001). Obtaining calibrated probability estimates from decision trees and naive Bayesian classifiers. In Proceedings of the Eighteenth International Conference on Machine Learning (ICML-01), 609-616. Morgan Kaufmann.
17. B. Zadrozny, J. Langford, and N. Abe (2003). Cost Sensitive Learning by Cost-Proportionate Example Weighting. In Proceedings of the 2003 IEEE International Conference on Data Mining (ICDM-03), 435-442. IEEE Press.