Sliding Window Generalized Kernel Affine Projection Algorithm Using Projection Mappings. (25th May 2008)

• Record Type: Journal Article
• Authors: Slavakis Slavakis, Konstantinos Konstantinos; Theodoridis Theodoridis, Sergios Sergios
• Other Names: Evgeniou Evgeniou Theodoros Theodoros Academic Editor.
• Is Part Of: EURASIP journal on advances in signal processing. Volume 2008(2008)
• Publication Date: 2008-05-25
• Subjects: Signal processing -- Periodicals; Traitement du signal; Signal processing; Periodicals; 621.3822
• DOI: 10.1155/2008/735351
• Languages: English
• ISSNs: 1687-6172

Abstract

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.