Constructing Bayesian formulations of sparse kernel learning methods
From MaRDI portal
Publication:2568020
DOI10.1016/J.NEUNET.2005.06.002zbMath1077.68758OpenAlexW2059521293WikidataQ47612737 ScholiaQ47612737MaRDI QIDQ2568020
Nicola L. C. Talbot, Gavin C. Cawley
Publication date: 7 October 2005
Published in: Neural Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.neunet.2005.06.002
Related Items (3)
Sequential Bayesian kernel modelling with non-Gaussian noise ⋮ How to compare interpretatively different models for the conditional variance function ⋮ Constructing Bayesian formulations of sparse kernel learning methods
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Interpolation of scattered data: distance matrices and conditionally positive definite functions
- Principal component analysis.
- Support-vector networks
- Some results on Tchebycheffian spline functions and stochastic processes
- Constructing Bayesian formulations of sparse kernel learning methods
- Sparse On-Line Gaussian Processes
- 10.1162/15324430260185619
- 10.1162/15324430152748236
- Bayesian Framework for Least-Squares Support Vector Machine Classifiers, Gaussian Processes, and Kernel Fisher Discriminant Analysis
- Ridge Regression: Biased Estimation for Nonorthogonal Problems
- A Simplex Method for Function Minimization
- A fast dual algorithm for kernel logistic regression
- An introduction to statistical modeling of extreme values
- Choosing multiple parameters for support vector machines
This page was built for publication: Constructing Bayesian formulations of sparse kernel learning methods
