68 search results - page 9 / 14 » On the Margin Explanation of Boosting Algorithms |
SARA
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. If a CSP instance has no solution, it contains a smaller unsolvable subproblem that makes unsolvable the whole problem. When solving such instance, instead of just return...
ICML
2010
IEEE
13 years 9 months ago
2010
IEEE
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...
ICML
2006
IEEE
14 years 8 months ago
2006
IEEE
A multiclass classification problem can be reduced to a collection of binary problems with the aid of a coding matrix. The quality of the final solution, which is an ensemble of b...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
In semi-supervised classification boosting, a similarity measure is demanded in order to measure the distance between samples (both labeled and unlabeled). However, most of the e...
ECCV
2010
Springer
14 years 1 months ago
2010
Springer
Many learning tasks for computer vision problems can be described by multiple views or multiple features. These views can be exploited in order to learn from unlabeled data, a.k.a....