Sciweavers

683 search results - page 17 / 137
» Generalization Bounds for Learning Kernels
Sort
View
ICML
2008
IEEE
14 years 8 months ago
Metric embedding for kernel classification rules
In this paper, we consider a smoothing kernelbased classification rule and propose an algorithm for optimizing the performance of the rule by learning the bandwidth of the smoothi...
Bharath K. Sriperumbudur, Omer A. Lang, Gert R. G....
GFKL
2007
Springer
164views Data Mining» more  GFKL 2007»
13 years 11 months ago
Classification with Invariant Distance Substitution Kernels
Kernel methods offer a flexible toolbox for pattern analysis and machine learning. A general class of kernel functions which incorporates known pattern invariances are invariant d...
Bernard Haasdonk, Hans Burkhardt
ICML
2007
IEEE
14 years 8 months ago
Sample compression bounds for decision trees
We propose a formulation of the Decision Tree learning algorithm in the Compression settings and derive tight generalization error bounds. In particular, we propose Sample Compres...
Mohak Shah
CVPR
2010
IEEE
14 years 3 months ago
Efficient Additive Kernels via Explicit Feature Maps
Maji and Berg [13] have recently introduced an explicit feature map approximating the intersection kernel. This enables efficient learning methods for linear kernels to be applied...
Andrea Vedaldi, Andrew Zisserman
ECML
2004
Springer
13 years 11 months ago
Efficient Hyperkernel Learning Using Second-Order Cone Programming
The kernel function plays a central role in kernel methods. Most existing methods can only adapt the kernel parameters or the kernel matrix based on empirical data. Recently, Ong e...
Ivor W. Tsang, James T. Kwok