Skip to main content

Advertisement

Sliding Window Generalized Kernel Affine Projection Algorithm Using Projection Mappings

Article metrics

  • 1183 Accesses

  • 32 Citations

Abstract

Very recently, a solution to the kernel-based online classification problem has been given by the adaptive projected subgradient method (APSM). The developed algorithm can be considered as a generalization of a kernel affine projection algorithm (APA) and the kernel normalized least mean squares (NLMS). Furthermore, sparsification of the resulting kernel series expansion was achieved by imposing a closed ball (convex set) constraint on the norm of the classifiers. This paper presents another sparsification method for the APSM approach to the online classification task by generating a sequence of linear subspaces in a reproducing kernel Hilbert space (RKHS). To cope with the inherent memory limitations of online systems and to embed tracking capabilities to the design, an upper bound on the dimension of the linear subspaces is imposed. The underlying principle of the design is the notion of projection mappings. Classification is performed by metric projection mappings, sparsification is achieved by orthogonal projections, while the online system's memory requirements and tracking are attained by oblique projections. The resulting sparsification scheme shows strong similarities with the classical sliding window adaptive schemes. The proposed design is validated by the adaptive equalization problem of a nonlinear communication channel, and is compared with classical and recent stochastic gradient descent techniques, as well as with the APSM's solution where sparsification is performed by a closed ball constraint on the norm of the classifiers.

Publisher note

To access the full article, please see PDF.

Author information

Correspondence to Konstantinos Slavakis.

Rights and permissions

Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License (https://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Reprints and Permissions

About this article

Cite this article

Slavakis, K., Theodoridis, S. Sliding Window Generalized Kernel Affine Projection Algorithm Using Projection Mappings. EURASIP J. Adv. Signal Process. 2008, 735351 (2008) doi:10.1155/2008/735351

Download citation

Keywords

  • Linear Subspace
  • Projection Mapping
  • Closed Ball
  • Reproduce Kernel Hilbert Space
  • Equalization Problem