Baudat and Anouar  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.
|Number of pages||6|
|Publication status||Published - Apr 2002|
|Event||European Symposium on Artificial Neural Networks (ESANN 2002) - Bruges, Belgium|
Duration: 24 Apr 2002 → 26 Apr 2002
|Conference||European Symposium on Artificial Neural Networks (ESANN 2002)|
|Period||24/04/02 → 26/04/02|