Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

The DOI matches its Crossref record; 19 of the 20 references it cites were found in a registry or an index.

Adapting Visual Category Models to New Domains

Saenko, Kate, Kulis, Brian, Fritz, Mario, Darrell, Trevor · 2010 · Lecture Notes in Computer Science

Overview

Integrity signals

Registry

Crossref · 10.1007/978-3-642-15561-1_16

Cites

19 of 19 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Citations

Cites

Show all 20 references

Cited by

  • Domain-Adversarial Training of Neural Networks

    Ganin, Y., Ustinova, E., Ajakan, H., Germain, P., Larochelle, H., Laviolette, F., Marchand, M., & Lempitsky, V. (2017) · Advances in Computer Vision and Pattern Recognition · doi:10.1007/978-3-319-58347-1_10 · Cited by 8,318

    “These include large-scale data sets of small images popular with deep learning methods, and the Office data sets (Saenko et al., 2010), which are a de facto standard for domain adaptation in computer vision, but have much fewer images.”
    BackgroundResultInfluential
  • 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

  • A survey of transfer learning

    Weiss, K., Khoshgoftaar, T. M., & Wang, D. (2016) · Journal of Big Data · doi:10.1186/s40537-016-0043-6 · Cited by 6,260

    “Baseline approaches tested include k-nearest neighbors, SVM, metric learning proposed by Davis [23], feature augmentation proposed by Daumé [22], and a cross domain metric learning method proposed by Saenko [100].”
    Method
  • Unsupervised Domain Adaptation by Backpropagation

    Ganin, Y., & Lempitsky, V. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1409.7495 · Cited by 2,521

    “For the OFFICE dataset (Saenko et al., 2010), we directly compare the performance of our full network (feature extractor and label predictor) against recent DA approaches using previously published results.”
    MethodResultInfluential
  • Adversarial Discriminative Domain Adaptation

    Tzeng, E., Hoffman, J., Saenko, K., & Darrell, T. (2017) · 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2017.316 · Cited by 5,154

    “Finally, we evaluate our method on the benchmark Office visual domain adaptation dataset [24].”
    MethodSelf-citation

See all 2,847

Metadata

Authors
Saenko, K., Kulis, B., Fritz, M., & Darrell, T.
Affiliations
International Computer Science Institute (US)
Venue
Lecture Notes in Computer Science
Published
2010
Pages
213-226
ISSN
  • 0302-9743 (ISSN-L)
  • 1611-3349
OpenAlex
W1722318740
Cited by
2,847
References
20
Citations by year
2026: 92 · 2025: 226 · 2024: 261 · 2023: 316 · 2022: 276 · 2021: 360 · 2020: 339 · 2019: 243 · 2018: 175 · 2017: 118 · 2016: 140 · 2015: 111 · 2014: 89 · 2013: 58 · 2012: 23
FWCI
26.11
Type
conference paper
Language
en
Open access
closed
Licence
www.springer.com/tdm (tdm)
Locations
  • Lecture notes in computer science (publishedVersion)
  • Max Planck Digital Library (submittedVersion)
  • MPG.PuRe (Max Planck Society) (submittedVersion)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Domain Adaptation and Few-Shot Learning
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Image and Video Retrieval Techniques
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Neural Network Applications
Keywords
domain adaptation, domain shift, object recognition, feature distribution shift, imaging conditions

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Adapting Visual Category Models to New Domains. https://app.cochat.ai/papers/10.1007/978-3-642-15561-1_16
The paper
Saenko, K., Kulis, B., Fritz, M., & Darrell, T. (2010). Adapting Visual Category Models to New Domains. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-642-15561-1_16

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.