The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Logistic regression with an auxiliary data source
Abstract
To achieve good generalization in supervised learning, the training and testing examples are usually required to be drawn from the same source distribution. In this paper we propose a method to relax this requirement in the context of logistic regression. Assuming Dp and Da are two sets of examples drawn from two mismatched distributions, where Da are fully labeled and Dp partially labeled, our objective is to complete the labels of Dp. We introduce an auxiliary variable μ for each example in Da to reflect its mismatch with Dp. Under an appropriate constraint the μ's are estimated as a byproduct, along with the classifier. We also present an active learning approach for selecting the labeled examples in Dp. The proposed algorithm, called "Migratory-Logit" or M-Logit, is demonstrated successfully on simulated as well as real data sets.
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
Text 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 · cited 1×
“…the insufficiency of labeled data have been investigated in the past few years under the names " active learning " [Cohn et al., 1995, Krogh & Vedelsby, 1995] and " semi-supervised learning " [Nigam & et al., 2000], which we do not discuss here, though we will revisit active learning in Section 5.”
BackgroundLearning and evaluating classifiers under sample selection bias
Zadrozny, B. (2004) · Twenty-first international conference on Machine learning - ICML '04 · doi:10.1145/1015330.1015425 · Cited by 800 · cited 6×
“are then a selected draw from the two Gaussian distributions, as described in [Zadrozny, 2004].”
BackgroundMethodInfluentialCost-sensitive learning by cost-proportionate example weighting
Zadrozny, B., Langford, J., & Abe, N. (2004) · Third IEEE International Conference on Data Mining · doi:10.1109/icdm.2003.1250950 · Cited by 680 · cited 2×
“can correct the mismatch by weighting and resampling [ Zadrozny et al., 2003, Zadrozny, 2004].”
Background
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
“The first context can be referred to as instance-based transfer learning (or instance transfer) approach [6], [28], [29], [30], [31], [24], [32], [33], [34], [35], which assumes that certain parts of the data in the source domain can be reused for learning in the target domain by reweighting.”
BackgroundBoosting for transfer learning
Dai, W., Yang, Q., Xue, G.-R., & Yu, Y. (2007) · Proceedings of the 24th international conference on Machine learning · doi:10.1145/1273496.1273521 · Cited by 1,724
Cross-domain video concept detection using adaptive svms
Yang, J., Yan, R., & Hauptmann, A. G. (2007) · Proceedings of the 15th ACM international conference on Multimedia · doi:10.1145/1291233.1291276 · Cited by 667
A Decade Survey of Transfer Learning (2010–2020)
Niu, S., Liu, Y., Wang, J., & Song, H. (2020) · IEEE Transactions on Artificial Intelligence · doi:10.1109/tai.2021.3054609 · Cited by 645
Chen, Z., & Liu, B. (2018) · Synthesis Lectures on Artificial Intelligence and Machine Learning · doi:10.1007/978-3-031-01581-6 · Cited by 466
Metadata
- Authors
- Liao, X., Xue, Y., & Carin, L.
- Venue
- Proceedings of the 22nd international conference on Machine learning - ICML '05
- Publisher
- ACM Press
- Published
- 2005
- Pages
- 505-512
- OpenAlex
- W2050549724
- Cited by
- 203
- References
- 3
- FWCI
- 3.10
- Type
- conference paper
- 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.