The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
A rapid learning and dynamic stepwise updating algorithm for flat neural networks and the application to time-series prediction
Abstract
A fast learning algorithm is proposed to find an optimal weights of the flat neural networks (especially, the functional-link network). Although the flat networks are used for nonlinear function approximation, they can be formulated as linear systems. Thus, the weights of the networks can be solved easily using a linear least-square method. This formulation makes it easier to update the weights instantly for both a new added pattern and a new added enhancement node. A dynamic stepwise updating algorithm is proposed to update the weights of the system on-the-fly. The model is tested on several time-series data including an infrared laser data set, a chaotic time-series, a monthly flour price data set, and a nonlinear system identification problem. The simulation results are compared to existing models in which more complex architectures and more costly training are needed. The results indicate that the proposed model is very attractive to real-time processes.
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
Backpropagation through time: what it does and how to do it
Werbos, P. J. (1990) · Proceedings of the IEEE · doi:10.1109/5.58337 · Cited by 4,879
Cited by
Chen, C. L. P., & Liu, Z. (2018) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2017.2716952 · Cited by 1,957
Self-citationUniversal Approximation Capability of Broad Learning System and Its Structural Variations
Chen, C. L. P., Liu, Z., & Feng, S. (2019) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2018.2866622 · Cited by 549
Self-citationFuzzy Broad Learning System: A Novel Neuro-Fuzzy Model for Regression and Classification
Feng, S., & Chen, C. L. P. (2020) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2018.2857815 · Cited by 490
Self-citationHuang, G.-B. (2015) · Cognitive Computation · doi:10.1007/s12559-015-9333-0 · Cited by 471
A review on neural networks with random weights
Cao, W., Wang, X., Ming, Z., & Gao, J. (2018) · Neurocomputing · doi:10.1016/j.neucom.2017.08.040 · Cited by 466
Metadata
- Authors
- Chen, C. L. P., & Wan, J. Z.
- Venue
- IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics)
- Published
- 1999
- Volume
- 29
- Issue
- 1
- Pages
- 62-72
- ISSN
- 1083-4419 (ISSN-L)
- OpenAlex
- W2123223828
- Cited by
- 230
- References
- 1
- FWCI
- 2.03
- 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: A rapid learning and dynamic stepwise updating algorithm for flat neural networks and the application to time-series prediction. https://app.cochat.ai/papers/10.1109/3477.740166
- The paper
- Chen, C. L. P., & Wan, J. Z. (1999). A rapid learning and dynamic stepwise updating algorithm for flat neural networks and the application to time-series prediction. IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics). https://doi.org/10.1109/3477.740166
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.