116 search results - page 6 / 24 » Empirical Bernstein Boosting |
128
Voted
ICML
2007
IEEE
16 years 2 months ago
2007
IEEE
A general framework is proposed for gradient boosting in supervised learning problems where the loss function is defined using a kernel over the output space. It extends boosting ...
124
Voted
ICML
2003
IEEE
16 years 2 months ago
2003
IEEE
This paper explores the problem of how to construct lazy decision tree ensembles. We present and empirically evaluate a relevancebased boosting-style algorithm that builds a lazy ...
CVPR
2008
IEEE
16 years 3 months ago
2008
IEEE
We introduce a generalized representation for a boosted classifier with multiple exit nodes, and propose a method to training which combines the idea of propagating scores across ...
118
Voted
ML
2002
ACM
15 years 1 months ago
2002
ACM
We consider the existence of a linear weak learner for boosting algorithms. A weak learner for binary classification problems is required to achieve a weighted empirical error on t...
116
click to vote
KDD
2008
ACM
16 years 2 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...