{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T19:14:57Z","timestamp":1774466097240,"version":"3.50.1"},"reference-count":62,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2016,2,1]],"date-time":"2016-02-01T00:00:00Z","timestamp":1454284800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"Defense Innovative Research Programme","award":["9014100596"],"award-info":[{"award-number":["9014100596"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Pattern Anal. Mach. Intell."],"published-print":{"date-parts":[[2016,2,1]]},"DOI":"10.1109\/tpami.2015.2452911","type":"journal-article","created":{"date-parts":[[2015,7,7]],"date-time":"2015-07-07T21:37:16Z","timestamp":1436305036000},"page":"266-278","source":"Crossref","is-referenced-by-count":65,"title":["Flexible Clustered Multi-Task Learning by Learning Representative Tasks"],"prefix":"10.1109","volume":"38","author":[{"given":"Qiang","family":"Zhou","sequence":"first","affiliation":[]},{"given":"Qi","family":"Zhao","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2008.297"},{"key":"ref38","first-page":"1103","article-title":"Flexible modeling of latent task structures in multitask learning","author":"passos","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref33","first-page":"543","article-title":"Tree-guided group lasso for multi-task regression with structured sparsity","author":"kim","year":"0","journal-title":"Proc 27th Int Conf Mach Learn"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1162\/089976603762553013"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2009.142"},{"key":"ref30","first-page":"521","article-title":"Learning with whom to share in multi-task feature learning","author":"kang","year":"0","journal-title":"Proc 28th Int Conf Mach Learn"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-012-0629-5"},{"key":"ref36","first-page":"339","article-title":"Multi-task feature learning via efficient l2, 1-norm minimization","author":"liu","year":"0","journal-title":"Proc Conf Uncertainty Artif Intell"},{"key":"ref35","article-title":"Adaptive multi-task lasso: With application to eqtl detection","author":"lee","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref34","first-page":"1383","article-title":"Learning task grouping and overlap in multi-task learning","author":"kumar","year":"0","journal-title":"Proc 29th Int Conf Mach Learn"},{"key":"ref60","first-page":"49","article-title":"Convex multitask learning with flexible task clusters","author":"zhong","year":"0","journal-title":"Proc 29th Int Conf Mach Learn"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020549"},{"key":"ref61","first-page":"702","article-title":"Clustered multi-task learning via alternating structure optimization","author":"zhou","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btm611"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553431"},{"key":"ref29","article-title":"A dirty model for multi-task learning","author":"jalali","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref2","article-title":"Multi-task feature learning","author":"argyriou","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref1","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":"ref20","first-page":"615","article-title":"Learning multiple tasks with kernel methods","volume":"6","author":"evgeniou","year":"2005","journal-title":"J Mach Learn Res"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-012-0530-2"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014067"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339672"},{"key":"ref23","article-title":"Multi-stage multi-task feature learning","author":"gong","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref26","article-title":"Clustered multi-task learning: A convex formulation","author":"jacob","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref25","first-page":"2979","article-title":"Multi-stage multi-task feature learning","volume":"14","author":"gong","year":"2013","journal-title":"J Mach Learn Res"},{"key":"ref50","article-title":"Caltech-UCSD Birds 200","author":"welinder","year":"2010"},{"key":"ref51","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":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2012.2200262"},{"key":"ref58","article-title":"Probabilistic multi-task feature selection","author":"zhang","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref57","first-page":"1917","article-title":"Learning high-order task relationships in multi-task learning","author":"zhang","year":"2013","journal-title":"Proc 23rd Int Joint Conf Artif Intell"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5539975"},{"key":"ref55","first-page":"733","article-title":"A convex formulation for learning task relationships in multi-task learning","author":"zhang","year":"0","journal-title":"Proc 26th Conf Uncertainty Artif Intell"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9868.2005.00532.x"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102479"},{"key":"ref52","first-page":"2151","article-title":"Heterogeneous multitask learning with joint sparsity constraints","author":"yang","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007379606734"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835952"},{"key":"ref40","article-title":"Multitask learning without label correspondences","author":"quadrianto","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.189"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020423"},{"key":"ref14","first-page":"105","article-title":"Smoothing proximal gradient method for general structured sparse learning","author":"chen","year":"0","journal-title":"Proc Conf Uncertainty Artif Intell"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2005.177"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2013.02.024"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2010.2095882"},{"key":"ref18","first-page":"19","article-title":"Finding exemplars from pairwise dissimilarities via simultaneous sparse recovery","author":"elhamifar","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2012.6247852"},{"key":"ref4","first-page":"83","article-title":"Task clustering and gating for Bayesian multitask learning","volume":"4","author":"bakker","year":"2003","journal-title":"J Mach Learn Res"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-007-5040-8"},{"key":"ref6","first-page":"43","article-title":"Kernel multi-task learning using task-specific features","author":"bonilla","year":"0","journal-title":"Proc 11th Int Conf Artif Intell Statist"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"ref7","article-title":"Multi-task Gaussian process prediction","author":"bonilla","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5540018"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref46","author":"sra","year":"2012","journal-title":"Optimization for Machine Learning"},{"key":"ref45","first-page":"2773","article-title":"Multi-task regression using minimal penalties","volume":"13","author":"solnon","year":"2012","journal-title":"J Mach Learn Res"},{"key":"ref48","article-title":"The Caltech-UCSD Birds-200-2011 Dataset","author":"wah","year":"2011"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.1055"},{"key":"ref42","article-title":"Exploiting unrelated tasks in multi-task learning","author":"romera-paredes","year":"0","journal-title":"Proc Int Conf Artif Intell Statist"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2011.2157521"},{"key":"ref44","article-title":"Learning Gaussian process kernels via hierarchical Bayes","author":"schwaighofer","year":"2004","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref43","first-page":"1444","article-title":"Multilinear multitask learning","author":"romera-paredes","year":"0","journal-title":"Proc 30th Int Conf Mach Learn"}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/34\/7374781\/7150415.pdf?arnumber=7150415","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:45:59Z","timestamp":1642005959000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7150415\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,1]]},"references-count":62,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tpami.2015.2452911","relation":{},"ISSN":["0162-8828","2160-9292"],"issn-type":[{"value":"0162-8828","type":"print"},{"value":"2160-9292","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,2,1]]}}}