The DOI matches its Crossref record.
Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm
Open accessOverview
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
Cited by
Computational methods in authorship attribution
Koppel, M., Schler, J., & Argamon, S. (2009) · Journal of the American Society for Information Science and Technology · doi:10.1002/asi.20961 · Cited by 528
The weighted majority algorithm
Littlestone, N., & Warmuth, M. K. (1989) · 30th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1989.63487 · Cited by 295
Self-citationAgnostic Learning of Monomials by Halfspaces Is Hard
Feldman, V., Guruswami, V., Raghavendra, P., & Wu, Y. (2012) · SIAM Journal on Computing · doi:10.1137/120865094 · Cited by 143
Kleyko, D., Rachkovskij, D., Osipov, E., & Rahimi, A. (2023) · ACM Computing Surveys · doi:10.1145/3558000 · Cited by 141
Behavioral Analysis of Insider Threat: A Survey and Bootstrapped Prediction in Imbalanced Data
Azaria, A., Richardson, A., Kraus, S., & Subrahmanian, V. S. (2014) · IEEE Transactions on Computational Social Systems · doi:10.1109/tcss.2014.2377811 · Cited by 133
Metadata
- Authors
- Littlestone, N.
- Venue
- Machine Learning
- Published
- 1988-04
- Volume
- 2
- Issue
- 4
- Pages
- 285-318
- ISSN
- 0885-6125 (ISSN-L)
- 1573-0565
- OpenAlex
- W4246994868
- Cited by
- 497
- References
- 0
- FWCI
- 13.67
- Type
- journal article
- 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: Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. https://app.cochat.ai/papers/10.1007/bf00116827
- The paper
- Littlestone, N. (1988). Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning. https://doi.org/10.1007/bf00116827
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.
