Sciweavers

116 search results - page 1 / 24
» Empirical Bernstein Boosting
Sort
View
JMLR
2010
161views more  JMLR 2010»
12 years 11 months ago
Empirical Bernstein Boosting
Concentration inequalities that incorporate variance information (such as Bernstein's or Bennett's inequality) are often significantly tighter than counterparts (such as...
Pannagadatta K. Shivaswamy, Tony Jebara
ICML
2008
IEEE
14 years 5 months ago
Empirical Bernstein stopping
Sampling is a popular way of scaling up machine learning algorithms to large datasets. The question often is how many samples are needed. Adaptive stopping algorithms monitor the ...
Csaba Szepesvári, Jean-Yves Audibert, Volod...
ML
2007
ACM
153views Machine Learning» more  ML 2007»
13 years 4 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
MCS
2009
Springer
13 years 11 months ago
Multi-class Boosting with Class Hierarchies
Abstract. We propose AdaBoost.BHC, a novel multi-class boosting algorithm. AdaBoost.BHC solves a C class problem by using C − 1 binary classifiers defined by a hierarchy that i...
Goo Jun, Joydeep Ghosh
CIDM
2009
IEEE
13 years 11 months ago
An empirical study of bagging and boosting ensembles for identifying faulty classes in object-oriented software
—  Identifying faulty classes in object-oriented software is one of the important software quality assurance activities. This paper empirically investigates the application of t...
Hamoud I. Aljamaan, Mahmoud O. Elish