4.6 Article

Unsupervised double weighted domain adaptation

期刊

NEURAL COMPUTING & APPLICATIONS
卷 33, 期 8, 页码 3545-3566

出版社

SPRINGER LONDON LTD
DOI: 10.1007/s00521-020-05228-4

关键词

Transfer learning; Domain adaptation; Sample reweighting; Weighted distribution alignment; Structural risk minimization

资金

  1. National Natural Science Foundation of China [61300049]
  2. Natural Science Research Foundation of Jilin Province of China [20180101053JC]
  3. Industrial Technology Research and Development Project of the Development and Reform Commission of Jilin Province [2019C053-9]

向作者/读者索取更多资源

This paper proposes a double weighted domain adaptation (DWDA) method, which explores the relative importance of different distribution alignments through new distribution alignment weighting and sample reweighting strategies, and improves overall performance. Experimental results demonstrate that the method outperforms state-of-the-art domain adaptation methods on public datasets and imbalanced datasets, and is robust to a wide range of parameters. Additionally, convergence curves show rapid convergence within five iterations, and component analysis suggests the necessity of each component in DWDA.
Domain adaptation can effectively transfer knowledge between domains with different distributions. Most existing methods use distribution alignment to mitigate the domain shift. But they typically align the marginal and conditional distributions with equal weights. This neglects the relative importance of different distribution alignments. In this paper, we propose a double weighted domain adaptation (DWDA) method, which employs new distribution alignment weighting and sample reweighting strategies. Specifically, the distribution alignment weighting strategy explores the relative importance of marginal and conditional distribution alignments, based on the maximum mean discrepancy; the sample reweighting strategy weights the source and target samples separately based onk-means clustering. The two strategies reinforce each other in the iterative optimization procedure, thus improving the overall performance. In addition, our method also considers the geometry structure preservation. The closed-form solution of the objective function is presented, and the computational complexity and convergence analysis are given. Experimental results demonstrate that DWDA outperforms state-of-the-art domain adaptation methods on several public datasets, and it also has good performance on an imbalanced dataset. Besides, DWDA is robust to a wide range of parameters. Moreover, the convergence curves show that DWDA generally converges rapidly within five iterations. We also evaluate the components of DWDA and show that each component is necessary. Finally, we compare the computational time with the methods of the recent three years to demonstrate the efficiency of DWDA.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.6
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据