364 search results - page 8 / 73 » On the generalization of soft margin algorithms |
AAAI
1998
13 years 10 months ago
1998
The "minimum margin" of an ensemble classifier on a given training set is, roughly speaking, the smallest vote it gives to any correct training label. Recent work has sh...
ICML
2004
IEEE
14 years 9 months ago
2004
IEEE
Boosting is a popular approach for building accurate classifiers. Despite the initial popular belief, boosting algorithms do exhibit overfitting and are sensitive to label noise. ...
ML
2000
ACM
13 years 8 months ago
2000
ACM
Capacity control in perceptron decision trees is typically performed by controlling their size. We prove that other quantities can be as relevant to reduce their flexibility and co...
COLT
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. We present several results related to ranking. We give a general margin-based bound for ranking based on the L∞ covering number of the hypothesis space. Our bound sugge...
JMLR
2010
13 years 3 months ago
2010
This paper proposes a novel algorithm for semisupervised learning. This algorithm learns graph cuts that maximize the margin with respect to the labels induced by the harmonic fun...