.png){kind=icon}
.png){kind=icon}
Return
Dynamic classifier approximation for unsupervised domain adaptation
.png){kind=icon}
PRE
AI
DOI：10.1016/j.sigpro.2022.108915.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In recent years, domain adaptation (DA) method has been proposed to solve the problem of domain shift between the training set and test set. However, most feature-based unsupervised domain adaptation methods have a weakness of strict requirement on the transformation matrix and they are not integrated with classifier. Therefore, this paper proposes a novel dynamic classifier approximation (DCA) method for unsupervised domain adaptation. Specifically, the proposed DCA, which combines classifier method to relax the requirements of transformation matrix, learns domain invariant features from structure and data level. 1) At the structure level, the low-rank representation, sparse representation and manifold learning are combined to preserve the structure information of data in the original feature space. 2) At the data level, distribution alignments are adopted to minimize the distribution difference of the source and target domains in the common subspace, which is helpful to reduce the negative impact caused by domain shift. In addition, for learning the common subspace more flexibly, a dynamic classifier is introduced to reduce the strict requirements on projection matrix. This paper carries out a large number of experiments on four data sets, and the experimental results show that the proposed method is superior to many of the latest domain adaptation methods, which can indicate its effectiveness.(c) 2022 Elsevier B.V. All rights reserved.
Keywords:
Domain adaptation
Domain shift
Dynamic classifier
Distribution alignment