The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Domain Adaptation via Transfer Component Analysis
Abstract
Domain adaptation allows knowledge from a source domain to be transferred to a different but related target domain. Intuitively, discovering a good feature representation across domains is crucial. In this paper, we first propose to find such a representation through a new learning method, transfer component analysis (TCA), for domain adaptation. TCA tries to learn some transfer components across domains in a reproducing kernel Hilbert space using maximum mean miscrepancy. In the subspace spanned by these transfer components, data properties are preserved and data distributions in different domains are close to each other. As a result, with the new representations in this subspace, we can apply standard machine learning methods to train classifiers or regression models in the source domain for use in the target domain. Furthermore, in order to uncover the knowledge hidden in the relations between the data labels from the source and target domains, we extend TCA in a semisupervised learning setting, which encodes label information into transfer components learning. We call this extension semisupervised TCA. The main contribution of our work is that we propose a novel dimensionality reduction framework for reducing the distance between domains in a latent space for domain adaptation. We propose both unsupervised and semisupervised feature extraction approaches, which can dramatically reduce the distance between domain distributions by projecting data onto the learned transfer components. Finally, our approach can handle large datasets and naturally lead to out-of-sample generalization. The effectiveness and efficiency of our approach are verified by experiments on five toy datasets and two real-world applications: cross-domain indoor WiFi localization and cross-domain text classification.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Pan, S. J., & Yang, Q. (2010) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2009.191 · Cited by 23,387
Self-citationText classification from labeled and unlabeled documents using EM
Nigam, K., Mccallum, A. K., Thrun, S., & Mitchell, T. (2000) · Machine Learning · doi:10.1023/a:1007692713085 · Cited by 2,736
Analysis of Representations for Domain Adaptation
Ben-David, S., Blitzer, J., Crammer, K., & Pereira, F. (2007) · Advances in Neural Information Processing Systems 19 · doi:10.7551/mitpress/7503.003.0022 · Cited by 2,019
Domain adaptation with structural correspondence learning
Blitzer, J., McDonald, R., & Pereira, F. (2006) · Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing - EMNLP '06 · doi:10.3115/1610075.1610094 · Cited by 1,543
Research works printed but not linked: 35
- 10.1137/1.9781611970791 · DOI · Paper page
- belkin, 2006, manifold regularization: a geometric framework for learning from labeled and unlabeled examples, J Mach Learn Res, 7, 2399
- 10.1109/TNN.2004.841784 · doi:10.1109/tnn.2004.841784
- cristianini, 2002, Advances in Neural Information Processing Systems 14, 367
- 10.1145/1281192.1281218 · DOI · Paper page
- 10.1016/B978-1-55860-377-6.50048-7 · DOI · Paper page
- pan, 2009, domain adaptation via transfer component analysis, Proc 21st Int Joint Conf Artif Intell, 1187
- sorensen, 1996, Implicitly restarted Arnoldi/Lanczos method for large scale eigenvalue calculations
- pan, 2008, transfer learning via dimensionality reduction, Proc 23rd AAAI Conf Artif Intell, 677
- ando, 2005, a framework for learning predictive structures from multiple tasks and unlabeled data, J Mach Learn Res, 6, 1817
- 10.1103/PhysRevLett.103.214101 · DOI · Paper page
- 10.1109/TNN.2008.2000807 · DOI
- huang, 2007, Advances in Neural Information Processing Systems 19, 601
- sugiyama, 2008, Advances in Neural Information Processing Systems 20, 1433
- bickel, 2009, Discriminative learning under covariate shift, J Mach Learn Res, 10, 2137
- kanamori, 2009, a least-squares approach to direct importance estimation, J Mach Learn Res, 10, 1391
- 10.1016/j.neunet.2009.07.007 · DOI
- 10.1007/978-3-642-00599-2_17 · doi:10.1007/978-3-642-00599-2_17
- 10.1109/TNN.2008.2007961 · DOI
- 10.1109/72.914517 · DOI · Paper page
- 10.1109/TNN.2003.810608 · DOI
- 10.1162/089976698300017467 · DOI · Paper page
- ben-david, 2007, Advances in Neural Information Processing Systems 19, 137
- 10.7551/mitpress/9780262033589.001.0001 · DOI · Paper page
- daum, 2007, Frustratingly easy domain adaptation, Proc 40th Ann Meeting of the Assoc Comput Linguistics, 256
- song, 2008, Advances in Neural Information Processing Systems 20, 1385
- 10.1109/MIS.2008.4 · DOI
- fang, 2008, indoor location system based on discriminant-adaptive neural network in ieee 802.11 environments, IEEE Trans Neural Netw, 19, 1973, 10.1109/TNN.2008.2005494 · DOI
- 10.1109/ICDM.2008.49 · DOI
- smola, 2007, A Hilbert space embedding for distributions, 10th Int Conf Algorithmic Learning Theory, 13, 10.1007/978-3-540-75225-7_5 · DOI · Paper page
- 10.1137/1.9781611972795.34 · DOI
- gretton, 2005, Measuring statistical dependence with Hilbert-Schmidt norms, 10th Int Conf Algorithmic Learning Theory, 63, 10.1007/11564089_7 · DOI · Paper page
- gretton, 2007, A kernel method for the two-sample problem, Proc Conf Neural Inf Process Syst, 513
- 10.1145/1015330.1015345 · DOI · Paper page
- 10.1162/153244302760185252 · DOI
Cited by
Pan, S. J., & Yang, Q. (2010) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2009.191 · Cited by 23,387
Self-citationA Comprehensive Survey on Transfer Learning
Zhuang, F., Qi, Z., Duan, K., Xi, D., Zhu, Y., Zhu, H., Xiong, H., & He, Q. (2021) · Proceedings of the IEEE · doi:10.1109/jproc.2020.3004555 · Cited by 6,678
Weiss, K., Khoshgoftaar, T. M., & Wang, D. (2016) · Journal of Big Data · doi:10.1186/s40537-016-0043-6 · Cited by 6,260
Learning Transferable Features with Deep Adaptation Networks
Long, M., Cao, Y., Wang, J., & Jordan, M. I. (2015) · arXiv · doi:10.48550/arxiv.1502.02791 · Cited by 4,505
Deep CORAL: Correlation Alignment for Deep Domain Adaptation
Sun, B., & Saenko, K. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-49409-8_35 · Cited by 3,757
Metadata
- Authors
- Pan, S. J., Tsang, I. W., Kwok, J. T., & Yang, Q.
- Venue
- IEEE Transactions on Neural Networks
- Published
- 2011-02
- Volume
- 22
- Issue
- 2
- Pages
- 199-210
- ISSN
- 1045-9227 (ISSN-L)
- 1941-0093
- OpenAlex
- W304676660
- Cited by
- 4,753
- References
- 4
- FWCI
- 42.85
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.