UCL logo

UCL Discovery

UCL home » Library Services » Electronic resources » UCL Discovery

Estimating the moments of a random vector with applications

Shawe-Taylor, J; Cristianini, N; (2003) Estimating the moments of a random vector with applications. In: UNSPECIFIED

Full text not available from this repository.

Abstract

A general result about the quality of approximation of the mean of a distribution by its empirical estimate is proven that does not involve the dimension of the feature space. Using the kernel trick this gives also bounds the quality of approximation of higher order moments. A number of applications are derived of interest in learning theory including a new novelty detection algorithm and rigorous bounds on the Robust Minimax Classification algorithm

Type:Book chapter
Title:Estimating the moments of a random vector with applications
Additional information:Invited Talk
Keywords:learning theory
UCL classification:UCL > School of BEAMS > Faculty of Engineering Science > Computer Science

Archive Staff Only: edit this record