Cited by 132Domain Adaptation and Few-Shot LearningMachine Learning and Data ClassificationMachine Learning and Algorithms

Cross Validation Framework to Choose amongst Models and Datasets for Transfer Learning

Open access
Zhong, Erheng, Fan, Wei, Yang, Qiang, Verscheure, Olivier, Ren, Jiangtao·2010·Lecture Notes in Computer Science

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1007/978-3-642-15939-8_35

Cites

Statistics

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.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Reverse validation [34] is based on reverse testing [35], where a new classifier is trained on predictions on test data and evaluated on training data.

    “The basic idea of reverse validation [34] is based on reverse testing [35], where a new classifier is trained on predictions on the test data and evaluated again on the training data.”

    From Reverse Classification Accuracy: Predicting Segmentation Performance in the Absence of Ground Truth (2017) · cites this paper as [34]

    Section 3.1 (page unavailable) describes training a new model on predicted labels for target-domain data, then using it to classify held-out source-domain data. But the paper calls this reverse validation. Section 6 (page unavailable) identifies reverse testing as a different technique from Fan and Davidson (2006); it does not establish that reverse validation is based on it. (LLM, conf=0.83)

    Experimental — accuracy not yet measured
  • RCA differs from reverse validation and reverse testing in that it trains a reverse classifier on every single instance, whereas those approaches train single classifiers over the whole test set jointly.

    “While the idea of RCA is similar to reverse validation [34] and reverse testing [35], the important difference is that in our approach we train a reverse classifier on every single instance while the approaches in [34], [35] train single classifiers over the whole test set and its predictions jointly to find out what the best original predictor is.”

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

No references could be resolved yet.

Research works printed but not linked: 14

  1. Lewis, D.D., Yang, Y., Rose, T.G., Li, F.: Rcv1: A new benchmark collection for text categorization research. Journal of Machine Learning Research 5, 361-397 (2004)
  2. Akaike, H.: A new look at the statistical model identification. IEEE Transactions on Automatic Control 19(6), 716-723 (2003)
  3. Schwarz, G.: Estimating the dimension of a model. The Annals of Statistics 6(2), 461-464 (1978)
  4. Vapnik, V.: Statistical Learning Theory. Wiley, New York (1998)
  5. Shimodaira, H.: Improving predictive inference under covariate shift by weighting the log-likelihood function. Journal of Statistical Planning and Inference 90(2), 227-244 (2000)
  6. Sugiyama, M., Krauledat, M., Müller, K.R.: Covariate shift adaptation by impor- tance weighted cross validation. Journal of Machine Learning Research 8, 985-1005 (2007)
  7. Sugiyama, M., Nakajima, S., Kashima, H., Buenau, P.V., Kawanabe, M.: Direct importance estimation with model selection and its application to covariate shift adaptation. In: NIPS '07: Proceedings of the 2007 Conference on Advances in Neu- ral Information Processing Systems, vol. 20, pp. 1433-1440. MIT Press, Cambridge (2008)
  8. Huang, J., Smola, A.J., Gretton, A., Borgwardt, K.M., Schölkopf, B.: Correcting sample selection bias by unlabeled data. In: NIPS '06: Proceedings of the 2006 Conference on Advances in Neural Information Processing Systems, vol. 19, pp. 601-608. MIT Press, Cambridge (2007)
  9. Kohavi, R.: A study of cross-validation and bootstrap for accuracy estimation and model selection. In: IJCAI'95: Proceedings of the 14th International Joint Conference on Artificial Intelligence, pp. 1137-1143.
  10. Dai, W., Yang, Q., Xue, G.R., Yu, Y.: Boosting for transfer learning. In: ICML '07: Proceedings of the 24th International Conference on Machine Learning, pp. 193-200. ACM, New York (2007)
  11. Xie, S., Fan, W., Peng, J., Verscheure, O., Ren, J.: Latent space domain transfer between high dimensional overlapping distributions. In: WWW '09: Proceedings of the 18th International Conference on World Wide Web, pp. 91-100. ACM, New York (2009)
  12. Gao, J., Fan, W., Jiang, J., Han, J.: Knowledge transfer via multiple model local structure mapping. In: KDD '08: Proceeding of the 14th ACM SIGKDD Interna- tional Conference on Knowledge Discovery and Data Mining, pp. 283-291. ACM, New York (2008)
  13. Fan, W., Davidson, I.: Reverse testing: an efficient framework to select amongst classifiers under sample selection bias. In: KDD '06: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 147-156. ACM, New York (2006)
  14. Brazdil, P., Giraud-Carrier, C., Soares, C., Vilalta, R.: Metalearning: Applications to Data Mining. In: Cognitive Technologies. Springer, Heidelberg (2009)

Cited by

Sorted by citations

Authors
Zhong, E., Fan, W., Yang, Q., Verscheure, O., & Ren, J.
Affiliations
  • Sun Yat-sen University (CN)
  • IBM (United States) (US)
  • Hong Kong University of Science and Technology (HK)
Venue
Lecture Notes in Computer Science
Published
2010
Pages
547-562
ISSN
  • 0302-9743 (ISSN-L)
  • 1611-3349
OpenAlex
W1544165511
Cited by
132
References
0
Citations by year
2026: 3 · 2025: 5 · 2024: 5 · 2023: 7 · 2022: 14 · 2021: 14 · 2020: 11 · 2019: 25 · 2018: 9 · 2017: 10 · 2016: 3 · 2015: 7 · 2014: 6 · 2013: 1 · 2012: 6
FWCI
3.36
Type
conference paper
Language
en
Open access
Locations
  • Lecture notes in computer science (publishedVersion)
  • Rare & Special e-Zone (The Hong Kong University of Science and Technology) (submittedVersion)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Domain Adaptation and Few-Shot Learning
  • Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Data Classification
  • Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Algorithms
Keywords
transfer learning, cross-validation, domain shift, model selection, data selection, cross-domain learning, wine quality assessment, text classification

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