{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,25]],"date-time":"2026-07-25T16:26:19Z","timestamp":1784996779737,"version":"3.55.0"},"reference-count":42,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2018,5,1]],"date-time":"2018-05-01T00:00:00Z","timestamp":1525132800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"973 Project","award":["2015CB351803"],"award-info":[{"award-number":["2015CB351803"]}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"publisher","award":["61572451"],"award-info":[{"award-number":["61572451"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"publisher","award":["61390514"],"award-info":[{"award-number":["61390514"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004739","name":"Youth Innovation Promotion Association CAS","doi-asserted-by":"publisher","award":["CX2100060016"],"award-info":[{"award-number":["CX2100060016"]}],"id":[{"id":"10.13039\/501100004739","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010261","name":"Fok Ying Tung Education Foundation","doi-asserted-by":"crossref","award":["WF2100060004"],"award-info":[{"award-number":["WF2100060004"]}],"id":[{"id":"10.13039\/501100010261","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"crossref","award":["WK2100060011"],"award-info":[{"award-number":["WK2100060011"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["FT-130101457"],"award-info":[{"award-number":["FT-130101457"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP-140102164"],"award-info":[{"award-number":["DP-140102164"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["LP-150100671"],"award-info":[{"award-number":["LP-150100671"]}],"id":[{"id":"10.13039\/501100000923","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,5]]},"DOI":"10.1109\/tnnls.2017.2690683","type":"journal-article","created":{"date-parts":[[2017,4,17]],"date-time":"2017-04-17T18:10:13Z","timestamp":1492452613000},"page":"1975-1985","source":"Crossref","is-referenced-by-count":35,"title":["On Better Exploring and Exploiting Task Relationships in Multitask Learning: Joint Model and Feature Learning"],"prefix":"10.1109","volume":"29","author":[{"given":"Ya","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5952-8753","authenticated-orcid":false,"given":"Xinmei","family":"Tian","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9640-6472","authenticated-orcid":false,"given":"Tongliang","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dacheng","family":"Tao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273499"},{"key":"ref38","first-page":"1988","article-title":"Multi-stage multi-task feature learning","author":"gong","year":"2012","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020423"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339672"},{"key":"ref31","first-page":"521","article-title":"Learning with whom to share in multi-task feature learning","author":"kang","year":"2011","journal-title":"Proc 28th Int Conf Mach Learn (ICML)"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2014.2309939"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/2086737.2086742"},{"key":"ref36","first-page":"36","article-title":"Sparsity-based generalization bounds for predictive sparse coding","author":"mehta","year":"2013","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref35","first-page":"3259","article-title":"The sample complexity of dictionary learning","volume":"12","author":"vainsencher","year":"2011","journal-title":"J Mach Learn Res"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2280272"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273558"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1963.10500830"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-007-5040-8"},{"key":"ref12","first-page":"75","article-title":"Multitask sparsity via maximum entropy discrimination","volume":"12","author":"jebara","year":"2011","journal-title":"J Mach Learn Res"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.186"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9868.2007.00627.x"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-008-9111-x"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2013.2272642"},{"key":"ref17","first-page":"1324","article-title":"Feature selection via joint embedding learning and sparse regression","volume":"22","author":"hou","year":"2011","journal-title":"Proc Int Joint Conf Artif Intell (IJCAI)"},{"key":"ref18","author":"baxter","year":"2011","journal-title":"A model of inductive bias learning"},{"key":"ref19","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1007\/978-3-540-45167-9_41","article-title":"Exploiting task relatedness for multiple task learning","author":"ben-david","year":"2003","journal-title":"Learning Theory and Kernel Machines"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2013.2291772"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.135"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2012.2187307"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.neuroimage.2011.09.069"},{"key":"ref6","first-page":"35","article-title":"Multi-task learning for classification with Dirichlet process priors","volume":"8","author":"xue","year":"2007","journal-title":"J Mach Learn Res"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2015.01.014"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014067"},{"key":"ref8","first-page":"613","article-title":"Infinite predictor subspace models for multitask learning","author":"rai","year":"2010","journal-title":"Proc Int Conf Artif Intell Statist"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102479"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2015.2399233"},{"key":"ref9","first-page":"339","article-title":"Multi-task feature learning via efficient l 2, 1-norm minimization","author":"liu","year":"2009","journal-title":"Proc 25th Conf Uncertainty Artif Intell"},{"key":"ref1","first-page":"142","article-title":"Boosted multi-task learning for face verification with applications to Web image and video search","author":"wang","year":"2009","journal-title":"Proc IEEE Conf Comput Vis Pattern Recognit"},{"key":"ref20","author":"maurer","year":"2012","journal-title":"Sparse Coding for Multitasking & Transfer Learning"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2014.2347054"},{"key":"ref21","first-page":"1817","article-title":"A framework for learning predictive structures from multiple tasks and unlabeled data","volume":"6","author":"ando","year":"2005","journal-title":"J Mach Learn Res"},{"key":"ref42","author":"mohri","year":"2012","journal-title":"Foundations of Machine Learning"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007379606734"},{"key":"ref41","first-page":"463","article-title":"Rademacher and Gaussian complexities: Risk bounds and structural results","volume":"3","author":"bartlett","year":"2003","journal-title":"J Mach Learn Res"},{"key":"ref23","first-page":"367","article-title":"Empirical Bayes for learning to learn","author":"heskes","year":"2000","journal-title":"Proc ICML"},{"key":"ref26","first-page":"615","article-title":"Learning multiple tasks with kernel methods","volume":"6","author":"evgeniou","year":"2005","journal-title":"J Mach Learn Res"},{"key":"ref25","first-page":"1620","article-title":"Infinite latent svm for classification and multi-task learning","author":"zhu","year":"2011","journal-title":"Proc Adv Neural Inf Process Syst"}],"container-title":["IEEE Transactions on Neural Networks and Learning Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/5962385\/8338465\/07902220.pdf?arnumber=7902220","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,29]],"date-time":"2022-01-29T00:05:31Z","timestamp":1643414731000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7902220\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5]]},"references-count":42,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tnnls.2017.2690683","relation":{},"ISSN":["2162-237X","2162-2388"],"issn-type":[{"value":"2162-237X","type":"print"},{"value":"2162-2388","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,5]]}}}