Heterogeneous Domain Adaptation Using Linear Kernel
文献类型:期刊论文
作者 | Guan, ZD (Guan, Zengda); Bai, ST (Bai, Shuotian); Zhu, TS (Zhu, Tingshao); Guan, ZD |
刊名 | PERVASIVE COMPUTING AND THE NETWORKED WORLD
![]() |
出版日期 | 2014 |
卷号 | 8351期号:不详页码:124-133 |
ISSN号 | 0302-9743 |
英文摘要 | When a task of a certain domain doesn't have enough labels and good features, traditional supervised learning methods usually behave poorly. Transfer learning addresses this problem, which transfers data and knowledge from a related domain to improve the learning performance of the target task. Sometimes, the related task and the target task have the same labels, but have different data distributions and heterogeneous features. In this paper, we propose a general heterogeneous transfer learning framework which combines linear kernel and graph regulation. Linear kernel is used to project the original data of both domains to a Reproducing Kernel Hilbert Space, in which both tasks have the same feature dimensions and close distance of data distributions. Graph regulation is designed to preserve geometric structure of data. We present the algorithms in both unsupervised and supervised way. Experiments on synthetic dataset and real dataset about user web-behavior and personality are performed, and the effectiveness of our method is demonstrated. |
语种 | 英语 |
源URL | [http://ir.psych.ac.cn/handle/311026/25679] ![]() |
专题 | 心理研究所_社会与工程心理学研究室 |
通讯作者 | Guan, ZD |
作者单位 | Chinese Acad Sci, Univ Chinese Acad Sci, Inst Psychol, Beijing |
推荐引用方式 GB/T 7714 | Guan, ZD ,Bai, ST ,Zhu, TS ,et al. Heterogeneous Domain Adaptation Using Linear Kernel[J]. PERVASIVE COMPUTING AND THE NETWORKED WORLD,2014,8351(不详):124-133. |
APA | Guan, ZD ,Bai, ST ,Zhu, TS ,&Guan, ZD.(2014).Heterogeneous Domain Adaptation Using Linear Kernel.PERVASIVE COMPUTING AND THE NETWORKED WORLD,8351(不详),124-133. |
MLA | Guan, ZD ,et al."Heterogeneous Domain Adaptation Using Linear Kernel".PERVASIVE COMPUTING AND THE NETWORKED WORLD 8351.不详(2014):124-133. |
入库方式: OAI收割
来源:心理研究所
其他版本
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。