The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Prediction of noisy chaotic time series using an optimal radial basis function neural network
Abstract
This paper considers the problem of optimum prediction of noisy chaotic time series using a basis function neural network, in particular, the radial basis function (RBF) network. In the noiseless environment, predicting a chaotic time series is equivalent to approximating a nonlinear function. The optimal generalization is achieved when the number of hidden units of a RBF predictor approaches infinity. When noise exists, it is shown that an optimal RBF predictor should use a finite number of hidden units. To determine the structure of an optimal RBF predictor, we propose a new technique called the cross-validated subspace method to estimate the optimum number of hidden units. While the subspace technique is used to identify a suitable number of hidden units by detecting the dimension of the subspace spanned by the signal eigenvectors, the cross validation method is applied to prevent the problem of overfitting. The effectiveness of this new method is evaluated using simulated noisy chaotic time series as well as real-life oceanic radar signals. Results show that the proposed method can find the correct number of hidden units of an RBF network for an optimal prediction.
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
Detecting strange attractors in turbulence
Takens, F. (1981) · Lecture Notes in Mathematics · doi:10.1007/bfb0091924 · Cited by 10,459 · cited 1×
“Proof: According to the Takens embedding theorem [ 26 ], there exists a diffeomorphism such that”
Background
Cited by
LSTM-based traffic flow prediction with missing data
Tian, Y., Zhang, K., Li, J., Lin, X., & Yang, B. (2018) · Neurocomputing · doi:10.1016/j.neucom.2018.08.067 · Cited by 544
A Review of Deep Learning Models for Time Series Prediction
Han, Z., Zhao, J., Leung, H., Ma, K. F., & Wang, W. (2021) · IEEE Sensors Journal · doi:10.1109/jsen.2019.2923982 · Cited by 501
Self-citationMachine learning for estimation of building energy consumption and performance: a review
Seyedzadeh, S., Rahimian, F. P., Glesk, I., & Roper, M. (2018) · Visualization in Engineering · doi:10.1186/s40327-018-0064-7 · Cited by 482
Traffic flow prediction using LSTM with feature enhancement
Yang, B., Sun, S., Li, J., Lin, X., & Tian, Y. (2019) · Neurocomputing · doi:10.1016/j.neucom.2018.12.016 · Cited by 434
Chaotic Time Series Prediction Based on a Novel Robust Echo State Network
Li, D., Han, M., & Wang, J. (2012) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2012.2188414 · Cited by 341
Metadata
- Authors
- Leung, H., Lo, T., & Wang, S.
- Venue
- IEEE Transactions on Neural Networks
- Published
- 2001
- Volume
- 12
- Issue
- 5
- Pages
- 1163-1172
- ISSN
- 1045-9227 (ISSN-L)
- OpenAlex
- W2161913203
- Cited by
- 191
- References
- 1
- FWCI
- 4.13
- 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: Prediction of noisy chaotic time series using an optimal radial basis function neural network. https://app.cochat.ai/papers/10.1109/72.950144
- The paper
- Leung, H., Lo, T., & Wang, S. (2001). Prediction of noisy chaotic time series using an optimal radial basis function neural network. IEEE Transactions on Neural Networks. https://doi.org/10.1109/72.950144
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.