1235 search results - page 143 / 247 » Learning with Idealized Kernels |
139
click to vote
NIPS
2000
15 years 5 months ago
2000
We present an improvement of Noviko 's perceptron convergence theorem. Reinterpreting this mistakebound as a margindependent sparsity guarantee allows us to give a PAC{style ...
117
click to vote
ICML
2003
IEEE
16 years 4 months ago
2003
IEEE
When the training instances of the target class are heavily outnumbered by non-target training instances, SVMs can be ineffective in determining the class boundary. To remedy this...
119
Voted
NIPS
2007
15 years 5 months ago
2007
Incorporating invariances into a learning algorithm is a common problem in machine learning. We provide a convex formulation which can deal with arbitrary loss functions and arbit...
147
click to vote
ACL
2006
15 years 5 months ago
2006
In this paper we define a novel similarity measure between examples of textual entailments and we use it as a kernel function in Support Vector Machines (SVMs). This allows us to ...
122
click to vote
FLAIRS
2006
15 years 5 months ago
2006
We introduce a novel learning algorithm for noise elimination. Our algorithm is based on the re-measurement idea for the correction of erroneous observations and is able to discri...