{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:19:00Z","timestamp":1740169140250,"version":"3.37.3"},"reference-count":31,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61876184"],"award-info":[{"award-number":["61876184"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Humanities and Social Sciences Project of Chinese Ministry of Education","award":["18YJC870004"],"award-info":[{"award-number":["18YJC870004"]}]},{"DOI":"10.13039\/501100003995","name":"Natural Science Foundation of Anhui Province","doi-asserted-by":"publisher","award":["1708085MF166","1908085MF219"],"award-info":[{"award-number":["1708085MF166","1908085MF219"]}],"id":[{"id":"10.13039\/501100003995","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Key Program of Natural Science Project of Educational Commission of Anhui Province","award":["KJ2017A013"],"award-info":[{"award-number":["KJ2017A013"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2924263","type":"journal-article","created":{"date-parts":[[2019,6,21]],"date-time":"2019-06-21T19:50:40Z","timestamp":1561146640000},"page":"83729-83739","source":"Crossref","is-referenced-by-count":0,"title":["A Sparse Stochastic Method With Optimal Convergence Rate for Optimizing Pseudo-Linear Performance Measures"],"prefix":"10.1109","volume":"7","author":[{"given":"Fan","family":"Cheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yangxi","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianfeng","family":"Qiu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6447-2053","authenticated-orcid":false,"given":"Lei","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref31","first-page":"-71i","article-title":"Stochastic gradient descent for non-smooth optimization: Convergence results and optimal averaging schemes","author":"shamir","year":"2013","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref30","first-page":"1571","article-title":"Making gradient descent optimal for strongly convex stochastic optimization","volume":"12","author":"rakhlin","year":"2012","journal-title":"Proc ICML"},{"key":"ref10","first-page":"2568","article-title":"An adaptive gradient method for online AUC maximization","author":"ding","year":"2015","journal-title":"Proc AAAI"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1162\/NECO_a_00972"},{"key":"ref12","first-page":"603","article-title":"On the statistical consistency of algorithms for binary classification under class imbalance","author":"menon","year":"2013","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1155\/2015\/269856"},{"key":"ref14","first-page":"2123","article-title":"Optimizing F-measures by cost-sensitive classification","author":"parambath","year":"2014","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref15","first-page":"2744","article-title":"Consistent binary classification with generalized performance metrics","author":"koyejo","year":"2014","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1155\/2016\/5873769"},{"key":"ref17","first-page":"199","article-title":"Optimizing non-decomposable performance measures: A tale of two classes","author":"narasimhan","year":"2015","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref18","article-title":"Online classification with complex metrics","author":"yan","year":"2016","journal-title":"arXiv 1610 07116"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2009.03.002"},{"key":"ref28","first-page":"2543","article-title":"Dual averaging methods for regularized stochastic learning and online optimization","volume":"11","author":"xiao","year":"2010","journal-title":"J Mach Learn Res"},{"key":"ref4","first-page":"152","article-title":"A novel method of processing class imbalance and its application in transaction fraud detection","author":"zhang","year":"2018","journal-title":"Proc IEEE\/ACM 5th Int Conf Big Data Comput Appl Technol (BDCAT)"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7908-2604-3_16"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.2991\/ijcis.11.1.70"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-009-5108-8"},{"key":"ref29","first-page":"14","article-title":"Composite objective mirror descent","author":"duchi","year":"2010","journal-title":"Proc COLT"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04962-0_53"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44851-9_15"},{"key":"ref7","article-title":"Optimizing F-measure: A tale of two approaches","author":"nan","year":"2012","journal-title":"arXiv 1206 4625"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1561\/1500000062"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1162\/NECO_a_00336"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2017.01.126"},{"key":"ref20","first-page":"311","article-title":"Generalized convexity and optimization","volume":"616","author":"cambini","year":"2009","journal-title":"Lecture Notes in Economics and Mathematical Systems"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.22.8.868"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.12.7.609"},{"key":"ref24","first-page":"33","article-title":"Scalable training of L1-regularized log-linear models","author":"andrew","year":"2007","journal-title":"Proc 24th Int Conf Mach Learn"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974973.33"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1145\/2487575.2487674","article-title":"${{\\mathrm {SVM}}_{pAUC}}^{tight}$ : A new support vector method for optimizing partial AUC based on a tight convex upper bound","author":"narasimhan","year":"2013","journal-title":"Proc ACM SIGKDD Int Conf Knowledge Discovery and Data Mining"},{"key":"ref25","first-page":"311","article-title":"Bundle methods for regularized risk minimization","volume":"11","author":"teo","year":"2010","journal-title":"J Mach Learn Res"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08743458.pdf?arnumber=8743458","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,10]],"date-time":"2021-08-10T19:40:04Z","timestamp":1628624404000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8743458\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2924263","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2019]]}}}