Sciweavers

990 search results - page 21 / 198
» Learning with non-positive kernels
Sort
View
ML
2002
ACM
146views Machine Learning» more  ML 2002»
13 years 9 months ago
Kernel Matching Pursuit
Matching Pursuit algorithms learn a function that is a weighted sum of basis functions, by sequentially appending functions to an initially empty basis, to approximate a target fu...
Pascal Vincent, Yoshua Bengio
CVPR
2011
IEEE
13 years 5 months ago
Local Isomorphism to Solve the Pre-image Problem in Kernel Methods
Kernel methods have been popular over the last decade to solve many computer vision, statistics and machine learning problems. An important, both theoretically and practically, op...
Dong Huang, Yuandong Tian, Fernando DelaTorre
ICML
2010
IEEE
13 years 10 months ago
Fast Neighborhood Subgraph Pairwise Distance Kernel
We introduce a novel graph kernel called the Neighborhood Subgraph Pairwise Distance Kernel. The kernel decomposes a graph into all pairs of neighborhood subgraphs of small radius...
Fabrizio Costa, Kurt De Grave
JMLR
2010
115views more  JMLR 2010»
13 years 4 months ago
Fast and Scalable Local Kernel Machines
A computationally efficient approach to local learning with kernel methods is presented. The Fast Local Kernel Support Vector Machine (FaLK-SVM) trains a set of local SVMs on redu...
Nicola Segata, Enrico Blanzieri
ICML
2003
IEEE
14 years 10 months ago
Learning with Idealized Kernels
James T. Kwok, Ivor W. Tsang