Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Boosting (machine learning)

Known as: Boost, Boosting (meta-algorithm), Boosting methods for object categorization 
Boosting is a machine learning ensemble meta-algorithm for primarily reducing bias, and also variance in supervised learning, and a family of machine… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
Boosting is an approach to machine learning based on the idea of creating a highly accurate predictor by combining many weak and… Expand
  • table 1.1
  • table 1.2
  • table 2.1
  • table 2.2
  • table 5.1
Highly Cited
2007
Highly Cited
2007
Traditional machine learning makes a basic assumption: the training and test data should be under the same distribution. However… Expand
  • table 1
  • table 2
  • figure 1
  • table 3
  • table 4
Highly Cited
2004
Highly Cited
2004
This work focuses on algorithms which learn from examples to perform multiclass text and speech categorization tasks. Our… Expand
  • figure 4
  • table 1
  • figure 5
  • figure 6
  • figure 7
Highly Cited
2004
Highly Cited
2004
Bagging and boosting are methods that generate a diverse ensemble of classifiers by manipulating the training data given to a… Expand
  • table 1
  • table 2
  • figure 1
  • figure 2
  • figure 3
Review
2003
Review
2003
Boosting is a general method for improving the accuracy of any given learning algorithm. Focusing primarily on the AdaBoost… Expand
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Highly Cited
2001
Highly Cited
2001
We have constructed a frontal face detection system which achieves detection and false positive rates which are equivalent to the… Expand
Review
1999
Review
1999
Boosting is a general method for improving the accuracy of any given learning algorithm. This short overview paper introduces the… Expand
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
1997
Highly Cited
1997
In the first part of the paper we consider the problem of dynamically apportioning resources among a set of options in a worst… Expand
Highly Cited
1996
Highly Cited
1996
In an earlier paper, we introduced a new "boosting" algorithm called AdaBoost which, theoretically, can be used to significantly… Expand
  • table 1
  • table 2
  • figure 3
  • figure 4
  • table 3
Highly Cited
1995
Highly Cited
1995
In the first part of the paper we consider the problem of dynamically apportioning resources among a set of options in a worst… Expand