87 search results - page 2 / 18 » A Note on the Generalization Performance of Kernel Classifie... |
169
Voted
COLT
1999
Springer
15 years 9 months ago
1999
Springer
—Support vector (SV) machines are linear classifiers that use the maximum margin hyperplane in a feature space defined by a kernel function. Until recently, the only bounds on th...
150
click to vote
COLT
1998
Springer
15 years 9 months ago
1998
Springer
We introduce and analyze a new algorithm for linear classification which combines Rosenblatt's perceptron algorithm with Helmbold and Warmuth's leave-one-out method. Like...
116
click to vote
COLT
2008
Springer
15 years 6 months ago
2008
Springer
A kernel over the Boolean domain is said to be reflection-invariant, if its value does not change when we flip the same bit in both arguments. (Many popular kernels have this prop...
148
click to vote
ICML
2010
IEEE
15 years 6 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 ...
157
click to vote
TIT
2002
15 years 4 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...