364 search results - page 1 / 73 » On the generalization of soft margin algorithms |
82
Voted
TIT
2002
14 years 9 months ago
2002
Generalization bounds depending on the margin of a classifier are a relatively recent development. They provide an explanation of the performance of state-of-the-art learning syste...
73
Voted
PAKDD
2005
ACM
15 years 3 months ago
2005
ACM
Abstract. Hard margin support vector machines (HM-SVMs) have a risk of getting overfitting in the presence of the noise. Soft margin SVMs deal with this
IDA
2002
Springer
14 years 9 months ago
2002
Springer
This paper introduces a strategy for training ensemble classifiers by analysing boosting within margin theory. We present a bound on the generalisation error of ensembled classifi...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We identify the classical Perceptron algorithm with margin as a member of a broader family of large margin classifiers which we collectively call the Margitron. The Margitron, (des...
ALT
2008
Springer
15 years 6 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...