The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Hierarchical sampling for active learning
Abstract
We present an active learning scheme that exploits cluster structure in data.
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
(2003) · Journal of Machine Learning Research · doi:10.5555/944919.944937 · Cited by 32,337
Improving generalization with active learning
Cohn, D., Atlas, L., & Ladner, R. (1994) · Machine Learning · doi:10.1007/bf00993277 · Cited by 1,591
Selective Sampling Using the Query by Committee Algorithm
Freund, Y., Seung, H. S., Shamir, E., & Tishby, N. (1997) · Machine Learning · doi:10.1023/a:1007330508534 · Cited by 1,097
Less is More: Active Learning with Support Vector Machines
Schohn, G., & Cohn, D. A. (2000) · Cited by 773
Balcan, M.-F., Beygelzimer, A., & Langford, J. C. (2006) · International Conference on Machine Learning · doi:10.1145/1143844.1143853 · Cited by 280
Balcan, M.-F., Broder, A., & Zhang, T. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-72927-3_5 · Cited by 272
Coarse sample complexity bounds for active learning
Dasgupta, S. (2005) · Cited by 240
Self-citationA bound on the label complexity of agnostic active learning
Hanneke, S. (2007) · Proceedings of the 24th international conference on Machine learning · doi:10.1145/1273496.1273541 · Cited by 231
A General Agnostic Active Learning Algorithm.
Dasgupta, S., Hsu, D., & Monteleoni, C. (2008) · Cited by 188
Self-citationPerformance thresholding in practical text classification
Schütze, H., Velipasaoglu, E., & Pedersen, J. (2006) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/1183614.1183709 · Cited by 50
Cited by
(2009) · Minds at UW (University of Wisconsin) · Cited by 4,791
A brief introduction to weakly supervised learning
Zhou, Z.-H. (2018) · National Science Review · doi:10.1093/nsr/nwx106 · Cited by 1,899
Settles, B. (2012) · Synthesis Lectures on Artificial Intelligence and Machine Learning · doi:10.2200/s00429ed1v01y201207aim018 · Cited by 605
Active Learning by Querying Informative and Representative Examples
Huang, S.-J., Jin, R., & Zhou, Z.-H. (2014) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2014.2307881 · Cited by 440
Semi-automated screening of biomedical citations for systematic reviews
Wallace, B. C., Trikalinos, T. A., Lau, J., Brodley, C., & Schmid, C. H. (2010) · BMC Bioinformatics · doi:10.1186/1471-2105-11-55 · Cited by 351
Metadata
- Authors
- Dasgupta, S., & Hsu, D.
- Venue
- Proceedings of the 25th international conference on Machine learning - ICML '08
- Publisher
- ACM Press
- Published
- 2008
- Pages
- 208-215
- OpenAlex
- W2042932437
- Cited by
- 444
- References
- 11
- FWCI
- 13.15
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Hierarchical sampling for active learning. https://app.cochat.ai/papers/10.1145/1390156.1390183
- The paper
- Dasgupta, S., & Hsu, D. (2008). Hierarchical sampling for active learning. Proceedings of the 25th international conference on Machine learning - ICML '08. https://doi.org/10.1145/1390156.1390183
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.