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

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

Training algorithms for linear text classifiers

Open access
Lewis, David D., Schapire, Robert E., Callan, James P., Papka, Ron·1996·Proceedings of the 19th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '96

Abstract

Systems for text retrieval, routing, categorization and other IR tasks rely heavily on linear classifiers.We propose that two machine learning algorithms, the Widrow-Hoff and EG algorithms, be used in training linear text classifiers.In contrast to most IR methods, theoretical analysis provides performance guarantees and guidance on parameter settings for these algorithms.Experimental data is presented showing Widrow-Hoff and EG to be more effective than the widely used Rocchio algorithm on several categorization and routing tasks.

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.

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

Integrity signals

Registry

Crossref · 10.1145/243199.243277

Cites

1 of 1 references verified0 citation errors · 0 not checkable

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.

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

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

Show all 1 references

Cited by

See all 520

Metadata

Authors
Lewis, D. D., Schapire, R. E., Callan, J. P., & Papka, R.
Venue
Proceedings of the 19th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '96
Publisher
ACM Press
Published
1996
Pages
298-306
OpenAlex
W2060216474
Cited by
520
References
1
FWCI
20.25
Type
conference paper
Language
en
Open access
bronze

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: Training algorithms for linear text classifiers. https://app.cochat.ai/papers/10.1145/243199.243277
The paper
Lewis, D. D., Schapire, R. E., Callan, J. P., & Papka, R. (1996). Training algorithms for linear text classifiers. Proceedings of the 19th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '96. https://doi.org/10.1145/243199.243277

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.