{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,29]],"date-time":"2026-09-29T03:00:01Z","timestamp":1790650801692,"version":"4.1.0"},"reference-count":44,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001381","name":"National Research Foundation Singapore","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001381","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61602185"],"award-info":[{"award-number":["61602185"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"crossref","award":["D2172480"],"award-info":[{"award-number":["D2172480"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2019,2,1]]},"DOI":"10.1109\/tkde.2018.2826011","type":"journal-article","created":{"date-parts":[[2018,4,12]],"date-time":"2018-04-12T20:26:54Z","timestamp":1523564814000},"page":"214-228","source":"Crossref","is-referenced-by-count":64,"title":["Adaptive Cost-Sensitive Online Classification"],"prefix":"10.1109","volume":"31","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8543-3953","authenticated-orcid":false,"given":"Peilin","family":"Zhao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2125-1074","authenticated-orcid":false,"given":"Yifan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0977-3600","authenticated-orcid":false,"given":"Min","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4584-3453","authenticated-orcid":false,"given":"Steven C. H.","family":"Hoi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8856-756X","authenticated-orcid":false,"given":"Mingkui","family":"Tan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Junzhou","family":"Huang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","first-page":"498","article-title":"The relaxed online maximum margin algorithm","author":"li","year":"2000","journal-title":"Proc Advances Neural Inf Process Syst"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007662407062"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2298018"},{"key":"ref32","first-page":"233","article-title":"Online AUC maximization","author":"zhao","year":"2011","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref31","first-page":"1231","article-title":"OTL: A framework of online transfer learning","author":"zhao","year":"2010","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref30","first-page":"65","article-title":"Cost sensitive online multiple kernel classification","author":"sahoo","year":"2016","journal-title":"Proc Asian Conf Mach Learn"},{"key":"ref37","first-page":"224","article-title":"Strategy-updating depending on local environment enhances cooperation in prisoners dilemma game","volume":"301","author":"zhang","year":"2017","journal-title":"Appl Math Comput"},{"key":"ref36","first-page":"551","article-title":"Online passive-aggressive algorithms","volume":"7","author":"crammer","year":"2006","journal-title":"J Mach Learn Res"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2017.2751102"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2563424"},{"key":"ref10","first-page":"973","article-title":"The foundations of cost-sensitive learning","volume":"17","author":"elkan","year":"2001","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref40","first-page":"379","article-title":"The perceptron algorithm with uneven margins","author":"li","year":"2002","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref11","first-page":"55","article-title":"Controlling the sensitivity of support vector machines","author":"veropoulos","year":"1999","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2008.239"},{"key":"ref13","article-title":"Data mining: Concepts and techniques","author":"han","year":"2011"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICPR.2010.764"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30115-8_7"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.116"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.157"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390190"},{"key":"ref19","first-page":"345","article-title":"Exact convex confidence-weighted learning","author":"crammer","year":"2009","journal-title":"Proc Advances Neural Inf Process Syst"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511810817"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2685597"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2006.17"},{"key":"ref3","first-page":"107","article-title":"Exact soft confidence-weighted learning","author":"wang","year":"2012","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref6","article-title":"Online learning: A comprehensive survey","author":"hoi","year":"2018"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972832.23"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487647"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2435209.2435213"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1961189.1961202"},{"key":"ref2","first-page":"1587","article-title":"Double updating online learning","volume":"12","author":"zhao","year":"2011","journal-title":"J Mach Learn Res"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-010-0420-4"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1037\/h0042519"},{"key":"ref20","first-page":"414","article-title":"Adaptive regularization of weight vectors","author":"crammer","year":"2009","journal-title":"Proc Advances Neural Inf Process Syst"},{"key":"ref22","first-page":"902","article-title":"Efficient second order online learning by sketching","author":"luo","year":"2016","journal-title":"Proc Advances Neural Inf Process Syst"},{"key":"ref21","first-page":"928","article-title":"Online convex programming and generalized infinitesimal gradient ascent","author":"zinkevich","year":"2003","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/0022-247X(85)90131-3"},{"key":"ref24","first-page":"1750","article-title":"Scalable adaptive stochastic optimization using random projections","author":"krummenacher","year":"2016","journal-title":"Proc Advances Neural Inf Process Syst"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/BF00275687"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1561\/0400000060"},{"key":"ref44","first-page":"2861","article-title":"The noisy power method: A meta algorithm with application","author":"hardt","year":"2014","journal-title":"Proc Advances Neural Inf Process Syst"},{"key":"ref26","first-page":"649","article-title":"Cost-sensitive online classification with adaptive regularization and its applications","author":"zhao","year":"2015","journal-title":"Proc IEEE Int Conf Data Mining"},{"key":"ref43","first-page":"1","article-title":"Optimal strategies and minimax lower bounds for online convex games","author":"abernethy","year":"2008"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2014.46"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/8606809\/08337008.pdf?arnumber=8337008","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T21:14:12Z","timestamp":1657746852000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8337008\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,1]]},"references-count":44,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2018.2826011","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,2,1]]}}}