Self-adaptation for unsupervised domain adaptation

13Citations
Citations of this article
77Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Lack of labelled data in the target domain for training is a common problem in domain adaptation. To overcome this problem, we propose a novel unsupervised domain adaptation method that combines projection and self-training based approaches. Using the labelled data from the source domain, we first learn a projection that maximises the distance among the nearest neighbours with opposite labels in the source domain. Next, we project the source domain labelled data using the learnt projection and train a classifier for the target class prediction. We then use the trained classifier to predict pseudo labels for the target domain unlabelled data. Finally, we learn a projection for the target domain as we did for the source domain using the pseudo-labelled target domain data, where we maximise the distance between nearest neighbours having opposite pseudo labels. Experiments on a standard benchmark dataset for domain adaptation show that the proposed method consistently outperforms numerous baselines and returns competitive results comparable to that of SOTA including self-training, tri-training, and neural adaptations.

Cite

CITATION STYLE

APA

Cui, X., & Bollegala, D. (2019). Self-adaptation for unsupervised domain adaptation. In International Conference Recent Advances in Natural Language Processing, RANLP (Vol. 2019-September, pp. 213–222). Incoma Ltd. https://doi.org/10.26615/978-954-452-056-4_025

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free