Corpus ID: 60611377

Boosting: Foundations and Algorithms

@inproceedings{Schapire2012BoostingFA,
  title={Boosting: Foundations and Algorithms},
  author={Robert E. Schapire and Yoav Freund},
  year={2012}
}
  • Robert E. Schapire, Yoav Freund
  • Published 2012
  • Computer Science
  • Boosting is an approach to machine learning based on the idea of creating a highly accurate predictor by combining many weak and inaccurate "rules of thumb." A remarkably rich theory has evolved around boosting, with connections to a range of topics, including statistics, game theory, convex optimization, and information geometry. Boosting algorithms have also enjoyed practical success in such fields as biology, vision, and speech processing. At various times in its history, boosting has been… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 380 CITATIONS

    Exploring Mixed-signal Computation for Energy Aggressive Interface Architectures

    VIEW 8 EXCERPTS
    CITES METHODS & BACKGROUND
    HIGHLY INFLUENCED

    A Confidence-Based Approach for Balancing Fairness and Accuracy

    VIEW 10 EXCERPTS
    CITES BACKGROUND
    HIGHLY INFLUENCED

    EARLY PREDICTION OF CARDIAC ARREST THROUGH HEART RATE VARIABILITY ANALYSIS

    VIEW 5 EXCERPTS
    CITES METHODS
    HIGHLY INFLUENCED

    Enhancing Stereo Matching With Classification

    VIEW 15 EXCERPTS
    CITES METHODS
    HIGHLY INFLUENCED

    Boosting for Comparison-Based Learning

    VIEW 4 EXCERPTS
    CITES METHODS & BACKGROUND
    HIGHLY INFLUENCED

    Can you on-sight it ?

    VIEW 7 EXCERPTS
    CITES METHODS
    HIGHLY INFLUENCED

    Axiomatic Characterization of AdaBoost and the Multiplicative Weight Update Procedure

    VIEW 6 EXCERPTS
    CITES METHODS & BACKGROUND
    HIGHLY INFLUENCED

    Algorithms and Complexity Results for Learning and Big Data

    VIEW 6 EXCERPTS
    CITES BACKGROUND
    HIGHLY INFLUENCED

    FILTER CITATIONS BY YEAR

    2011
    2020

    CITATION STATISTICS

    • 39 Highly Influenced Citations

    • Averaged 58 Citations per year from 2017 through 2019

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 220 REFERENCES

    Efficient Margin Maximizing with Boosting

    VIEW 7 EXCERPTS
    HIGHLY INFLUENTIAL

    Sample compression, learnability, and the Vapnik-Chervonenkis dimension

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    Boosting a weak learning algorithm by majority

    VIEW 7 EXCERPTS

    A theory of multiclass boosting

    VIEW 5 EXCERPTS

    Margin-based Ranking and an Equivalence between AdaBoost and RankBoost

    VIEW 6 EXCERPTS