Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

ICANN
2005
Springer

favoriteEmaildiscussreport

93views Neural Networks» more ICANN 2005»

Smooth Bayesian Kernel Machines

13 years 10 months ago

Smooth Bayesian Kernel Machines

Download www.terborg.net

Abstract. In this paper, we consider the possibility of obtaining a kernel machine that is sparse in feature space and smooth in output space. Smooth in output space implies that the underlying function is supposed to have continuous derivatives up to some order. Smoothness is achieved by applying a roughness penalty, a concept from the area of functional data analysis. Sparseness is taken care of by automatic relevance determination. Both are combined in a Bayesian model, which has been implemented and tested. Test results are presented in the paper.

Rutger W. ter Borg, Léon J. M. Rothkrantz

Real-time Traffic

Automatic Relevance Determination | Functional Data Analysis | ICANN 2005 | Output Space |

claim paper

Related Content

» Mercers Theorem Feature Maps and Smoothing

» The generalized Bayesian committee machine

» Smoothed Particle Filtering for Dynamic Bayesian Networks

» Understanding Gaussian Process Regression Using the Equivalent Kernel

» On Kernel Selection in Relevance Vector Machines Using Stability Principle

» The Use of Bayesian Framework for Kernel Selection in Vector Machines Classifiers

» Covariance Kernels from Bayesian Generative Models

» Kernel bandwidth estimation in methods based on probability density function modelling

» Bayesian Reward Filtering

Post Info
More Details (n/a)

Added	27 Jun 2010
Updated	27 Jun 2010
Type	Conference
Year	2005
Where	ICANN
Authors	Rutger W. ter Borg, Léon J. M. Rothkrantz

Comments (0)