{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T05:09:35Z","timestamp":1755925775762,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,8,11]],"date-time":"2013-08-11T00:00:00Z","timestamp":1376179200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,8,11]]},"DOI":"10.1145\/2487575.2487674","type":"proceedings-article","created":{"date-parts":[[2013,8,13]],"date-time":"2013-08-13T12:31:21Z","timestamp":1376397081000},"page":"167-175","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":19,"title":["SVM<sub>pAUC<\/sub><sup>tight<\/sup>"],"prefix":"10.1145","author":[{"given":"Harikrishna","family":"Narasimhan","sequence":"first","affiliation":[{"name":"Indian Institute of Science, Bangalore, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shivani","family":"Agarwal","sequence":"additional","affiliation":[{"name":"Indian Institute of Science, Bangalore, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,8,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972818.72"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1021\/ci9003865"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1046920.1088686"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.81"},{"key":"e_1_3_2_1_5_1","volume-title":"Nonlinear Programming","author":"Bertsekas D. P.","year":"1999","unstructured":"D. P. Bertsekas . Nonlinear Programming . Athena Scientific , Belmont, MA , 1999 . D. P. Bertsekas. Nonlinear Programming. Athena Scientific, Belmont, MA, 1999."},{"key":"e_1_3_2_1_6_1","unstructured":"S. Boyd L. Xiao and A. Mutapcic. Subgradient methods. http:\/\/www.stanford.edu\/class\/ee392o\/subgrad_method.pdf 2003. S. Boyd L. Xiao and A. Mutapcic. Subgradient methods. http:\/\/www.stanford.edu\/class\/ee392o\/subgrad_method.pdf 2003."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1586\/14737159.3.4.411"},{"key":"e_1_3_2_1_8_1","volume-title":"NIPS","author":"Cortes C.","year":"2004","unstructured":"C. Cortes and M. Mohri . AUC optimization vs. error rate minimization . In NIPS , 2004 . C. Cortes and M. Mohri. AUC optimization vs. error rate minimization. In NIPS, 2004."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1111\/1541-0420.00071"},{"key":"e_1_3_2_1_10_1","unstructured":"J. Duchi. Elastic net projections http:\/\/www.cs.berkeley.edu\/ jduchi\/projects\/proj_elastic_net.pdf 2009. J. Duchi. Elastic net projections http:\/\/www.cs.berkeley.edu\/ jduchi\/projects\/proj_elastic_net.pdf 2009."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390191"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.286.5439.531"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102399"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150429"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-009-5108-8"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1021\/ci049641u"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-11-314"},{"key":"e_1_3_2_1_18_1","volume-title":"ICML","author":"Narasimhan H.","year":"2013","unstructured":"H. Narasimhan and S. Agarwal . A structural SVM based approach for optimizing partial AUC . In ICML , 2013 . H. Narasimhan and S. Agarwal. A structural SVM based approach for optimizing partial AUC. In ICML, 2013."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487674"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1093\/biostatistics\/1.2.123"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1002\/prot.20865"},{"key":"e_1_3_2_1_22_1","volume-title":"ICML","author":"Rakotomamonjy A.","year":"2012","unstructured":"A. Rakotomamonjy . Sparse support vector infinite push . In ICML , 2012 . A. Rakotomamonjy. Sparse support vector infinite push. In ICML, 2012."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1540276.1540288"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2011.03.022"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/1577069.1755861"},{"key":"e_1_3_2_1_26_1","volume-title":"ICML","author":"Singer Y.","year":"2007","unstructured":"Y. Singer and N. Srebro . Pegasos: Primal estimated sub-gradient solver for SVM . In ICML , 2007 . Y. Singer and N. Srebro. Pegasos: Primal estimated sub-gradient solver for SVM. In ICML, 2007."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1162\/NECO_a_00336"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","article-title":"Regression shrinkage and selection via the lasso","volume":"58","author":"Tibshirani R.","year":"1994","unstructured":"R. Tibshirani . Regression shrinkage and selection via the lasso . Journal of the Royal Statistical Society, Series B , 58 : 267 -- 288 , 1994 . R. Tibshirani. Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society, Series B, 58:267--288, 1994.","journal-title":"Journal of the Royal Statistical Society, Series B"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1093\/biostatistics\/kxq052"},{"key":"e_1_3_2_1_31_1","volume-title":"AISTATS","author":"Wang Z.","year":"2009","unstructured":"Z. Wang and J. Shawe-Taylor . Large-margin structured prediction via linear programming . In AISTATS , 2009 . Z. Wang and J. Shawe-Taylor. Large-margin structured prediction via linear programming. In AISTATS, 2009."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401980"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9868.2005.00532.x"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557132"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9868.2005.00503.x"}],"event":{"name":"KDD' 13: The 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"],"location":"Chicago Illinois USA","acronym":"KDD' 13"},"container-title":["Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2487575.2487674","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2487575.2487674","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:48:44Z","timestamp":1750236524000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2487575.2487674"}},"subtitle":["a new support vector method for optimizing partial AUC based on a tight convex upper bound"],"short-title":[],"issued":{"date-parts":[[2013,8,11]]},"references-count":34,"alternative-id":["10.1145\/2487575.2487674","10.1145\/2487575"],"URL":"https:\/\/doi.org\/10.1145\/2487575.2487674","relation":{},"subject":[],"published":{"date-parts":[[2013,8,11]]},"assertion":[{"value":"2013-08-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}