%0 Journal Article %1 meir_introduction_2003 %A Meir, Ron %A Rätsch, Gunnar %D 2003 %J Lecture Notes in Computer Science %K Boosting, Learning, Machine machines regularization, support vector %P 118--183 %R 10.1007/3-540-36434-X_4 %T An introduction to boosting and leveraging %U http://www.springerlink.com/content/8574x0tm63nvjbem/fulltext.pdf %V 2600 %X We provide an introduction to theoretical and practical aspects of Boosting and Ensemble learning, providing a useful reference for researchers in the field of Boosting as well as for those seeking to enter this fascinating area of research. We begin with a short background concerning the necessary learning theoretical foundations of weak learners and their linear combinations. We then point out the useful connection between Boosting and the Theory of Optimization, which facilitates the understanding of Boosting and later on enables us to move on to new Boosting algorithms, applicable to a broad spectrum of problems. In order to increase the relevance of the paper to practitioners, we have added remarks, pseudo code, “tricks of the trade”, and algorithmic considerations where appropriate. Finally, we illustrate the usefulness of Boosting algorithms by giving an overview of some existing applications. The main ideas are illustrated on the problem of binary classification, although several extensions are discussed.

@article{meir_introduction_2003, abstract = {We provide an introduction to theoretical and practical aspects of Boosting and Ensemble learning, providing a useful reference for researchers in the field of Boosting as well as for those seeking to enter this fascinating area of research. We begin with a short background concerning the necessary learning theoretical foundations of weak learners and their linear combinations. We then point out the useful connection between Boosting and the Theory of Optimization, which facilitates the understanding of Boosting and later on enables us to move on to new Boosting algorithms, applicable to a broad spectrum of problems. In order to increase the relevance of the paper to practitioners, we have added remarks, pseudo code, “tricks of the trade”, and algorithmic considerations where appropriate. Finally, we illustrate the usefulness of Boosting algorithms by giving an overview of some existing applications. The main ideas are illustrated on the problem of binary classification, although several extensions are discussed.}, added-at = {2017-01-09T13:57:26.000+0100}, author = {Meir, Ron and Rätsch, Gunnar}, biburl = {https://www.bibsonomy.org/bibtex/25105ac24bd7418c9b9ead01d0bb01d67/yourwelcome}, doi = {10.1007/3-540-36434-X_4}, interhash = {8d1f55b6b82c740aa4cf6c581046feeb}, intrahash = {5105ac24bd7418c9b9ead01d0bb01d67}, journal = {Lecture Notes in Computer Science}, keywords = {Boosting, Learning, Machine machines regularization, support vector}, pages = {118--183}, timestamp = {2017-01-09T14:01:11.000+0100}, title = {An introduction to boosting and leveraging}, url = {http://www.springerlink.com/content/8574x0tm63nvjbem/fulltext.pdf}, urldate = {2012-03-02}, volume = 2600, year = 2003 }