Efficient formation of a basis in a kernel induced feature space

Research output: Contribution to conferencePaper

Abstract

Baudat and Anouar [1] propose a simple greedy algorithm for estimation of an approximate basis of the subspace spanned by a set of fixed vectors embedded in a kernel induced feature space. The resulting set of basis vectors can then be used to construct sparse kernel expansions for classification and regression tasks. In this paper we describe five algorithmic improvements to the method of Baudat and Anouar, allowing the construction of an approximate basis with a computational complexity that is independent of the number of training patterns, depending only on the number of basis vectors extracted.
Original languageEnglish
Pages1-6
Number of pages6
Publication statusPublished - Apr 2002
EventEuropean Symposium on Artificial Neural Networks (ESANN 2002) - Bruges, Belgium
Duration: 24 Apr 200226 Apr 2002

Conference

ConferenceEuropean Symposium on Artificial Neural Networks (ESANN 2002)
CountryBelgium
CityBruges
Period24/04/0226/04/02

Cite this