- Research Article
- Open access
- Published:
Kernel Affine Projection Algorithms
EURASIP Journal on Advances in Signal Processing volume 2008, Article number: 784292 (2008)
Abstract
The combination of the famed kernel trick and affine projection algorithms (APAs) yields powerful nonlinear extensions, named collectively here, KAPA. This paper is a follow-up study of the recently introduced kernel least-mean-square algorithm (KLMS). KAPA inherits the simplicity and online nature of KLMS while reducing its gradient noise, boosting performance. More interestingly, it provides a unifying model for several neural network techniques, including kernel least-mean-square algorithms, kernel adaline, sliding-window kernel recursive-least squares (KRLS), and regularization networks. Therefore, many insights can be gained into the basic relations among them and the tradeoff between computation complexity and performance. Several simulations illustrate its wide applicability.
Publisher note
To access the full article, please see PDF.
Author information
Authors and Affiliations
Corresponding author
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.
About this article
Cite this article
Liu, W., Príncipe, J.C. Kernel Affine Projection Algorithms. EURASIP J. Adv. Signal Process. 2008, 784292 (2008). https://doi.org/10.1155/2008/784292
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1155/2008/784292