The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Orthogonal least squares learning algorithm for radial basis function networks
Abstract
The radial basis function network offers a viable alternative to the two-layer neural network in many applications of signal processing. A common learning algorithm for radial basis function networks is based on first choosing randomly some data points as radial basis function centers and then using singular-value decomposition to solve for the weights of the network. Such a procedure has several drawbacks, and, in particular, an arbitrary selection of centers is clearly unsatisfactory. The authors propose an alternative learning procedure based on the orthogonal least-squares method. The procedure chooses radial basis function centers one by one in a rational way until an adequate network has been constructed. In the algorithm, each selected center maximizes the increment to the explained variance or energy of the desired output and does not suffer numerical ill-conditioning problems. The orthogonal least-squares learning strategy provides a simple and efficient means for fitting radial basis function networks. This is illustrated using examples taken from two different signal processing applications.
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
Genetic algorithms in search, optimization, and machine learning
(1989) · Choice Reviews Online · doi:10.5860/choice.27-0936 · Cited by 49,010
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
Approximation by superpositions of a sigmoidal function
Cybenko, G. (1989) · Mathematics of Control, Signals, and Systems · doi:10.1007/bf02551274 · Cited by 13,883
On the approximate realization of continuous mappings by neural networks
Funahashi, K.-I. (1989) · Neural Networks · doi:10.1016/0893-6080(89)90003-8 · Cited by 4,206
Fast Learning in Networks of Locally-Tuned Processing Units
Moody, J., & Darken, C. J. (1989) · Neural Computation · doi:10.1162/neco.1989.1.2.281 · Cited by 4,194
Radial Basis Functions, Multi-Variable Functional Interpolation and Adaptive Networks
Broomhead, D. S., & Lowe, D. (1988) · OpenGrey (Institut de l'Information Scientifique et Technique) · Cited by 3,443
Singular value decomposition and least squares solutions
Golub, G. H., & Reinsch, C. (1970) · Numerische Mathematik · doi:10.1007/bf02163027 · Cited by 2,929
Learning Automata: An Introduction
Narendra, K. S., & Thathachar, M. A. L. (1989) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,540
Orthogonal least squares methods and their application to non-linear system identification
Chen, S., Billings, S. A., & Luo, W. (1989) · International Journal of Control · doi:10.1080/00207178908953472 · Cited by 1,540
Self-citationQureshi, S. (1982) · IEEE Communications Magazine · doi:10.1109/mcom.1982.1090994 · Cited by 1,457
Interpolation of Scattered Data: Distance Matrices and Conditionally Positive Definite Functions
Micchelli, C. A. (1984) · Approximation Theory and Spline Functions · doi:10.1007/978-94-009-6466-2_7 · Cited by 1,297
Interpolation of scattered data: Distance matrices and conditionally positive definite functions
Micchelli, C. A. (1986) · Constructive Approximation · doi:10.1007/bf01893414 · Cited by 1,247
Radial basis functions for multivariable interpolation: a review
Powell, M. J. D. (1987) · Clarendon Press eBooks · Cited by 1,197
Numerical methods for solving linear least squares problems
Golub, G. (1965) · Numerische Mathematik · doi:10.1007/bf01436075 · Cited by 849
Solving linear least squares problems by Gram-Schmidt orthogonalization
Björck, Å. (1967) · BIT · doi:10.1007/bf01934122 · Cited by 470
An Introduction to Bispectral Analysis and Bilinear Time Series Models.
Janacek, G., Rao, T. S., & Gabr, M. M. (1987) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2981645 · Cited by 462
An Introduction to Bispectral Analysis and Bilinear Time Series Models
Rao, T. S., & Gabr, M. M. (1984) · Lecture notes in statistics · doi:10.1007/978-1-4684-6318-7 · Cited by 373
Practical identification of NARMAX models using radial basis functions
CHEN, S., BILLINGS, S. A., COWAN, C. F. N., & GRANT, P. M. (1990) · International Journal of Control · doi:10.1080/00207179008953599 · Cited by 306
Self-citationCheney, E. W. (1986) · Proceedings of Symposia in Applied Mathematics · doi:10.1090/psapm/036/864366 · Cited by 209
On model structure testing in system identification
Söderström, T. (1977) · International Journal of Control · doi:10.1080/00207177708922285 · Cited by 164
Non-linear systems identification using radial basis functions
Chen, S., Billings, S. A., Cowan, C. F. N., & Grant, P. M. (1990) · International Journal of Systems Science · doi:10.1080/00207729008910567 · Cited by 148
Self-citationReconstruction of binary signals using an adaptive radial-basis-function equalizer
Chen, S., Gibson, G. J., Cowan, C. F. N., & Grant, P. M. (1991) · Signal Processing · doi:10.1016/0165-1684(91)90030-m · Cited by 144
Self-citationMaximum-power validation of models without higher-order fitting
Bohlin, T. (1978) · Automatica · doi:10.1016/0005-1098(78)90018-3 · Cited by 52
Cited by
ANFIS: adaptive-network-based fuzzy inference system
Jang, J.-S. R. (1993) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/21.256541 · Cited by 16,254
Fuzzy basis functions, universal approximation, and orthogonal least-squares learning
Wang, L.-X., & Mendel, J. M. (1992) · IEEE Transactions on Neural Networks · doi:10.1109/72.159070 · Cited by 2,796
Wan, T. H., Saccoccio, M., Chen, C., & Ciucci, F. (2015) · Electrochimica Acta · doi:10.1016/j.electacta.2015.09.097 · Cited by 2,505
Fuzzy logic systems for engineering: a tutorial
Mendel, J. M. (1995) · Proceedings of the IEEE · doi:10.1109/5.364485 · Cited by 2,110
Nonlinear black-box modeling in system identification: a unified overview
Sjöberg, J., Zhang, Q., Ljung, L., Benveniste, A., Delyon, B., Glorennec, P.-Y., Hjalmarsson, H., & Juditsky, A. (1995) · Automatica · doi:10.1016/0005-1098(95)00120-8 · Cited by 1,942
Metadata
- Authors
- Chen, S., Cowan, C. F. N., & Grant, P. M.
- Venue
- IEEE Transactions on Neural Networks
- Published
- 1991-03
- Volume
- 2
- Issue
- 2
- Pages
- 302-309
- ISSN
- 1045-9227 (ISSN-L)
- OpenAlex
- W2155399784
- Cited by
- 3,362
- References
- 23
- FWCI
- 23.85
- 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.