Sciweavers

1039 search results - page 19 / 208
» Kernels and Regularization on Graphs
Sort
View
82
Voted
DM
2007
93views more  DM 2007»
14 years 9 months ago
Small subgraphs of random regular graphs
The main aim of this short paper is to answer the following question. Given a fixed graph H, for which values of the degree d does a random d-regular graph on n vertices contain ...
Jeong Han Kim, Benny Sudakov, Van H. Vu
ICML
2004
IEEE
15 years 10 months ago
Learning with non-positive kernels
In this paper we show that many kernel methods can be adapted to deal with indefinite kernels, that is, kernels which are not positive semidefinite. They do not satisfy Mercer...
Alexander J. Smola, Cheng Soon Ong, Stéphan...
100
Voted
JMLR
2010
155views more  JMLR 2010»
14 years 8 months ago
Approximate Tree Kernels
Convolution kernels for trees provide simple means for learning with tree-structured data. The computation time of tree kernels is quadratic in the size of the trees, since all pa...
Konrad Rieck, Tammo Krueger, Ulf Brefeld, Klaus-Ro...
ICONIP
2004
14 years 11 months ago
Morozov, Ivanov and Tikhonov Regularization Based LS-SVMs
This paper contrasts three related regularization schemes for kernel machines using a least squares criterion, namely Tikhonov and Ivanov regularization and Morozov's discrepa...
Kristiaan Pelckmans, Johan A. K. Suykens, Bart De ...
JCT
2008
100views more  JCT 2008»
14 years 9 months ago
Optimal distortion embeddings of distance regular graphs into Euclidean spaces
ABSTRACT. In this paper we give a lower bound for the least distortion embedding of a distance regular graph into Euclidean space. We use the lower bound for finding the least dist...
Frank Vallentin