{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T12:34:45Z","timestamp":1754483685174,"version":"3.37.3"},"reference-count":34,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61502001"],"award-info":[{"award-number":["61502001"]}],"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"],"award-info":[{"award-number":["1708085MF166"]}],"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":[[2018]]},"DOI":"10.1109\/access.2018.2869860","type":"journal-article","created":{"date-parts":[[2018,9,12]],"date-time":"2018-09-12T18:54:38Z","timestamp":1536778478000},"page":"52004-52013","source":"Crossref","is-referenced-by-count":2,"title":["An Adaptive Robust Online Method for AUC Maximization"],"prefix":"10.1109","volume":"6","author":[{"given":"Fan","family":"Cheng","sequence":"first","affiliation":[]},{"given":"Xia","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Chuang","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Jianfeng","family":"Qiu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6447-2053","authenticated-orcid":false,"given":"Lei","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143870"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.109"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2009.53"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2018.02.016"},{"journal-title":"Adam A method for stochastic optimization","year":"2014","author":"kingma","key":"ref34"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2017.05.013"},{"key":"ref11","first-page":"233","article-title":"Online AUC maximization","author":"zhao","year":"2011","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref12","first-page":"441","article-title":"On the generalization ability of online learning algorithms for pairwise loss functions","author":"kar","year":"2013","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref13","first-page":"906","article-title":"One-pass AUC optimization","author":"gao","year":"2013","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref14","first-page":"2568","article-title":"An adaptive gradient method for online AUC maximization","author":"ding","year":"2015","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"ref15","first-page":"451","article-title":"Stochastic online AUC maximization","author":"ying","year":"2016","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2011.11.020"},{"key":"ref17","first-page":"2666","article-title":"Kernelized online imbalanced learning with fixed budgets","author":"hu","year":"2015","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"ref18","first-page":"204","article-title":"Fast convergence of online pairwise learning algorithms","author":"boissier","year":"2016","journal-title":"Artificial Intelligence and Statistics"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2017.04.022"},{"key":"ref28","first-page":"259","article-title":"Computational complexity of linear large margin classification with ramp loss","author":"maibing","year":"2015","journal-title":"Artificial Intelligence and Statistics"},{"key":"ref4","first-page":"627","article-title":"Receiver operating characteristic (ROC) curve analysis for medical diagnostic test evaluation","volume":"4","author":"hajian-tilaki","year":"2013","journal-title":"Caspian Journal of Internal Medicine"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2015.05.008"},{"key":"ref3","first-page":"51","article-title":"Boosting approach for score level fusion in multimodal biometrics based on AUC maximization","volume":"2","author":"parviz","year":"2011","journal-title":"J Inf Hiding Multimedia Signal Process"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/NAECON.2015.7443034"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2018.05.027"},{"key":"ref5","first-page":"1794","article-title":"Linear spatial pyramid matching using sparse coding for image classification","author":"yang","year":"2009","journal-title":"Proc Comput Vis Pattern Recognit"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102399"},{"key":"ref7","first-page":"377","article-title":"AUC maximizing support vector learning","author":"brefeld","year":"2005","journal-title":"Proc ICML Workshop ROC Anal Mach Learning"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.5121\/ijcsit.2012.4304"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2014.07.025"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-30671-1_12"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2016.2610465"},{"key":"ref22","first-page":"3195","article-title":"Fast stochastic AUC maximization with O(1\/n)-convergence rate","author":"liu","year":"2018","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref21","first-page":"3707","article-title":"Stochastic proximal algorithms for AUC maximization","author":"natole","year":"2018","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.157"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-017-5678-9"},{"key":"ref26","first-page":"2185","article-title":"Ramp loss linear programming support vector machine","volume":"15","author":"huang","year":"2014","journal-title":"J Mach Learn Res"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1100.0854"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8274985\/08463453.pdf?arnumber=8463453","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T18:39:15Z","timestamp":1643222355000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8463453\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"references-count":34,"URL":"https:\/\/doi.org\/10.1109\/access.2018.2869860","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2018]]}}}