AdaBoost.pdf
cs.toronto.edu · 2,156 words · saved by 1 readers
N/A
CSC 411 / CSC D11 / CSC C11 AdaBoost 18 AdaBoost Boosting is a general strategy for learning classifiers by combining simpler ones. The idea of boosting is to take a “weak classifier” — that is, any classifier that will do at least slightly better than chance — and use it to build a much better classifier, thereby boosting the performance of the weak classification algorithm. This boosting is done by averaging the outputs of a collection of weak classifiers. The most popular boosting algorithm is AdaBoost,…
related reading
- boosting, nearest neighbour classificationpeople.eecs.berkeley.edu
- The Success of AdaBoost and Its Application in Portfolio Management.pdfarxiv.org
- A Course in Machine Learningciml.info
- Support vector machine - Wikipediaen.wikipedia.org
- Ensemble learning - Wikipediaen.wikipedia.org
- 6.036_notes.pdfphillipi.github.io
- deeplearningbook.org/contents/ml.htmldeeplearningbook.org
- AdaGrad - Cornell University Computational Optimization Open Textbook - Optimization Wikioptimization.cbe.cornell.edu
- CS231n Deep Learning for Computer Visioncs231n.github.io
- catoni_draft2.pdfocatoni.perso.math.cnrs.fr
- Support vector machine - Wikipediaen.wikipedia.org
- Majority-of-Three: The Simplest Optimal Learner?proceedings.mlr.press