On the approximation of kernel functions
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1096538 (Why is no real title available?)
- scientific article; zbMATH DE number 1966519 (Why is no real title available?)
- scientific article; zbMATH DE number 5055767 (Why is no real title available?)
- scientific article; zbMATH DE number 3249395 (Why is no real title available?)
- scientific article; zbMATH DE number 7733443 (Why is no real title available?)
- Data spectroscopy: eigenspaces of convolution operators and clustering
- Horseshoes in multidimensional scaling and local kernel methods
- Improved estimates for condition numbers of radial basis function interpolation matrices
- Learning Theory
- On the Nyström method for approximating a gram matrix for improved kernel-based learning
- Optimal rates for the regularized least-squares algorithm
- Sobolev norm learning rates for regularized least-squares algorithms
- Stochastic simulation of patterns using distance-based pattern modeling
- Support Vector Machines
This page was built for publication: On the approximation of kernel functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6982662)