683 search results - page 12 / 137 » Generalization Bounds for Learning Kernels |
ICPR
2008
IEEE
14 years 1 months ago
2008
IEEE
The problem of signature verification is considered within the bounds of the kernel-based methodology of pattern recognition, more specifically, SVM principle of machine learning....
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
Most modern computer vision systems for high-level
tasks, such as image classification, object recognition and
segmentation, are based on learning algorithms that are
able to se...
PKDD
2009
Springer
14 years 1 months ago
2009
Springer
A serious drawback of kernel methods, and Support Vector Machines (SVM) in particular, is the difficulty in choosing a suitable kernel function for a given dataset. One of the appr...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance o...
ALT
2008
Springer
14 years 4 months ago
2008
Springer
We give a bound on the expected reconstruction error for a general coding method where data in a Hilbert space are represented by finite dimensional coding vectors. The result can...