A family of online boosting algorithms

Research output: Contribution to journalConference articleResearchpeer-review

Boosting has become a powerful and useful tool in the machine learning and computer vision communities in recent years, and many interesting boosting algorithms have been developed to solve various challenging problems. In particular, Friedman proposed a flexible framework called gradient boosting, which has been used to derive boosting procedures for regression, multiple instance learning, semi-supervised learning, etc. Recently some attention has been given to online boosting (where the examples become available one at a time). In this paper we develop a boosting framework that can be used to derive online boosting algorithms for various cost functions. Within this framework, we derive online boosting algorithms for Logistic Regression, Least Squares Regression, and Multiple Instance Learning. We present promising results on a wide range of data sets.

Original languageEnglish
Journal2009 IEEE 12th International Conference on Computer Vision Workshops, ICCV Workshops 2009
Pages (from-to)1346-1353
Number of pages8
DOIs
Publication statusPublished - 2009
Externally publishedYes
Event2009 IEEE 12th International Conference on Computer Vision Workshops, ICCV Workshops 2009 - Kyoto, Japan
Duration: 27 Sep 20094 Oct 2009

Conference

Conference2009 IEEE 12th International Conference on Computer Vision Workshops, ICCV Workshops 2009
CountryJapan
CityKyoto
Period27/09/200904/10/2009

ID: 302048989