2018Unpublished venueRequires access

Kernel Functions and Reproducing Kernel Hilbert Spaces

José Luis Rojo-Álvarez, Manel Martínez-Ramón, Jordi Muñoz-Marí, Gustau Camps-Valls

Open publisher page 4 citations

Abstract

This chapter discusses the fundamental and advanced relevant concepts on Mercer's kernels and reproducing kernel Hilbert spaces (RKHSs). The fundamental building block of the kernel learning theory is the kernel function, which provides an elegant framework to compare complex and nontrivial objects. After its introduction, the chapter reviews the concept of an RKHS and also the representer theorem. It also discusses the main properties on kernel functions and their construction, as well as the basic ideas to work with complex objects and reproducing spaces. The chapter then introduces in detail support vector regression (SVR) algorithm, as it will be widely used and modified for building many of the digital signal processing (DSP) algorithms with kernel methods. Kernel methods rely on the properties of kernel functions. The chapter concludes with some synthetic examples illustrating the concepts and tools presented.

About this research paper

What this paper is about

This chapter discusses the fundamental and advanced relevant concepts on Mercer's kernels and reproducing kernel Hilbert spaces (RKHSs). The fundamental building block of the kernel learning theory is the kernel function, which provides an elegant framework to compare complex and nontrivial objects. After its introduction, the chapter reviews the concept of an RKHS and also the representer theorem. It also discusses the main properties on kernel functions and their construction, as well as the basic ideas to work with complex objects and reproducing spaces. The chapter then introduces in detail support vector regression (SVR) algorithm, as it will be widely used and modified for building many of the digital signal processing (DSP) algorithms with kernel methods. Kernel methods rely on the properties of kernel functions. The chapter concludes with some synthetic examples illustrating the concepts and tools presented.

Why it matters

OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

This chapter discusses the fundamental and advanced relevant concepts on Mercer's kernels and reproducing kernel Hilbert spaces (RKHSs). The fundamental building block of the kernel learning theory is the kernel function, which provides an elegant framework to compare complex and nontrivial objects. After its introduction, the chapter reviews the concept of an RKHS and also the representer theorem. It also discusses the main properties on kernel functions and their construction, as well as the basic ideas to work with complex objects and reproducing spaces. The chapter then introduces in detail support vector regression (SVR) algorithm, as it will be widely used and modified for building many of the digital signal processing (DSP) algorithms with kernel methods. Kernel methods rely on the properties of kernel functions. The chapter concludes with some synthetic examples illustrating the concepts and tools presented.

Key concepts: Representer theorem, Kernel embedding of distributions, Reproducing kernel Hilbert space, Kernel (algebra), Polynomial kernel, Tree kernel, Radial basis function kernel, Kernel method

Related papers

Back to paper searchBrowse research topicsOriginal source
Kernel Functions and Reproducing Kernel Hilbert Spaces — Research Paper | ScholarLens