Sciweavers

683 search results - page 25 / 137
» Generalization Bounds for Learning Kernels
Sort
View
MOC
2002
118views more  MOC 2002»
13 years 8 months ago
The error bounds and tractability of quasi-Monte Carlo algorithms in infinite dimension
Dimensionally unbounded problems are frequently encountered in practice, such as in simulations of stochastic processes, in particle and light transport problems and in the problem...
Fred J. Hickernell, Xiaoqun Wang
PKDD
2010
Springer
179views Data Mining» more  PKDD 2010»
13 years 6 months ago
Laplacian Spectrum Learning
Abstract. The eigenspectrum of a graph Laplacian encodes smoothness information over the graph. A natural approach to learning involves transforming the spectrum of a graph Laplaci...
Pannagadatta K. Shivaswamy, Tony Jebara
ICML
2002
IEEE
14 years 9 months ago
Kernels for Semi-Structured Data
Semi-structured data such as XML and HTML is attracting considerable attention. It is important to develop various kinds of data mining techniques that can handle semistructured d...
Hisashi Kashima, Teruo Koyanagi
NIPS
2001
13 years 9 months ago
Generalization Performance of Some Learning Problems in Hilbert Functional Spaces
We investigate the generalization performance of some learning problems in Hilbert functional Spaces. We introduce a notion of convergence of the estimated functional predictor to...
T. Zhang
ML
2008
ACM
110views Machine Learning» more  ML 2008»
13 years 7 months ago
A theory of learning with similarity functions
Kernel functions have become an extremely popular tool in machine learning, with an attractive theory as well. This theory views a kernel as implicitly mapping data points into a ...
Maria-Florina Balcan, Avrim Blum, Nathan Srebro