Domain adaptation on the statistical manifold
In this paper, we tackle the problem of unsupervised domain adaptation for classification. In the unsupervised scenario where no labeled samples from the target domain are provided, a popular approach consists in transforming the data such that the source and target distributions become similar. To compare the two distributions, existing approaches make use of the Maximum Mean Discrepancy (MMD). However, this does not exploit the fact that probability distributions lie on a Riemannian manifold....[Show more]
|Collections||ANU Research Publications|
|Source:||Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition|
|01_Baktashmotlagh_Domain_adaptation_on_the_2014.pdf||480.17 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.