The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Learning Domain-Invariant Subspace Using Domain Features and Independence Maximization
Open accessAbstract
Domain adaptation algorithms are useful when the distributions of the training and the test data are different. In this paper, we focus on the problem of instrumental variation and time-varying drift in the field of sensors and measurement, which can be viewed as discrete and continuous distributional change in the feature space. We propose maximum independence domain adaptation (MIDA) and semi-supervised MIDA to address this problem. Domain features are first defined to describe the background information of a sample, such as the device label and acquisition time. Then, MIDA learns a subspace which has maximum independence with the domain features, so as to reduce the interdomain discrepancy in distributions. A feature augmentation strategy is also designed to project samples according to their backgrounds so as to improve the adaptation. The proposed algorithms are flexible and fast. Their effectiveness is verified by experiments on synthetic datasets and four real-world ones on sensors, measurement, and computer vision. They can greatly enhance the practicability of sensor systems, as well as extend the application scope of existing domain adaptation algorithms by uniformly handling different kinds of distributional change.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
A survey on concept drift adaptation
Gama, J., Žliobaitė, I., Bifet, A., Pechenizkiy, M., & Bouchachia, A. (2014) · ACM Computing Surveys · doi:10.1145/2523813 · Cited by 3,735
Cited by
A 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
“Measurement Related Algorithms Maximum Mean Discrepancy [28] [29] [30] [31] [32]· · · Kullback-Leibler Divergence [33] [34] [35] [36] [37]· · · Jensen-Shannon Divergence [38] [39] [40] [41] [42]· · · Bregman Divergence [43] [44] [45] [46] [47]· · · Hilbert-Schmidt Independence Criterion [48] [29] [49] [50] [51]· · ·”
A review on transfer learning in EEG signal analysis
Wan, Z., Yang, R., Huang, M., Zeng, N., & Liu, X. (2021) · Neurocomputing · doi:10.1016/j.neucom.2020.09.017 · Cited by 468
Transfer Learning for EEG-Based Brain–Computer Interfaces: A Review of Progress Made Since 2016
Wu, D., Xu, Y., & Lu, B.-L. (2022) · IEEE Transactions on Cognitive and Developmental Systems · doi:10.1109/tcds.2020.3007453 · Cited by 434
Gu, X., Cao, Z., Jolfaei, A., Xu, P., Wu, D., Jung, T.-P., & Lin, C.-T. (2021) · IEEE/ACM Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2021.3052811 · Cited by 395
Lan, Z., Sourina, O., Wang, L., Scherer, R., & Muller-Putz, G. R. (2019) · IEEE Transactions on Cognitive and Developmental Systems · doi:10.1109/tcds.2018.2826840 · Cited by 357
Metadata
- Authors
- Yan, K., Kou, L., & Zhang, D.
- Venue
- IEEE Transactions on Cybernetics
- Published
- 2018-01
- Volume
- 48
- Issue
- 1
- Pages
- 288-299
- ISSN
- 2168-2267 (ISSN-L)
- 2168-2275
- OpenAlex
- W2579628011
- Cited by
- 220
- References
- 2
- FWCI
- 14.10
- Type
- journal article
- Language
- en
- Open access
- green
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.