REGULARIZED LEAST SQUARE REGRESSION WITH SPHERICAL POLYNOMIAL KERNELS
From MaRDI portal
Publication:5189976
DOI10.1142/S0219691309003240zbMath1184.68410MaRDI QIDQ5189976
Publication date: 11 March 2010
Published in: International Journal of Wavelets, Multiresolution and Information Processing (Search for Journal in Brave)
reproducing kernel Hilbert space; learning rate; regularized least square regression; de la Vallée-Poussin operator; spherical polynomial kernel
Related Items
The kernel regularized learning algorithm for solving Laplace equation with Dirichlet boundary, Error analysis of kernel regularized pairwise learning with a strongly convex loss, Learning rates of regularized regression on the unit sphere, Nonparametric regression using needlet kernels for spherical data, Approximating and learning by Lipschitz kernel on the sphere, MODEL SELECTION OF C-SUPPORT VECTOR MACHINES BASED ON MULTI-THREADING GENETIC ALGORITHM, RANK-1 TENSOR PROJECTION VIA REGULARIZED REGRESSION FOR ACTION CLASSIFICATION, THE COEFFICIENT REGULARIZED REGRESSION WITH RANDOM PROJECTION, TEXTURE ANALYSIS USING GAUSSIAN GRAPHICAL MODELS, AN ASYMMETRIC ADAPTIVE CLASSIFICATION METHOD, LOCAL LEARNING ESTIMATES BY INTEGRAL OPERATORS, GABOR-BASED TENSOR LOCAL DISCRIMINANT EMBEDDING AND ITS APPLICATION ON PALMPRINT RECOGNITION
Cites Work
- Unnamed Item
- On the de la Vallée-Poussin means on the sphere
- Learning rates for regularized classifiers using multivariate polynomial kernels
- Best choices for regularization parameters in learning theory: on the bias-variance problem.
- Regularization networks and support vector machines
- Error bounds of multi-graph regularized semi-supervised classification
- On the rate of convergence for multi-category classification based on convex losses
- Approximation with polynomial kernels and SVM classifiers
- Learning rates of least-square regularized regression
- On the mathematical foundations of learning
- On Wallis' formula
- Learning Theory
- A WAVELET APPROACH FOR CLASSIFICATION OF MICROARRAY DATA
- HILBERT–SCHMIDT OPERATORS AND FRAMES — CLASSIFICATION, BEST APPROXIMATION BY MULTIPLIERS AND ALGORITHMS
- ANALYSIS OF CLASSIFICATION WITH A REJECT OPTION
- Approximation processes for fourier-jacobi expansions†
- SVM Soft Margin Classifiers: Linear Programming versus Quadratic Programming
- Generalization performance of multi-category kernel machines