Graph-based Multi-task Learning

被引:0
作者
Li, Ya [1 ]
Tian, Xinmei [1 ]
机构
[1] Univ Sci & Technol China, Hefei, Peoples R China
来源
2015 IEEE 16TH INTERNATIONAL CONFERENCE ON COMMUNICATION TECHNOLOGY (ICCT) | 2015年
关键词
Multi-task learning; Graph-based learning;
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Given several related tasks, multi-task learning (MTL) learns those tasks jointly by exploring the interdependence between them. Traditional multi-task learning methods mainly have two ways to measure task relatedness: sharing common parameters or sharing common features. However, both of them assume that all tasks are related and the strength of relatedness between tasks is the same. In real world, this is not often the case because of the complexity of the data. In this paper, we propose a graph-based multi-task learning method which measures the relatedness between tasks via a graph. The relatedness between tasks and the strength of the relatedness will be learned automatically. Experimental results demonstrate the effectiveness of our proposed graph-based multi-task learning method.
引用
收藏
页码:730 / 733
页数:4
相关论文
共 15 条
[1]  
[Anonymous], IEEE C COMP VIS PATT
[2]  
[Anonymous], NEUROIMAGE
[3]  
[Anonymous], IEEE C COMP VIS PATT
[4]  
Argyriou Andreas, 2008, MACHINE LEARNING
[5]  
Chen J., P 17 ACM SIGKDD INT
[6]  
Chen Jianhui, 2012, ACM T KNOWLEDGE DISC
[7]  
Evgeniou T., P 10 ACM SIGKDD INT
[8]  
Gong Pinghua, 2012, P 18 ACM SIGKDD INT
[9]  
Jalali Ali, 2013, IEEE T INFORM THEORY
[10]  
Jebara Tony, 2011, J MACHINE LEARNING R