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

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

Active learning for biomedical citation screening

Wallace, Byron C., Small, Kevin, Brodley, Carla E., Trikalinos, Thomas A. · 2010 · Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining

Abstract

Active learning (AL) is an increasingly popular strategy for mitigating the amount of labeled data required to train classifiers, thereby reducing annotator effort. We describe a real-world, deployed application of AL to the problem of biomedical citation screening for systematic reviews at the Tufts Medical Center's Evidence-based Practice Center. We propose a novel active learning strategy that exploits a priori domain knowledge provided by the expert (specifically, labeled features)and extend this model via a Linear Programming algorithm for situations where the expert can provide ranked labeled features. Our methods outperform existing AL strategies on three real-world systematic review datasets. We argue that evaluation must be specific to the scenario under consideration. To this end, we propose a new evaluation framework for finite-pool scenarios, wherein the primary aim is to label a fixed set of examples rather than to simply induce a good predictive model. We use a method from medical decision theory for eliciting the relative costs of false positives and false negatives from the domain expert, constructing a utility measure of classification performance that integrates the expert preferences. Our findings suggest that the expert can, and should, provide more information than instance labels alone. In addition to achieving strong empirical results on the citation screening problem, this work outlines many important steps for moving away from simulated active learning and toward deploying AL for real-world applications.

Overview

Integrity signals

Registry

Crossref · 10.1145/1835804.1835829

Cites

32 of 32 references verified0 citation errors · 0 not checkable

Statistics

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

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

Citations

Cites

Show all 34 references

Research works printed but not linked: 3

  1. 10.5555/1699510.1699522 · doi:10.5555/1699510.1699522
  2. 10.5555/1564131.1564140 · doi:10.5555/1564131.1564140
  3. O. F. Zaidan , J. Eisner , and C. Piatko . Machine learning with annotator rationales to reduce annotation cost . In NIPS Workshop on Cost Sensitive Learning , December 2008 O. F. Zaidan, J. Eisner, and C. Piatko. Machine learning with annotator rationales to reduce annotation cost. In NIPS Workshop on Cost Sensitive Learning, December 2008

Cited by

See all 149

Metadata

Authors
Wallace, B. C., Small, K., Brodley, C. E., & Trikalinos, T. A.
Affiliations
  • Tufts University (US)
  • Tufts Medical Center (US)
Venue
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Publisher
ACM
Published
2010-07-25
Pages
173-182
OpenAlex
W2037771830
Cited by
123
References
34
Citations by year
2026: 5 · 2025: 7 · 2024: 4 · 2023: 10 · 2022: 4 · 2021: 8 · 2020: 13 · 2019: 9 · 2018: 10 · 2017: 10 · 2016: 8 · 2015: 10 · 2014: 7 · 2013: 7 · 2012: 7
FWCI
4.65
Type
conference paper
Language
en
Open access
closed
Locations
ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) (publishedVersion)
Funders
  • National Science Foundation
  • U.S. Social Security Administration
  • National Institutes of Health
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Algorithms
  • Social Sciences › Decision Sciences › Statistics, Probability and Uncertainty › Meta-analysis and systematic reviews
  • Physical Sciences › Computer Science › Artificial Intelligence › Domain Adaptation and Few-Shot Learning
Keywords
active learning (machine learning), systematic reviews, linear programming, evidence-based practice centers

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: Active learning for biomedical citation screening. https://app.cochat.ai/papers/10.1145/1835804.1835829
The paper
Wallace, B. C., Small, K., Brodley, C. E., & Trikalinos, T. A. (2010). Active learning for biomedical citation screening. Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining. https://doi.org/10.1145/1835804.1835829

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.