{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T12:46:01Z","timestamp":1784205961570,"version":"3.55.0"},"reference-count":47,"publisher":"MIT Press","issue":"7","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Neural Computation"],"published-print":{"date-parts":[[2017,7]]},"abstract":"<jats:p>The area under the ROC curve (AUC) is a widely used performance measure in machine learning. Increasingly, however, in several applications, ranging from ranking to biometric screening to medicine, performance is measured not in terms of the full area under the ROC curve but in terms of the partial area under the ROC curve between two false-positive rates. In this letter, we develop support vector algorithms for directly optimizing the partial AUC between any two false-positive rates. Our methods are based on minimizing a suitable proxy or surrogate objective for the partial AUC error. In the case of the full AUC, one can readily construct and optimize convex surrogates by expressing the performance measure as a summation of pairwise terms. The partial AUC, on the other hand, does not admit such a simple decomposable structure, making it more challenging to design and optimize (tight) convex surrogates for this measure.<\/jats:p><jats:p>Our approach builds on the structural SVM framework of Joachims ( 2005 ) to design convex surrogates for partial AUC and solves the resulting optimization problem using a cutting plane solver. Unlike the full AUC, where the combinatorial optimization needed in each iteration of the cutting plane solver can be decomposed and solved efficiently, the corresponding problem for the partial AUC is harder to decompose. One of our main contributions is a polynomial time algorithm for solving the combinatorial optimization problem associated with partial AUC. We also develop an approach for optimizing a tighter nonconvex hinge loss\u2013based surrogate for the partial AUC using difference-of-convex programming. Our experiments on a variety of real-world and benchmark tasks confirm the efficacy of the proposed methods.<\/jats:p>","DOI":"10.1162\/neco_a_00972","type":"journal-article","created":{"date-parts":[[2017,5,31]],"date-time":"2017-05-31T18:01:02Z","timestamp":1496253662000},"page":"1919-1963","source":"Crossref","is-referenced-by-count":23,"title":["Support Vector Algorithms for Optimizing the Partial Area under the ROC Curve"],"prefix":"10.1162","volume":"29","author":[{"given":"Harikrishna","family":"Narasimhan","sequence":"first","affiliation":[{"name":"John A. Paulson School of Engineering and Applied Sciences, Harvard University, Cambridge, MA 02138, U.S.A."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shivani","family":"Agarwal","sequence":"additional","affiliation":[{"name":"Department of Computer and Information Science, University of Pennsylvania, Philadelphia, PA 19104, U.S.A."}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"281","reference":[{"key":"B1","author":"Agarwal S.","year":"2011","journal-title":"Proceedings of the SIAM Conference on Data Mining"},{"key":"B2","doi-asserted-by":"publisher","DOI":"10.1021\/ci9003865"},{"key":"B3","first-page":"393","volume":"6","author":"Agarwal S.","year":"2005","journal-title":"Journal of Machine Learning Research"},{"key":"B5","author":"Burges C.","year":"2005","journal-title":"Proceedings of the 22nd Conference on Machine Learning"},{"key":"B6","doi-asserted-by":"publisher","DOI":"10.1162\/neco.2007.19.3.792"},{"key":"B7","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-012-5325-4"},{"key":"B8","volume-title":"Advances in neural information processing systems","volume":"16","author":"Cortes C.","year":"2004"},{"key":"B9","doi-asserted-by":"publisher","DOI":"10.1007\/BF00994018"},{"key":"B10","doi-asserted-by":"publisher","DOI":"10.1162\/15324430260185628"},{"key":"B11","doi-asserted-by":"publisher","DOI":"10.1111\/1541-0420.00071"},{"key":"B12","author":"Frank A.","year":"2010","journal-title":"UCI machine learning repository"},{"key":"B13","doi-asserted-by":"publisher","DOI":"10.1162\/jmlr.2003.4.6.933"},{"key":"B14","author":"Gao W.","year":"2015","journal-title":"Proceedings of the 24th International Conference on Artificial Intelligence"},{"key":"B15","doi-asserted-by":"crossref","first-page":"115","DOI":"10.7551\/mitpress\/1113.003.0010","volume-title":"Advances in Large Margin Classifiers","author":"Herbrich R.","year":"2000"},{"key":"B16","doi-asserted-by":"publisher","DOI":"10.1186\/1756-0500-7-25"},{"issue":"1","key":"B17","first-page":"1","volume":"7","author":"Hsu M.-J.","year":"2012","journal-title":"Computational Statistics"},{"key":"B18","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775067"},{"key":"B19","author":"Joachims T.","year":"2005","journal-title":"Proceedings of the 22nd International Conference on Data Mining"},{"key":"B20","author":"Joachims T.","year":"2006","journal-title":"Proceedings of the 12th ACM International Conference on knowledge Discovery and Data Mining"},{"key":"B21","doi-asserted-by":"publisher","DOI":"10.1021\/ci049641u"},{"key":"B22","volume-title":"Advances in Neural Information Processing Systems","volume":"27","author":"Kar P.","year":"2014"},{"key":"B23","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-11-314"},{"key":"B24","doi-asserted-by":"publisher","DOI":"10.1145\/1233321.1233326"},{"key":"B25","doi-asserted-by":"publisher","DOI":"10.1038\/ncomms7169"},{"key":"B26","doi-asserted-by":"publisher","DOI":"10.1121\/1.1911889"},{"key":"B27","first-page":"516","volume":"28","author":"Narasimhan H.","year":"2013","journal-title":"Proceedings of the 30th International Conference on Machine Learning"},{"key":"B28","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487674"},{"key":"B29","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.135"},{"key":"B30","author":"Paisitkriangkrai S.","year":"2014","journal-title":"Proceedings of the 13th European Conference on Computer Vision"},{"key":"B31","doi-asserted-by":"publisher","DOI":"10.1093\/biostatistics\/1.2.123"},{"key":"B32","doi-asserted-by":"publisher","DOI":"10.1002\/prot.20865"},{"key":"B33","author":"Rakotomamonjy A.","year":"2012","journal-title":"Proceedings of the 29th International Conference on Machine Learning"},{"key":"B34","doi-asserted-by":"publisher","DOI":"10.1145\/1540276.1540288"},{"key":"B35","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2011.03.022"},{"key":"B36","first-page":"2233","volume":"10","author":"Rudin C.","year":"2009","journal-title":"Journal of Machine Learning Research"},{"key":"B37","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijforecast.2014.07.002"},{"key":"B38","doi-asserted-by":"publisher","DOI":"10.1162\/NECO_a_00336"},{"issue":"1","key":"B39","first-page":"289","volume":"22","author":"Tao P. D.","year":"1997","journal-title":"Acta Mathematica Vietnamica"},{"key":"B40","first-page":"1453","volume":"6","author":"Tsochantaridis I.","year":"2005","journal-title":"Journal of Machine Learning Research"},{"key":"B41","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2014.2360397"},{"key":"B42","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2008.07.008"},{"key":"B43","doi-asserted-by":"publisher","DOI":"10.1093\/biostatistics\/kxq052"},{"key":"B44","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401980"},{"key":"B45","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401985"},{"key":"B46","author":"Yu C.-N. J.","year":"2009","journal-title":"Proceedings of the 26th Annual International Conference on Machine Learning"},{"key":"B47","author":"Yue Y.","year":"2007","journal-title":"Proceedings of the 30th Annual International Conference on Research and Development in Information Retrieval"},{"key":"B48","doi-asserted-by":"publisher","DOI":"10.1162\/08997660360581958"}],"container-title":["Neural Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mitpressjournals.org\/doi\/pdf\/10.1162\/NECO_a_00972","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T21:53:03Z","timestamp":1750283583000},"score":1,"resource":{"primary":{"URL":"https:\/\/direct.mit.edu\/neco\/article\/29\/7\/1919-1963\/8293"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7]]},"references-count":47,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2017,7]]}},"alternative-id":["10.1162\/NECO_a_00972"],"URL":"https:\/\/doi.org\/10.1162\/neco_a_00972","relation":{},"ISSN":["0899-7667","1530-888X"],"issn-type":[{"value":"0899-7667","type":"print"},{"value":"1530-888X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,7]]}}}