122 search results - page 4 / 25 » Kernelization for Convex Recoloring |
JMLR
2008
13 years 6 months ago
2008
Regularized kernel discriminant analysis (RKDA) performs linear discriminant analysis in the feature space via the kernel trick. Its performance depends on the selection of kernel...
ICASSP
2008
IEEE
14 years 22 days ago
2008
IEEE
The performance of a kernel-based learning algorithm depends very much on the choice of the kernel. Recently, much attention has been paid to the problem of learning the kernel it...
ICML
2006
IEEE
14 years 7 months ago
2006
IEEE
We address the problem of learning a kernel for a given supervised learning task. Our approach consists in searching within the convex hull of a prescribed set of basic kernels fo...
TAMC
2010
Springer
13 years 11 months ago
2010
Springer
Incrementally k-list coloring a graph means that a graph is given by adding stepwise one vertex after another, and for each intermediate step we ask for a vertex coloring such that...
NIPS
2004
13 years 7 months ago
2004
We present an algorithm based on convex optimization for constructing kernels for semi-supervised learning. The kernel matrices are derived from the spectral decomposition of grap...