24 search results - page 1 / 5 » Boosting Algorithms for Maximizing the Soft Margin |
NIPS
2007
13 years 6 months ago
2007
We present a novel boosting algorithm, called SoftBoost, designed for sets of binary labeled examples that are not necessarily separable by convex combinations of base hypotheses....
ALT
2008
Springer
14 years 1 months ago
2008
Springer
In this paper we discuss boosting algorithms that maximize the soft margin of the produced linear combination of base hypotheses. LPBoost is the most straightforward boosting algor...
ALT
2008
Springer
14 years 1 months ago
2008
Springer
We propose a new boosting algorithm for bipartite ranking problems. Our boosting algorithm, called SoftRankBoost, is a modification of RankBoost which maintains only smooth distri...
COLT
2008
Springer
13 years 6 months ago
2008
Springer
Boosting algorithms build highly accurate prediction mechanisms from a collection of lowaccuracy predictors. To do so, they employ the notion of weak-learnability. The starting po...
ML
2002
ACM
13 years 4 months ago
2002
ACM
We examine linear program (LP) approaches to boosting and demonstrate their efficient solution using LPBoost, a column generation based simplex method. We formulate the problem as...