The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
An Information Theoretic Approach of Designing Sparse Kernel Adaptive Filters
Abstract
This paper discusses an information theoretic approach of designing sparse kernel adaptive filters. To determine useful data to be learned and remove redundant ones, a subjective information measure called surprise is introduced. Surprise captures the amount of information a datum contains which is transferable to a learning system. Based on this concept, we propose a systematic sparsification scheme, which can drastically reduce the time and space complexity without harming the performance of kernel adaptive filters. Nonlinear regression, short term chaotic time-series prediction, and long term time-series forecasting examples are presented.
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
Gaussian Processes for Machine Learning
Rasmussen, C. E., & Williams, C. K. I. (2005) · doi:10.7551/mitpress/3206.001.0001 · Cited by 11,705
Detecting strange attractors in turbulence
Takens, F. (1981) · Lecture Notes in Mathematics · doi:10.1007/bfb0091924 · Cited by 10,459 · cited 1×
“The number of previous data points used as input is called time embedding and can be determined by Takens theorem [40].”
MethodWIDROW, B., & HOFF, M. E. (1960) · doi:10.21236/ad0241531 · Cited by 4,009
Cited by
Quantized Kernel Least Mean Square Algorithm
Chen, B., Zhao, S., Zhu, P., & Principe, J. C. (2012) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2011.2178446 · Cited by 407
Self-citation
Metadata
- Authors
- Liu, W., Park, I., & Principe, J. C.
- Venue
- IEEE Transactions on Neural Networks
- Published
- 2009-12
- Volume
- 20
- Issue
- 12
- Pages
- 1950-1961
- ISSN
- 1045-9227 (ISSN-L)
- 1941-0093
- OpenAlex
- W2126709692
- Cited by
- 228
- References
- 3
- FWCI
- 8.77
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: An Information Theoretic Approach of Designing Sparse Kernel Adaptive Filters. https://app.cochat.ai/papers/10.1109/tnn.2009.2033676
- The paper
- Liu, W., Park, I., & Principe, J. C. (2009). An Information Theoretic Approach of Designing Sparse Kernel Adaptive Filters. IEEE Transactions on Neural Networks. https://doi.org/10.1109/tnn.2009.2033676
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.