arrow
返回

Domain adaption based on source dictionary regularized RKHS subspace learning

delete2021-06-17
delete5
PRE
AI
W
Wenjie Lei
Z
Zhengming Ma *
Y
Yuanping Lin
W
Wenxu Gao
DOI:10.1007/s10044-021-01002-xdelete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Domain adaption is to transform the source and target domain data into a certain space through a certain transformation, so that the probability distribution of the transformed data is as close as possible. The domain adaption algorithm based on Maximum Mean Difference (MMD) Maximization and Reproducing Kernel Hilbert Space (RKHS) subspace transformation is the current main algorithm for domain adaption, in which the RKHS subspace transformation is determined by MMD of the transformed source and target domain data. However, MMD has inherent defects in theory. The probability distributions of two different random variables will not change after subtracting their respective mean values, but their MMD becomes zero. A reasonable method should be that the MMD of the source and target domain data with the same label should be as small as possible after RKHS subspace transformation. However, the labels of target domain data are unknown and there is no way to model according to this criterion. In this paper, a domain adaption algorithm based on source dictionary regularized RKHS subspace learning is proposed, in which the source domain data are used as a dictionary, and the target domain data are approximated by the sparse coding of the dictionary. That is to say, in the process of RKHS subspace transformation, the target domain data are distributed around the mostly relevant source domain data. In this way, the proposed algorithm indirectly achieves the MMD of the source and target domain data with the same label after RKHS subspace transformation. So far there has been no similar work reported in the published academic papers. The experimental results presented in this paper show that the proposed algorithm outperforms 5 other state-of-the-art domain adaption algorithms on 5 commonly used datasets.
Keyword:
Domain adaptive learning
Subspace learning
Reproducing Kernel Hilbert space
Dictionary learning
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Pattern Analysis and Applications 封面图
Pattern Analysis and Applications
IF:
2
论文数:
2.0K
被引数:
1.9K

机构

S
Sun Yat Sen University
学者数:
9.9W
论文数: 7.2W
被引数: 95
引用论文

引用论文

Domain Invariant and Class Discriminative Feature Learning for Visual Domain Adaptation
err2018-09-01
err206
PREAI
errLi, Shuang; Song, Shiji; Huang, Gao; Ding, Zhengming; Wu, Cheng
err分享
err收藏
Amyloid Arthropathy: A Review
err2021-09-09
err0
PREAI
errJulio A. Diaz-Perez; Sheila A. Conway; Yiqin Zuo; Gunnlaugur Petur Nielsen; Martin Selig; Andrew E. Rosenberg
err分享
err收藏
err分享
err收藏
学者 查看更多内容