Sciweavers

9 search results - page 1 / 2
» Boosting the margin: A new explanation for the effectiveness...
Sort
View
ICML
1997
IEEE
14 years 11 months ago
Boosting the margin: A new explanation for the effectiveness of voting methods
Robert E. Schapire, Yoav Freund, Peter Barlett, We...
COLT
2008
Springer
14 years 21 days ago
On the Margin Explanation of Boosting Algorithms
Much attention has been paid to the theoretical explanation of the empirical success of AdaBoost. The most influential work is the margin theory, which is essentially an upper bou...
Liwei Wang, Masashi Sugiyama, Cheng Yang, Zhi-Hua ...
AAAI
1998
14 years 8 days ago
Boosting in the Limit: Maximizing the Margin of Learned Ensembles
The "minimum margin" of an ensemble classifier on a given training set is, roughly speaking, the smallest vote it gives to any correct training label. Recent work has sh...
Adam J. Grove, Dale Schuurmans
ECML
2004
Springer
14 years 4 months ago
Improving Random Forests
Random forests are one of the most successful ensemble methods which exhibits performance on the level of boosting and support vector machines. The method is fast, robust to noise,...
Marko Robnik-Sikonja
ML
2007
ACM
153views Machine Learning» more  ML 2007»
13 years 10 months ago
Multi-Class Learning by Smoothed Boosting
AdaBoost.OC has been shown to be an effective method in boosting “weak” binary classifiers for multi-class learning. It employs the Error-Correcting Output Code (ECOC) method ...
Rong Jin, Jian Zhang 0003