Dynamic Double Classifiers Approximation for Cross-Domain Recognition
Lists
Only you see this
Abstract
In general, existing cross-domain recognition methods mainly focus on changing the feature representation of data or modifying the classifier parameter and their efficiencies are indicated by the better performance. However, most existing methods do not simultaneously integrate them into a unified optimization objective for further improving the learning efficiency. In this article, we propose a novel cross-domain recognition algorithm framework by integrating both of them. Specifically, we reduce the discrepancies in both the conditional distribution and marginal distribution between different domains in order to learn a new feature representation which pulls the data from different domains closer on the whole. However, the data from different domains but the same class cannot interlace together enough and thus it is not reasonable to mix them for training a single classifier. To this end, we further propose to learn double classifiers on the respective domain and require that they dynamically approximate to each other during learning. This guarantees that we finally learn a suitable classifier from the double classifiers by using the strategy of classifier fusion. The experiments show that the proposed method outperforms over the state-of-the-art methods.
BibTeX
@article{fang2022dynamic,
author = {Xiaozhao Fang and Na Han and Guoxu Zhou and Shaohua Teng and Yong Xu and Shenli Xie},
title = {{Dynamic Double Classifiers Approximation for Cross-Domain Recognition}},
journal = {IEEE Trans. Cybernetics},
year = {2022},
url = {https://openreview.net/forum?id=YeNCYiD0xAe},
}Loading related content...