By Topic

Sliding window online Kernel-based classification by projection mappings

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Slavakis, K. ; Dept. Telecommun. Sci. & Technol., Univ. of Peloponnese, Tripoli ; Theodoridis, S.

Very recently, an adaptive projection algorithm was introduced for the online classification task with sparsification in reproducing kernel Hilbert spaces (RKHS). This paper presents another sparsification method for the projection-based approach by generating a sequence of linear subspaces in RKHS. Projection mappings give a geometrical flavor to the design; classification is performed by metric projection mappings, sparsification is achieved by orthogonal projections, while the online system's memory and tracking requirements are attained by oblique projections. The resulting sparsification scheme shows strong similarities with the classical sliding window adaptive schemes. Validation is performed by considering the adaptive equalization problem of a nonlinear communication channel. Although here the classification scheme is considered, the method is readily extended to regression tasks. Furthermore its generality allows for a number of cost functions including non-differentiable ones.

Published in:

Circuits and Systems, 2008. ISCAS 2008. IEEE International Symposium on

Date of Conference:

18-21 May 2008