{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T12:40:16Z","timestamp":1763642416207,"version":"3.37.3"},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61722311","U1613214","61533015"],"award-info":[{"award-number":["61722311","U1613214","61533015"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"CAS-Youth Innovation Promotion Association Scholarship","award":["2012163"],"award-info":[{"award-number":["2012163"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Cybern."],"published-print":{"date-parts":[[2019,8]]},"DOI":"10.1109\/tcyb.2018.2841046","type":"journal-article","created":{"date-parts":[[2018,6,21]],"date-time":"2018-06-21T19:07:21Z","timestamp":1529608041000},"page":"3168-3179","source":"Crossref","is-referenced-by-count":24,"title":["Lifelong Metric Learning"],"prefix":"10.1109","volume":"49","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1111-6909","authenticated-orcid":false,"given":"Gan","family":"Sun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5102-0189","authenticated-orcid":false,"given":"Cong","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ji","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2271-5870","authenticated-orcid":false,"given":"Lianqing","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2836-5944","authenticated-orcid":false,"given":"Xiaowei","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1663-2956","authenticated-orcid":false,"given":"Haibin","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1162\/NECO_a_00872"},{"key":"ref38","first-page":"3643","article-title":"Multi-task model and feature joint learning","author":"li","year":"2015","journal-title":"Proc IJCAI"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-007-5040-8"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-008-9111-x"},{"key":"ref31","first-page":"1383","article-title":"Learning task grouping and overlap in multi-task learning","author":"kumar","year":"2012","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020423"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2016.2544314"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2016.2519448"},{"key":"ref35","first-page":"2853","article-title":"The benefit of multitask representation learning","volume":"17","author":"maurer","year":"2016","journal-title":"J Mach Learn Res"},{"key":"ref34","first-page":"964","article-title":"A dirty model for multi-task learning","author":"jalali","year":"2010","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2013.2260168"},{"key":"ref40","first-page":"2078","article-title":"Sparse compositional metric learning","author":"shi","year":"2014","journal-title":"Proc AAAI"},{"key":"ref11","first-page":"1867","article-title":"Large margin multi-task metric learning","author":"parameswaran","year":"2010","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24958-7_18"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2016.2521767"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2016.2591583"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1109\/TCYB.2014.2323992","article-title":"Person reidentification by minimum classification error-based KISS metric learning","volume":"45","author":"tao","year":"2015","journal-title":"IEEE Trans Cybern"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.83"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1162\/NECO_a_00614"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1823746.1823752"},{"key":"ref19","first-page":"2089","article-title":"Learning Bregman distance functions and its application for semi-supervised clustering","author":"wu","year":"2009","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref28","article-title":"A survey on metric learning for feature vectors and structured data","author":"bellet","year":"2013","journal-title":"arXiv preprint arXiv 1306 6709"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-014-0356-z"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1561\/2200000019"},{"key":"ref3","first-page":"1217","article-title":"Semi-supervised metric learning using pairwise constraints","volume":"9","author":"baghshah","year":"2009","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2009.5206537"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007379606734"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273523"},{"key":"ref8","first-page":"761","article-title":"Online metric learning and fast similarity search","author":"jain","year":"2009","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2014.2332398"},{"key":"ref2","first-page":"1327","article-title":"Robust distance metric learning with auxiliary knowledge","author":"zha","year":"2009","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref9","first-page":"306","article-title":"An online algorithm for large scale image similarity learning","author":"chechik","year":"2009","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref1","first-page":"207","article-title":"Distance metric learning for large margin nearest neighbor classification","volume":"10","author":"weinberger","year":"2009","journal-title":"J Mach Learn Res"},{"key":"ref20","first-page":"2792","article-title":"Low-rank similarity metric learning in high dimensions","author":"liu","year":"2015","journal-title":"Proc Assoc Advance Artif Intell"},{"key":"ref45","article-title":"Return of the devil in the details: Delving deep into convolutional nets","author":"chatfield","year":"2014","journal-title":"Proc Brit Mach Vis Conf"},{"key":"ref22","first-page":"513","article-title":"Neighbourhood components analysis","author":"goldberger","year":"2005","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2016.2631887"},{"key":"ref42","first-page":"551","article-title":"Online passive-aggressive algorithms","volume":"7","author":"crammer","year":"2006","journal-title":"J Mach Learn Res"},{"key":"ref24","first-page":"615","article-title":"Robust structural metric learning","volume":"28","author":"lim","year":"2013","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref41","first-page":"507","article-title":"ELLA: An efficient lifelong learning algorithm","volume":"28","author":"ruvolo","year":"2013","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref23","first-page":"12","article-title":"Distance metric learning, with application to clustering with side-information","volume":"15","author":"xing","year":"2002","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref44","first-page":"440","article-title":"Biographies, bollywood, boom-boxes and blenders: Domain adaptation for sentiment classification","volume":"7","author":"blitzer","year":"2007","journal-title":"Proc ACL"},{"key":"ref26","first-page":"429","article-title":"Online learning in the embedded manifold of low-rank matrices","volume":"13","author":"shalit","year":"2012","journal-title":"J Mach Learn Res"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"},{"key":"ref25","first-page":"1206","article-title":"SOML: Sparse online metric learning with application to image retrieval","author":"gao","year":"2014","journal-title":"Association for the Advancement of Artificial Intelligence"}],"container-title":["IEEE Transactions on Cybernetics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6221036\/8708695\/08392504.pdf?arnumber=8392504","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T20:54:01Z","timestamp":1657745641000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8392504\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8]]},"references-count":45,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tcyb.2018.2841046","relation":{},"ISSN":["2168-2267","2168-2275"],"issn-type":[{"type":"print","value":"2168-2267"},{"type":"electronic","value":"2168-2275"}],"subject":[],"published":{"date-parts":[[2019,8]]}}}