{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:14:58Z","timestamp":1761621298473,"version":"3.37.3"},"reference-count":55,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2018,4,1]],"date-time":"2018-04-01T00:00:00Z","timestamp":1522540800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61332010"],"award-info":[{"award-number":["61332010"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Research Grants Council of the Hong Kong Special Administrative Region, China","award":["CUHK 14203314","CUHK 415113"],"award-info":[{"award-number":["CUHK 14203314","CUHK 415113"]}]},{"DOI":"10.13039\/100006112","name":"2015 Microsoft Research Asia Collaborative Research Program","doi-asserted-by":"publisher","award":["FY16-RES-THEME-005"],"award-info":[{"award-number":["FY16-RES-THEME-005"]}],"id":[{"id":"10.13039\/100006112","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Neural Netw. Learning Syst."],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1109\/tnnls.2016.2610465","type":"journal-article","created":{"date-parts":[[2017,1,27]],"date-time":"2017-01-27T19:58:35Z","timestamp":1485547115000},"page":"882-895","source":"Crossref","is-referenced-by-count":41,"title":["Online Nonlinear AUC Maximization for Imbalanced Data Sets"],"prefix":"10.1109","volume":"29","author":[{"given":"Junjie","family":"Hu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5453-476X","authenticated-orcid":false,"given":"Haiqin","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Michael R.","family":"Lyu","sequence":"additional","affiliation":[]},{"given":"Irwin","family":"King","sequence":"additional","affiliation":[]},{"given":"Anthony","family":"Man-Cho So","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-004-0160-z"},{"key":"ref38","article-title":"Fast forward selection to speed up sparse Gaussian process regression","author":"seeger","year":"2003","journal-title":"Proc Workshop AI & Statist 9"},{"key":"ref33","first-page":"1179","article-title":"Simple MKL","volume":"9","author":"rakotomamonjy","year":"2008","journal-title":"J Mach Learn Res"},{"key":"ref32","first-page":"2643","article-title":"Bounded kernel-based online learning","volume":"10","author":"orabona","year":"2009","journal-title":"J Mach Learn Res"},{"journal-title":"Introductory Lectures on Convex Optimization A Basic Course","year":"2003","author":"nesterov","key":"ref31"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2012.2228231"},{"journal-title":"Learning with kernels","year":"2002","author":"sch\u00f6lkopf","key":"ref37"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623712"},{"article-title":"Normalized Online Learning","year":"2013","author":"ross","key":"ref35"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1037\/h0042519"},{"key":"ref28","first-page":"953","article-title":"$l_{p}$\n-norm multiple kernel learning","volume":"12","author":"kloft","year":"2011","journal-title":"J Mach Learn Res"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2004.830991"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1023\/A:1012435301888"},{"key":"ref2","article-title":"AUC maximizing support vector learning","author":"brefeld","year":"2005","journal-title":"Proc ICML Workshop ROC Anal Mach Learning"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/S0031-3203(96)00142-2"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-012-5319-2"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16108-7_31"},{"key":"ref21","first-page":"25","article-title":"Kernelized online imbalanced learning with fixed budgets","author":"hu","year":"2015","journal-title":"Proc AAAI"},{"key":"ref24","first-page":"441","article-title":"On the generalization ability of online learning algorithms for pairwise loss functions","author":"kar","year":"2013","journal-title":"Proc ICML"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102399"},{"key":"ref26","first-page":"643","article-title":"A matching pursuit approach to sparse Gaussian process regression","author":"keerthi","year":"2005","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref25","first-page":"392","article-title":"Online importance weight aware updates","author":"karampatziakis","year":"2011","journal-title":"Proc Journal of Computer Science"},{"journal-title":"Sparse Learning Under Regularization Framework","year":"2011","author":"yang","key":"ref50"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2010.2103571"},{"key":"ref55","first-page":"233","article-title":"Online AUC maximization","author":"zhao","year":"2011","journal-title":"Proc ICML"},{"key":"ref54","first-page":"1587","article-title":"Double updating online learning","volume":"12","author":"zhao","year":"2011","journal-title":"J Mach Learn Res"},{"key":"ref53","first-page":"621","article-title":"Online kernel learning with a near optimal sparsity bound","author":"zhang","year":"2013","journal-title":"Proc ICML"},{"key":"ref52","article-title":"Online kernel selection: Algorithms and evaluations","author":"yang","year":"2012","journal-title":"Proc AAAI"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/060666998"},{"key":"ref11","first-page":"2568","article-title":"Adaptive subgradient methods for online AUC maximization","author":"ding","year":"2016","journal-title":"Proc AAAI"},{"key":"ref40","first-page":"1531","article-title":"Large scale multiple kernel learning","volume":"7","author":"sonnenburg","year":"2006","journal-title":"J Mach Learn Res"},{"key":"ref12","first-page":"3","article-title":"The Yahoo! music dataset and KDD-Cup’11","author":"dror","year":"2012","journal-title":"Proc KDD Cup"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2004.830985"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007662407062"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2016.03.003"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1809400.1809414"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1148\/radiology.143.1.7063747"},{"key":"ref18","article-title":"Gaussian processes for big data","author":"hensman","year":"2013","journal-title":"Proc Conf Uncertainty of Artificial Intelligence"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1015330.1015366"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-007-5003-0"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2013.2246188"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546921"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703432542"},{"key":"ref8","first-page":"551","article-title":"Online passive-aggressive algorithms","volume":"7","author":"crammer","year":"2006","journal-title":"J Mach Learn Res"},{"key":"ref7","first-page":"313","article-title":"AUC optimization vs. Error rate minimization","author":"cortes","year":"2003","journal-title":"Proc NIPS"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10677-4_98"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1162\/089976602317250933"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.149"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-007-0114-2"},{"key":"ref48","first-page":"848","article-title":"Optimizing classifier performance via an approximation to the Wilcoxon-Mann-Whitney statistic","author":"yan","year":"2003","journal-title":"Proc 20th Int Conf Mach Learn"},{"key":"ref47","first-page":"1175","article-title":"Simple and efficient multiple kernel learning by group lasso","author":"xu","year":"2010","journal-title":"Proc ICML"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2012.2200500"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/604264.604267"},{"key":"ref44","first-page":"13.1","article-title":"Generalization bounds for online learning algorithms with pairwise loss functions","author":"wang","year":"2012","journal-title":"Proc Workshop Conf"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/3147.3165"}],"container-title":["IEEE Transactions on Neural Networks and Learning Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/5962385\/8318959\/07835710.pdf?arnumber=7835710","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:26:01Z","timestamp":1642004761000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7835710\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4]]},"references-count":55,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tnnls.2016.2610465","relation":{},"ISSN":["2162-237X","2162-2388"],"issn-type":[{"type":"print","value":"2162-237X"},{"type":"electronic","value":"2162-2388"}],"subject":[],"published":{"date-parts":[[2018,4]]}}}