Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

31

ICML
1997
IEEE

favoriteEmaildiscussreport

142views Machine Learning» more ICML 1997»

Boosting the margin: A new explanation for the effectiveness of voting methods

14 years 11 months ago

Boosting the margin: A new explanation for the effectiveness of voting methods

Download www.cc.gatech.edu

Robert E. Schapire, Yoav Freund, Peter Barlett, We

Real-time Traffic

ICML 1997 | Machine Learning |

claim paper

Related Content

» On the Margin Explanation of Boosting Algorithms

» Boosting in the Limit Maximizing the Margin of Learned Ensembles

» Improving Random Forests

» MultiClass Learning by Smoothed Boosting

» Two new regularized AdaBoost algorithms

» Singlepass online learning performance voting schemes and online feature selection

» Using RankBoost to compare retrieval systems

» Informedia TRECVID2008 Exploring New Frontiers

Post Info
More Details (n/a)

Added	17 Nov 2009
Updated	17 Nov 2009
Type	Conference
Year	1997
Where	ICML
Authors	Robert E. Schapire, Yoav Freund, Peter Barlett, Wee Sun Lee

Comments (0)