417 search results - page 1 / 84 » Some Theory for Generalized Boosting Algorithms |
JMLR
2006
13 years 4 months ago
2006
We give a review of various aspects of boosting, clarifying the issues through a few simple results, and relate our work and that of others to the minimax paradigm of statistics. ...
ICML
2001
IEEE
14 years 5 months ago
2001
IEEE
This is a survey of some theoretical results on boosting obtained from an analogous treatment of some regression and classi cation boosting algorithms. Some related papers include...
KDD
2008
ACM
14 years 5 months ago
2008
ACM
We propose a family of novel cost-sensitive boosting methods for multi-class classification by applying the theory of gradient boosting to p-norm based cost functionals. We establ...
COLT
2000
Springer
13 years 9 months ago
2000
Springer
We describe a novel family of PAC model algorithms for learning linear threshold functions. The new algorithms work by boosting a simple weak learner and exhibit complexity bounds...
ECCC
2011
12 years 8 months ago
2011
The last two decades have seen enormous progress in the development of sublinear-time algorithms — i.e., algorithms that examine/reveal properties of “data” in less time tha...