(Enter summary)
Abstract: The area under an ROC curve (AUC) is a criterion used in many applications
to measure the quality of a classification algorithm. However,
the objective function optimized in most of these algorithms is the error
rate and not the AUC value. We give a detailed statistical analysis of the
relationship between the AUC and the error rate, including the first exact
expression of the expected value and the variance of the AUC for a fixed
error rate. Our results show that the average AUC is... (Update)
Cited by: More
Optimizing Area Under Roc Curve with SVMs - Alain Rakotomamon Jy (2004)
(Correct)
Learning Mixtures of Localized Rules by Maximizing the .. - Sing, Beerenwinkel.. (2004)
(Correct)
Active bibliography (related documents): More All
0.5: Profit-Optimal Model and Target Size Selection with.. - Alan Abrahams Firass
(Correct)
0.4: AUC Maximizing Support Vector Learning - Brefeld, Scheffer (2005)
(Correct)
0.1: The Effects of Stochastic Neural Activity in a.. - Bruce, White.. (1999)
(Correct)
Similar documents based on text: More All
0.5: Distribution Kernels Based on Moments of Counts - Corinna Cortes Corinna
(Correct)
0.4: Context-Free Recognition with Weighted Automata - Cortes, Mohri (2000)
(Correct)
0.3: Regular Approximation Of Context-Free Grammars Through.. - Mohri, Nederhof (2000)
(Correct)
Related documents from co-citation: More All
2: Using Rule Sets to Maximize ROC Performance
- Fawcett - 2001
BibTeX entry: (Update)
C. Cortes and M. Mohri, `AUC optimization vs. error rate minimization ', in Advances in Neural Information Processing Systems 16, eds., Sebastian Thrun, Lawrence Saul, and Bernhard Sch olkopf, MIT Press, Cambridge, MA, (2004). http://citeseer.ist.psu.edu/cortes03auc.html More
@misc{ cortes04auc,
author = "C. Cortes and M. Mohri",
title = "AUC optimization vs. error rate minimization",
text = "C. Cortes and M. Mohri, `AUC optimization vs. error rate minimization ',
in Advances in Neural Information Processing Systems 16, eds., Sebastian
Thrun, Lawrence Saul, and Bernhard Sch olkopf, MIT Press, Cambridge, MA,
(2004).",
year = "2004",
url = "citeseer.ist.psu.edu/cortes03auc.html" }
Citations (may not include all citations):
1262
Classification and Regression Trees (context) - Breiman, Friedman et al. - 1984
85
Analysis and visualization of classifier performance: Compar..
- Provost, Fawcett - 1997
75
The meaning and use of the area under a receiver operating c.. (context) - Hanley, McNeil - 1982
56
Signal Detection Theory and ROC Analysis (context) - Egan - 1975
41
An efficient boosting algorithm for combining preferences
- Freund, Iyer et al. - 1998
13
Learning decision trees using the area under the ROC curve
- Ferri, Flach et al. - 2002
6
New York: Wiley (context) - Green, Swets et al. - 1966
3
Optimizing Classifier Performance Via the Wilcoxon-Mann-Whit..
- Yan, Dodier et al. - 2003
2
Measuring lift quality in database marketing (context) - Piatetsky-Shapiro, Steingold - 2000
2
Prodding the ROC curve (context) - Mozer, Dodier et al. - 2002
1
Evaluation of prediction models for marketing campaigns (context) - Rosset, Neumann et al. - 2001
1
A decision theoretical generalization of online learning and.. (context) - Freund, Schapire - 1995
1
Ranking-methods for flexible evaluation and efficient compar.. (context) - Rosset - 1999
1
Targeting customer groups using gain and cost matrix; a mark.. (context) - Chauchat, Rakotomalala et al. - 2001
1
logistic regression: A learning curve analysis (context) - Perlich, Provost et al. - 2003
Documents on the same site (http://books.nips.cc/nips16.html): More
Error Bounds for Transductive Learning via Compression.. - Derbeko, El-Yaniv, Meir (2003)
(Correct)
Maximum Likelihood Estimation of a Stochastic.. - Pillow, Paninski.. (2003)
(Correct)
Online Passive-Aggressive Algorithms - Crammer, Dekel, Shalev-Shwartz.. (2003)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC