Cited by 1,674Machine Learning and AlgorithmsComplexity and Algorithms in Graphssemigroups and automata theory

Boosting a Weak Learning Algorithm by Majority

Open access
Freund, Y.·1995·Information and Computation

Integrity signals

Registry

Crossref · 10.1006/inco.1995.1136

Cites

Statistics

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

Claims the paper makes

We couldn’t retrieve this paper’s full text, 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?

  • Boosting is originally described in Schapire (1990) and Freund (1995) for classification problems to improve the performance of a set of weak learners.

    “Boosting is originally described inSchapire (1990) andFreund (1995) for classification problems to improve the performance of a set of weak learners.”

    From Empirical Asset Pricing via Machine Learning (2020) · cites this paper as Freund (1995)

Cites

Still being checked.

Cited by

Sorted by citations

Authors
Freund, Y.
Affiliations
AT&T (United States) (US)
Corresponding author
Freund, Y.
Venue
Information and Computation
Publisher
Elsevier BV
Published
1995-09
Volume
121
Issue
2
Pages
256-285
ISSN
0890-5401 (ISSN-L)
OpenAlex
W2070534370
Cited by
1,674
References
0
Citations by year
2026: 30 · 2025: 54 · 2024: 64 · 2023: 70 · 2022: 68 · 2021: 82 · 2020: 72 · 2019: 79 · 2018: 55 · 2017: 57 · 2016: 55 · 2015: 59 · 2014: 56 · 2013: 68 · 2012: 67
FWCI
15.27
Type
journal article
Language
en
Open access
Locations
Information and Computation (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Algorithms
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › semigroups and automata theory
Keywords
boosting, weak learning, majority voting, PAC learning, learnability, threshold circuits, power of representation, generalization bounds

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