Area under ROC optimisation using a ramp approximation

Proceedings of the Sixth SIAM International Conference on Data Mining

Volumn 2006, Issue , 2006, Pages 1-11

  Herschtal, Alan ^a   Raskutti, Bhavani ^a   Campbell, Peter K ^a  

^a TELSTRA RESEARCH LABORATORIES   (Australia)

Author keywords

AUC; Binary Classification; Gradient Descent; Mann Whitney Statistic; ROC

Indexed keywords

APPROXIMATION THEORY; DATA REDUCTION; HEURISTIC METHODS; NONLINEAR CONTROL SYSTEMS; OPTIMIZATION;

AUC; BINARY CLASSIFICATION; BINARY CLASSIFICATIONS; GRADIENT DESCENT; MANN-WHITNEY STATISTICS; ROC;

ALGORITHMS;

EID: 33745470550     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972764.1     Document Type: Conference Paper

References (16)

1. D. Bamber, The area above the ordinal dominance graph and the area below the receiver operating characteristic graph. J. Math. Psych., 12:387-415, 1975.
2. A. P. Bradley. The use of the area under the roc curve in the evaluation of machine learning algorithms. Pattern Recognition, 30(7):1145-1159, 1997.
3. C. Cortes and M. Mohri. AUC Optimization vs. Error Rate Minimization. In Advances in Neural Information Processing Systems 16. MIT Press, Cambridge MA, 2004.
4. Y. Freund, R. Iyer, R. E. Schapire, and Y. Singer. An Efficient Boosting Algorithm for Combining Prefer ences. Journal of Machine Learning Research, 4:933-969, 2004.
5. A. Herschtal and B. Raskutti. Optimising Area Under the ROC Curve Using Gradient Descent. In Proceedings of the Twenty-first International Conference on Machine Learning ICML04, 2004.
6. T. Joachims. Text Categorization with Support Vector Machines: Learning with Many Relevant Features. In Proceedings of the Tenth European Conference on Machine Learning ECML98, 1998.
7. R. Kohavi. A study of cross-validation and bootstrap for accuracy estimation and model selection. In International Joint Conference on Artificial Intelligence, 1995.
8. H. B. Mann and D. R. Whitney. On a test whether one of two random variables is stochastically larger than the other. Ann. Math. Statist., 18:50-60, 1947.
9. M. J. McPhaden. http://www.pmel.noaa.gov/tao, 2005.
10. C. Perlich, F. Provost, and J. S. Simonoff. Tree Induction vs. Logistic Regression: A Learning Curve Analysis. Journal of Machine Learning Research, 4:211-255, 2003.
11. J. Platt. Fast training of support vector machines using sequential minimal optimization, 1998.
12. J. R. Quinlan. C4-5: Programs for Machine Learning. Morgan Kaufmann Publishers, Inc., 1993.
13. J. R. Quinlan. http://www.rulequest.com/see5-unix.html, 2004.
14. V. Vapnik. Statistical Learning Theory. Wiley, New York, 1998.
15. G. M. Weiss and F. Provost. Learning when training data are costly: The effect of class distribution on tree induction. Journal of Artificial Intelligence Research, 19(2003):315-354, 2003.
16. L. Yan, R. Dodier, M. C. Mozer, and R. Wolniewicz. Optimizing classifier performance via approximation to the wilcoxon-mann-whitney statistic. In Proceedings of the Twentieth Intl. Conf. on Machine Learning, pages 848-855. AAAI Press, Menlo Park, CA, 2003.