An extension of the receiver operating characteristic curve and AUC-Optimal classification

Neural Computation

Volumn 24, Issue 10, 2012, Pages 2789-2824

  Takenouchi, Takashi ^a   Komori, Osamu ^b   Eguchi, Shinto ^b,c  

^a FUTURE UNIVERSITY HAKODATE   (Japan)

^b INSTITUTE OF STATISTICAL MATHEMATICS   (Japan)

^c GRADUATE UNIVERSITY FOR ADVANCED STUDIES   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; AREA UNDER THE CURVE; ARTICLE; AUTOMATED PATTERN RECOGNITION; HUMAN; PROBLEM SOLVING; RECEIVER OPERATING CHARACTERISTIC;

ALGORITHMS; AREA UNDER CURVE; HUMANS; PATTERN RECOGNITION, AUTOMATED; PROBLEM SOLVING; ROC CURVE;

EID: 84872680082     PISSN: 08997667     EISSN: 1530888X     Source Type: Journal    
DOI: 10.1162/NECO_a_00336     Document Type: Article

References (28)

1. Amari, S., & Nagaoka, H. (2000). Methods of information geometry. New York: Oxford University Press.
2. Baker, S. G. (2003). The central role of receiver operating characteristic (ROC) curves in evaluating tests for the early detection of cancer. Journal of the National Cancer Institute, 95, 511-515.
3. Blake, C. L., & Merz, C. J. (1998). UCI repository of machine learning databases. Department of Information and Computer Science, University of California.
4. Boyd, S., & Vandenberghe, L. (2004). Convex optimization. Cambridge: Cambridge University Press.
5. Brefeld, U., & Scheffer, T. (2005). AUC maximizing support vector learning. In Proceedings of the ICML 2005 Workshop on ROC Analysis in Machine Learning. Bonn, Germany.
6. Chang, C., & Lin, C. (2011). LIBSVM: A library for support vector machines. ACM Transactions on Intelligent Systems and Technology, 2(3), 27.
7. Cortes, C., & Mohri, M. (2004). AUC optimization vs. error rate minimization. In S. Thrün, L. K. Saul, & B. Schölkopf (Eds.), Advances in neural information processing systems, 16 (pp. 313-320). Cambridge, MA: MIT Press.
8. Freund, Y., Iyer, R., Schapire, R., & Singer, Y. (2003). An efficient boosting algorithm for combining preferences. Journal of Machine Learning Research, 4, 933-969.
9. Freund, Y., & Schapire, R. E. (1997). A decision-theoretic generalization of online learning and an application to boosting. Journal of Computer and System Sciences, 55(1), 119-139.
10. Friedman, J. H., Hastie, T., & Tibshirani, R. (2000). Additive logistic regression: A statistical view of boosting. Annals of Statistics, 28, 337-407.
11. Ghosh, A., & Chaudhuri, P. (2005). On data depth and distribution-free discriminant analysis using separating surfaces. Bernoulli, 11(1), 1-28.
12. Hampel, F. R., Rousseeuw, P. J., Ronchetti, E. M., & Stahel, W. A. (1986). Robust statistics. New York:Wiley.
13. Herschtal, A., & Raskutti, B. (2004). Optimising area under the ROC curve using gradient descent. In Proceedings of the Twenty-First International Conference onMachine Learning (p. 49). New York: ACM.
14. Kanamori, T., Takenouchi, T., Eguchi, S., & Murata, N. (2007). Robust loss functions for boosting. Neural Computation, 19(8), 2183-2244.
15. Komori, O., & Eguchi, S. (2010). A boosting method for maximizing the partial area under the ROC curve. BMC Bioinformatics, 11, 314.
16. Lebanon, G., & Lafferty, J. (2001). Boosting and maximum likelihood for exponential models (Tech. Rep. No. CMU-CS-01-144). Pittsburgh, PA: School of Computer Science, Carnegie Mellon University.
17. Mason, L., Baxter, J., Bartlett, P., & Frean, M. (1999). Boosting algorithms as gradient descent in function space. In S. A. Solla, T.K. Leen, & K.-R.Müller (Eds.), Advances in neural information processing systems, 12 (pp. 512-518). Cambridge, MA: MIT Press.
18. Murata, N., Takenouchi, T., Kanamori, T., & Eguchi, S. (2004). Information geometry of U-boost and Bregman divergence. Neural Computation, 16(7), 1437-1481.
19. Pencina, M., D'Agostino Sr., R., D'Agostino Jr., R., & Vasan, R. (2008). Evaluating the added predictive ability of a new marker: From area under the ROC curve to reclassification and beyond. Statistics in Medicine, 27(2), 157-172.
20. Pepe, M. S. (Ed.). (2003). The statistical evaluation of medical tests for classification and prediction. New York: Oxford University Press.
21. Pepe, M. S., Longton, G., Anderson, G. L., & Schummer, M. (2003). Selecting differentially expressed genes from microarray experiments. Biometrics, 59, 133-142.
22. Pepe, M. S., & Thompson, M. L. (2000). Combining diagnostic test results to increase accuracy. Biostatistics, 1, 123-140.
23. Qi, Y., Joseph, Z. B., & Seetharaman, J. K. (2006). Evaluation of different biological data and computational classification methods for use in protein interaction prediction. Proteins: Structure, Function, and Bioinformatics, 63, 490-500.
24. R Development Core Team. (2011). R: A language and environment for statistical computing [Computer software manual].Vienna, Austria. http://www.R-project.org.
25. Rudin, C., & Schapire, R. (2009).Margin-based ranking and an equivalence between AdaBoost and RankBoost. Journal of Machine Learning Research, 10, 2193-2232.
26. Schölkopf, B., & Smola, A. J. (2001). Learning with kernels: Support vector machines, regularization, optimization, and beyond. Cambridge, MA: MIT Press.
27. Takenouchi, T., Eguchi, S., Murata, T., & Kanamori, T. (2008). Robust boosting algorithm against mislabeling in multi-class problems. Neural Computation, 20(6), 1596-1630.
28. Vapnik, V. (1998). Statistical learning theory. New York: Wiley.