{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T09:02:41Z","timestamp":1777626161579,"version":"3.51.4"},"reference-count":29,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2011,4,1]],"date-time":"2011-04-01T00:00:00Z","timestamp":1301616000000},"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":["ACM Trans. Intell. Syst. Technol."],"published-print":{"date-parts":[[2011,4]]},"abstract":"<jats:p>We describe and evaluate two algorithms for Neyman-Pearson (NP) classification problem which has been recently shown to be of a particular importance for bipartite ranking problems. NP classification is a nonconvex problem involving a constraint on false negatives rate. We investigated batch algorithm based on DC programming and stochastic gradient method well suited for large-scale datasets. Empirical evidences illustrate the potential of the proposed methods.<\/jats:p>","DOI":"10.1145\/1961189.1961200","type":"journal-article","created":{"date-parts":[[2012,10,12]],"date-time":"2012-10-12T20:56:02Z","timestamp":1350075362000},"page":"1-19","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Batch and online learning algorithms for nonconvex neyman-pearson classification"],"prefix":"10.1145","volume":"2","author":[{"given":"Gilles","family":"Gasso","sequence":"first","affiliation":[{"name":"LITIS INSA, Rouen, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aristidis","family":"Pappaioannou","sequence":"additional","affiliation":[{"name":"NEC Labs, Princeton, NJ"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marina","family":"Spivak","sequence":"additional","affiliation":[{"name":"NEC Labs, Princeton, NJ"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L\u00e9on","family":"Bottou","sequence":"additional","affiliation":[{"name":"NEC Labs, Princeton, NJ"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,5,6]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"Andrieu L. Cohen G. and V&amp;#225;zquez Abad F. 2007. Stochastic programming with probability constraints. http:\/\/fr.arxiv.org\/abs\/0708.0281.  Andrieu L. Cohen G. and V&amp;#225;zquez Abad F. 2007. Stochastic programming with probability constraints. http:\/\/fr.arxiv.org\/abs\/0708.0281."},{"key":"e_1_2_1_2_1","unstructured":"Arrow K. Hurwicz L. and Uzawa H. 1958. Studies in Nonlinear Programming. Stanford University Press.  Arrow K. Hurwicz L. and Uzawa H. 1958. Studies in Nonlinear Programming. Stanford University Press."},{"key":"e_1_2_1_3_1","first-page":"1741","article-title":"Considering cost asymmetry in learning classifiers","volume":"7","author":"Bach F. R.","year":"2006","unstructured":"Bach , F. R. , Heckerman , D. , and Horvitz , E. 2006 . Considering cost asymmetry in learning classifiers . J. Mach. Learn. Res. 7 , 1741 . Bach, F. R., Heckerman, D., and Horvitz, E. 2006. Considering cost asymmetry in learning classifiers. J. Mach. Learn. Res. 7, 1741.","journal-title":"J. Mach. Learn. Res."},{"key":"e_1_2_1_4_1","volume-title":"Tutorial of the Conference on Advances in Neural Information Processing Systems (NIPS).","author":"Bottou L.","year":"2007","unstructured":"Bottou , L. 2007 . Learning with large datasets . Tutorial of the Conference on Advances in Neural Information Processing Systems (NIPS). Bottou, L. 2007. Learning with large datasets. Tutorial of the Conference on Advances in Neural Information Processing Systems (NIPS)."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2008.02.025"},{"key":"e_1_2_1_6_1","volume-title":"Introduction to Numerical Linear Algebra and Optimisation","author":"Ciarlet P. G.","unstructured":"Ciarlet , P. G. 1989. Introduction to Numerical Linear Algebra and Optimisation . Cambridge University Press . Ciarlet, P. G. 1989. Introduction to Numerical Linear Algebra and Optimisation. Cambridge University Press."},{"key":"e_1_2_1_7_1","first-page":"2671","article-title":"Ranking the best instances","volume":"8","author":"Cl","year":"2007","unstructured":"Cl &amp;#233;men&amp;#231;on, S. and Vayatis , N. 2007 . Ranking the best instances . J. Mach. Learn. Res. 8 , 2671 -- 2699 . Cl&amp;#233;men&amp;#231;on, S. and Vayatis, N. 2007. Ranking the best instances. J. Mach. Learn. Res. 8, 2671--2699.","journal-title":"J. Mach. Learn. Res."},{"key":"e_1_2_1_8_1","volume-title":"Bottou Eds.","volume":"21","author":"Cl","unstructured":"Cl &amp;#233;men&amp;#231;on, S. and Vayatis , N . 2009. Overlaying classifiers: A practical approach for optimal ranking. In Advances in Neural Information Processing Systems, D. Koller, D. Schuurmans, Y. Bengio, and L . Bottou Eds. , Vol. 21 . MIT Press, Cambridge, MA, 313--320. Cl&amp;#233;men&amp;#231;on, S. and Vayatis, N. 2009. Overlaying classifiers: A practical approach for optimal ranking. In Advances in Neural Information Processing Systems, D. Koller, D. Schuurmans, Y. Bengio, and L. Bottou Eds., Vol. 21. MIT Press, Cambridge, MA, 313--320."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/1248547.1248609"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143870"},{"key":"e_1_2_1_11_1","unstructured":"Cortes C. and Mohri M. 2004. Auc optimization vs. error rate minimization. In Advances in Neural Information Processing Systems 16 S. Thrun L. K. Saul and B. Sch&amp;#246;lkopf Eds. MIT Press Cambridge MA.  Cortes C. and Mohri M. 2004. Auc optimization vs. error rate minimization. In Advances in Neural Information Processing Systems 16 S. Thrun L. K. Saul and B. Sch&amp;#246;lkopf Eds. MIT Press Cambridge MA."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.29"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1038\/nmeth1019"},{"key":"e_1_2_1_14_1","unstructured":"G&amp;#228;rtner B. Giesen J. and Jaggi M. 2009. An exponential lower bound on the complexity of regularization paths. CoRR abs\/0903.4817.  G&amp;#228;rtner B. Giesen J. and Jaggi M. 2009. An exponential lower bound on the complexity of regularization paths. CoRR abs\/0903.4817."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390208"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2006.870610"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102399"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1038\/nmeth1113"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143904"},{"key":"e_1_2_1_20_1","volume-title":"Advances in Neural Information Processing Systems","volume":"2","author":"Mozer M.","unstructured":"Mozer , M. , Dodier , R. , Colagrosso , M. , Guerra-Salcedo , C. , and Wolniewicz , R . 2002. Prodding the ROC curve: Constrained optimization of classifier performance . In Advances in Neural Information Processing Systems , Vol. 2 . MIT Press, Cambridge, MA, 1409--1416. Mozer, M., Dodier, R., Colagrosso, M., Guerra-Salcedo, C., and Wolniewicz, R. 2002. Prodding the ROC curve: Constrained optimization of classifier performance. In Advances in Neural Information Processing Systems, Vol. 2. MIT Press, Cambridge, MA, 1409--1416."},{"key":"e_1_2_1_21_1","volume-title":"Advances in Kernel Methods&amp;#8212;Support Vector Learning, B. Sch&amp;#246;lkopf","author":"Platt J.","unstructured":"Platt , J. 1999. Fast training of support vector machines using sequential minimal optimization . In Advances in Kernel Methods&amp;#8212;Support Vector Learning, B. Sch&amp;#246;lkopf , C. J. C. Burges, and A. J. Smola Eds., MIT Press , Cambridge, MA , 185--208. Platt, J. 1999. Fast training of support vector machines using sequential minimal optimization. In Advances in Kernel Methods&amp;#8212;Support Vector Learning, B. Sch&amp;#246;lkopf, C. J. C. Burges, and A. J. Smola Eds., MIT Press, Cambridge, MA, 185--208."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.856955"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1021\/pr801109k"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1530509100"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.1990.137648"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623494274313"},{"key":"e_1_2_1_27_1","volume-title":"Adaptation and Learning in Automatic Systems","author":"Tsypkin Y. Z.","unstructured":"Tsypkin , Y. Z. 1971. Adaptation and Learning in Automatic Systems . Academic Press , New York . Tsypkin, Y. Z. 1971. Adaptation and Learning in Automatic Systems. Academic Press, New York."},{"key":"e_1_2_1_28_1","volume-title":"Statistical Learning Theory","author":"Vapnik V. N.","unstructured":"Vapnik , V. N. 1998. Statistical Learning Theory . John Wiley & amp;amp; Sons. Vapnik, V. N. 1998. Statistical Learning Theory. John Wiley &amp;amp; Sons."},{"key":"e_1_2_1_29_1","volume-title":"Proceedings of the 25th Conference on Uncertainty in Artificial Intelligence.","author":"Yu J.","unstructured":"Yu , J. , Vishwanathan , S. , and Zhang , J . 2009. The entire quantile path of a risk-agnostic svm classifier . In Proceedings of the 25th Conference on Uncertainty in Artificial Intelligence. Yu, J., Vishwanathan, S., and Zhang, J. 2009. The entire quantile path of a risk-agnostic svm classifier. In Proceedings of the 25th Conference on Uncertainty in Artificial Intelligence."}],"container-title":["ACM Transactions on Intelligent Systems and Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1961189.1961200","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1961189.1961200","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:59:50Z","timestamp":1750244390000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1961189.1961200"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,4]]}},"alternative-id":["10.1145\/1961189.1961200"],"URL":"https:\/\/doi.org\/10.1145\/1961189.1961200","relation":{},"ISSN":["2157-6904","2157-6912"],"issn-type":[{"value":"2157-6904","type":"print"},{"value":"2157-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,4]]},"assertion":[{"value":"2010-04-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2010-08-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2011-05-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}