Sciweavers

1235 search results - page 28 / 247
» Learning with Idealized Kernels
Sort
View
ECML
2004
Springer
14 years 1 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
FOCM
2006
97views more  FOCM 2006»
13 years 10 months ago
Learning Rates of Least-Square Regularized Regression
This paper considers the regularized learning algorithm associated with the leastsquare loss and reproducing kernel Hilbert spaces. The target is the error analysis for the regres...
Qiang Wu, Yiming Ying, Ding-Xuan Zhou
IPL
2011
131views more  IPL 2011»
13 years 4 months ago
The regularized least squares algorithm and the problem of learning halfspaces
We provide sample complexity of the problem of learning halfspaces with monotonic noise, using the regularized least squares algorithm in the reproducing kernel Hilbert spaces (RKH...
Ha Quang Minh
ICML
2008
IEEE
14 years 10 months ago
Graph kernels between point clouds
Point clouds are sets of points in two or three dimensions. Most kernel methods for learning on sets of points have not yet dealt with the specific geometrical invariances and pra...
Francis R. Bach
ICML
2004
IEEE
14 years 10 months ago
Kernel conditional random fields: representation and clique selection
Kernel conditional random fields (KCRFs) are introduced as a framework for discriminative modeling of graph-structured data. A representer theorem for conditional graphical models...
John D. Lafferty, Xiaojin Zhu, Yan Liu