486 search results - page 13 / 98 » Boosting and Hard-Core Sets |
123
Voted
PAKDD
2000
ACM
15 years 3 months ago
2000
ACM
Combining multiple global models (e.g. back-propagation based neural networks) is an effective technique for improving classification accuracy by reducing a variance through manipu...
NIPS
2007
15 years 1 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....
112
click to vote
COLT
1998
Springer
15 years 4 months ago
1998
Springer
Abstract. We describe several improvements to Freund and Schapire's AdaBoost boosting algorithm, particularly in a setting in which hypotheses may assign confidences to each o...
NIPS
2003
15 years 1 months ago
2003
We investigate improvements of AdaBoost that can exploit the fact that the weak hypotheses are one-sided, i.e. either all its positive (or negative) predictions are correct. In pa...
CIKM
2000
Springer
15 years 4 months ago
2000
Springer
RankBoost is a recently proposed algorithm for learning ranking functions. It is simple to implement and has strong justifications from computational learning theory. We describe...