The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Quantized Kernel Least Mean Square Algorithm
Abstract
In this paper, we propose a quantization approach, as an alternative of sparsification, to curb the growth of the radial basis function structure in kernel adaptive filtering. The basic idea behind this method is to quantize and hence compress the input (or feature) space. Different from sparsification, the new approach uses the "redundant" data to update the coefficient of the closest center. In particular, a quantized kernel least mean square (QKLMS) algorithm is developed, which is based on a simple online vector quantization method. The analytical study of the mean square convergence has been carried out. The energy conservation relation for QKLMS is established, and on this basis we arrive at a sufficient condition for mean square convergence, and a lower and upper bound on the theoretical value of the steady-state excess mean square error. Static function estimation and short-term chaotic time-series prediction examples are presented to demonstrate the excellent performance.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Nature of Statistical Learning Theory
Vapnik, V. N. (1995) · doi:10.1007/978-1-4757-2440-0 · Cited by 39,138
A Tutorial on Support Vector Machines for Pattern Recognition
Burges, C. J. C. (1998) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009715923555 · Cited by 16,429
Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond
Schölkopf, B., & Smola, A. J. (2001) · The MIT Press eBooks · doi:10.7551/mitpress/4175.001.0001 · Cited by 11,703
Nonlinear Component Analysis as a Kernel Eigenvalue Problem
Schölkopf, B., Smola, A., & Müller, K.-R. (1998) · Neural Computation · doi:10.1162/089976698300017467 · Cited by 8,084
An Algorithm for Vector Quantizer Design
Linde, Y., Buzo, A., & Gray, R. (1980) · IEEE Transactions on Communications · doi:10.1109/tcom.1980.1094577 · Cited by 7,201
Aronszajn, N. (1950) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1950-0051437-7 · Cited by 5,380
Learning With Kernels: Support Vector Machines, Regularization, Optimization, and Beyond
Williams, C. K. I. (2003) · Journal of the American Statistical Association · doi:10.1198/jasa.2003.s269 · Cited by 4,281
Least Squares Support Vector Machines
Suykens, J. A. K., Van Gestel, T., De Brabanter, J., De Moor, B., & Vandewalle, J. (2002) · WORLD SCIENTIFIC eBooks · doi:10.1142/5089 · Cited by 3,642
Fundamentals of Adaptive Filtering
Ramirez, P. S. (2002) · The Kluwer International Series in Engineering and Computer Science · doi:10.1007/978-1-4757-3637-3_2 · Cited by 1,958
Fundamentals of adaptive filtering
Sayed, A. H. (2003) · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · Cited by 1,673
A Resource-Allocating Network for Function Interpolation
Platt, J. (1991) · Neural Computation · doi:10.1162/neco.1991.3.2.213 · Cited by 1,354
Regularization Theory and Neural Networks Architectures
Girosi, F., Jones, M., & Poggio, T. (1995) · Neural Computation · doi:10.1162/neco.1995.7.2.219 · Cited by 1,349
Least Squares Support Vector Machines
Suykens, J. A. K., Gestel, T. V., Brabanter, J. D., Moor, B. D., & Vandewalle, J. P. L. (2002) · WORLD SCIENTIFIC eBooks · doi:10.1142/9789812776655 · Cited by 1,166
The Kernel Recursive Least-Squares Algorithm
Engel, Y., Mannor, S., & Meir, R. (2004) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2004.830985 · Cited by 1,104
Kivinen, J., Smola, A. J., & Williamson, R. C. (2004) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2004.830991 · Cited by 1,004
Sparse On-Line Gaussian Processes
Csató, L., & Opper, M. (2002) · Neural Computation · doi:10.1162/089976602317250933 · Cited by 749
A Generalized Growing and Pruning RBF (GGAP-RBF) Neural Network for Function Approximation
Huang, G.-B., Saratchandran, P., & Sundararajan, N. (2005) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2004.836241 · Cited by 705
The Kernel Least-Mean-Square Algorithm
Liu, W., Pokharel, P. P., & Príncipe, J. C. (2008) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2007.907881 · Cited by 648
Entropy-constrained vector quantization
Chou, P. A., Lookabaugh, T. D., & Gray, R. M. (1989) · IEEE Transactions on Acoustics Speech and Signal Processing · doi:10.1109/29.17498 · Cited by 584
An Information Theoretic Approach of Designing Sparse Kernel Adaptive Filters
Liu, W., Park, I., & Principe, J. C. (2009) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2009.2033676 · Cited by 228
Self-citationExtended Kernel Recursive Least Squares Algorithm
Liu, W., Park, I., Wang, Y., & Principe, J. C. (2009) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2009.2022007 · Cited by 210
Self-citationExtension of Wirtinger's Calculus to Reproducing Kernel Hilbert Spaces and the Complex Kernel LMS
Bouboulis, P., & Theodoridis, S. (2010) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2010.2096420 · Cited by 194
The Forgetron: A Kernel-Based Perceptron on a Budget
Dekel, O., Shalev-Shwartz, S., & Singer, Y. (2008) · SIAM Journal on Computing · doi:10.1137/060666998 · Cited by 176
Online Kernel-Based Classification Using Adaptive Projection Algorithms
Slavakis, K., Theodoridis, S., & Yamada, I. (2008) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2008.917376 · Cited by 124
Optimized fixed-size kernel models for large data sets
Brabanter, K. D., Brabanter, J. D., Suykens, J. A. K., & Moor, B. D. (2010) · Computational Statistics & Data Analysis · doi:10.1016/j.csda.2010.01.024 · Cited by 103
Espinoza, M., Suykens, J. A. K., & Moor, B. D. (2006) · Computational Management Science · doi:10.1007/s10287-005-0003-7 · Cited by 101
Vector quantization using information theoretic concepts
Lehn-Schiøler, T., Hegde, A., Deniz Erdogmus, B., & Príncipe, J. C. (2005) · Natural Computing · doi:10.1007/s11047-004-9619-8 · Cited by 71
Subset based least squares subspace regression in RKHS
Hoegaerts, L., Suykens, J. A. K., Vandewalle, J. P. L., & Moor, B. D. (2004) · Neurocomputing · doi:10.1016/j.neucom.2004.04.013 · Cited by 68
Metadata
- Authors
- Chen, B., Zhao, S., Zhu, P., & Principe, J. C.
- Venue
- IEEE Transactions on Neural Networks and Learning Systems
- Published
- 2012-01
- Volume
- 23
- Issue
- 1
- Pages
- 22-32
- ISSN
- 2162-237X (ISSN-L)
- 2162-2388
- OpenAlex
- W2071820974
- Cited by
- 407
- References
- 28
- FWCI
- 21.94
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.