A family of online boosting algorithms

Boris Babenko, Ming Hsuan Yang, Serge Belongie

Research output: Chapter in Book/Report/Conference proceedingConference contribution

16 Citations (Scopus)

Abstract

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
Title of host publication2009 IEEE 12th International Conference on Computer Vision Workshops, ICCV Workshops 2009
Pages1346-1353
Number of pages8
DOIs
Publication statusPublished - 2009 Dec 1
Event2009 IEEE 12th International Conference on Computer Vision Workshops, ICCV Workshops 2009 - Kyoto, Japan
Duration: 2009 Sep 272009 Oct 4

Publication series

Name2009 IEEE 12th International Conference on Computer Vision Workshops, ICCV Workshops 2009

Conference

Conference2009 IEEE 12th International Conference on Computer Vision Workshops, ICCV Workshops 2009
CountryJapan
CityKyoto
Period09/9/2709/10/4

Fingerprint

Supervised learning
Cost functions
Computer vision
Learning systems
Logistics

All Science Journal Classification (ASJC) codes

  • Computer Vision and Pattern Recognition
  • Electrical and Electronic Engineering

Cite this

Babenko, B., Yang, M. H., & Belongie, S. (2009). A family of online boosting algorithms. In 2009 IEEE 12th International Conference on Computer Vision Workshops, ICCV Workshops 2009 (pp. 1346-1353). [5457453] (2009 IEEE 12th International Conference on Computer Vision Workshops, ICCV Workshops 2009). https://doi.org/10.1109/ICCVW.2009.5457453
Babenko, Boris ; Yang, Ming Hsuan ; Belongie, Serge. / A family of online boosting algorithms. 2009 IEEE 12th International Conference on Computer Vision Workshops, ICCV Workshops 2009. 2009. pp. 1346-1353 (2009 IEEE 12th International Conference on Computer Vision Workshops, ICCV Workshops 2009).
@inproceedings{0a248faefd084c938384dc192f567af0,
title = "A family of online boosting algorithms",
abstract = "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.",
author = "Boris Babenko and Yang, {Ming Hsuan} and Serge Belongie",
year = "2009",
month = "12",
day = "1",
doi = "10.1109/ICCVW.2009.5457453",
language = "English",
isbn = "9781424444427",
series = "2009 IEEE 12th International Conference on Computer Vision Workshops, ICCV Workshops 2009",
pages = "1346--1353",
booktitle = "2009 IEEE 12th International Conference on Computer Vision Workshops, ICCV Workshops 2009",

}

Babenko, B, Yang, MH & Belongie, S 2009, A family of online boosting algorithms. in 2009 IEEE 12th International Conference on Computer Vision Workshops, ICCV Workshops 2009., 5457453, 2009 IEEE 12th International Conference on Computer Vision Workshops, ICCV Workshops 2009, pp. 1346-1353, 2009 IEEE 12th International Conference on Computer Vision Workshops, ICCV Workshops 2009, Kyoto, Japan, 09/9/27. https://doi.org/10.1109/ICCVW.2009.5457453

A family of online boosting algorithms. / Babenko, Boris; Yang, Ming Hsuan; Belongie, Serge.

2009 IEEE 12th International Conference on Computer Vision Workshops, ICCV Workshops 2009. 2009. p. 1346-1353 5457453 (2009 IEEE 12th International Conference on Computer Vision Workshops, ICCV Workshops 2009).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - A family of online boosting algorithms

AU - Babenko, Boris

AU - Yang, Ming Hsuan

AU - Belongie, Serge

PY - 2009/12/1

Y1 - 2009/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=77953195665&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77953195665&partnerID=8YFLogxK

U2 - 10.1109/ICCVW.2009.5457453

DO - 10.1109/ICCVW.2009.5457453

M3 - Conference contribution

AN - SCOPUS:77953195665

SN - 9781424444427

T3 - 2009 IEEE 12th International Conference on Computer Vision Workshops, ICCV Workshops 2009

SP - 1346

EP - 1353

BT - 2009 IEEE 12th International Conference on Computer Vision Workshops, ICCV Workshops 2009

ER -

Babenko B, Yang MH, Belongie S. A family of online boosting algorithms. In 2009 IEEE 12th International Conference on Computer Vision Workshops, ICCV Workshops 2009. 2009. p. 1346-1353. 5457453. (2009 IEEE 12th International Conference on Computer Vision Workshops, ICCV Workshops 2009). https://doi.org/10.1109/ICCVW.2009.5457453