The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Performance evaluation of a sequential minimal radial basis function (RBF) neural network learning algorithm
Abstract
This paper presents a detailed performance analysis of the minimal resource allocation network (M-RAN) learning algorithm, M-RAN is a sequential learning radial basis function neural network which combines the growth criterion of the resource allocating network (RAN) of Platt (1991) with a pruning strategy based on the relative contribution of each hidden unit to the overall network output. The resulting network leads toward a minimal topology for the RAN. The performance of this algorithm is compared with the multilayer feedforward networks (MFNs) trained with 1) a variant of the standard backpropagation algorithm, known as RPROP and 2) the dependence identification (DI) algorithm of Moody and Antsaklis on several benchmark problems in the function approximation and pattern classification areas. For all these problems, the M-RAN algorithm is shown to realize networks with far fewer hidden neurons with better or same approximation/classification accuracy. Further, the time taken for learning (training) is also considerably shorter as M-RAN does not require repeated presentation of the training data.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Learning representations by back-propagating errors
Rumelhart, D. E., Hinton, G. E., & Williams, R. J. (1986) · Nature · doi:10.1038/323533a0 · Cited by 31,892
Learning Internal Representations by Error Propagation
Rumelhart, D. E., Hinton, G. E., & Williams, R. J. (1985) · doi:10.21236/ada164453 · Cited by 16,172
An introduction to computing with neural nets
Lippmann, R. (1987) · IEEE ASSP Magazine · doi:10.1109/massp.1987.1165576 · Cited by 7,825
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
A direct adaptive method for faster backpropagation learning: the RPROP algorithm
Riedmiller, M., & Braun, H. (2002) · IEEE International Conference on Neural Networks · doi:10.1109/icnn.1993.298623 · Cited by 3,917
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
A Resource-Allocating Network for Function Interpolation
Platt, J. (1991) · Neural Computation · doi:10.1162/neco.1991.3.2.213 · Cited by 1,354
An empirical study of learning speed in back-propagation networks
Fahlman, S. E. (2018) · doi:10.1184/r1/6603266 · Cited by 829
On the training of radial basis function classifiers
Musavi, M. T., Ahmed, W., Chan, K. H., Faris, K. B., & Hummels, D. M. (1992) · Neural Networks · doi:10.1016/s0893-6080(05)80038-3 · Cited by 569
Yingwei, L., Sundararajan, N., & Saratchandran, P. (1997) · Neural Computation · doi:10.1162/neco.1997.9.2.461 · Cited by 507
Self-citationA Function Estimation Approach to Sequential Learning with Neural Networks
Kadirkamanathan, V., & Niranjan, M. (1993) · Neural Computation · doi:10.1162/neco.1993.5.6.954 · Cited by 458
Regularization in the Selection of Radial Basis Function Centers
Orr, M. J. L. (1995) · Neural Computation · doi:10.1162/neco.1995.7.3.606 · Cited by 357
Recursive hybrid algorithm for non-linear system identification using radial basis function networks
CHEN, S., BILLINGS, S. A., & GRANT, P. M. (1992) · International Journal of Control · doi:10.1080/00207179208934272 · Cited by 343
The dependence identification neural network construction algorithm
Moody, J. O., & Antsaklis, P. J. (1996) · IEEE Transactions on Neural Networks · doi:10.1109/72.478388 · Cited by 57
Cited by
Universal Approximation using Incremental Constructive Feedforward Networks with Random Hidden Nodes
Huang, G.-B., Chen, L., & Siew, C.-K. (2006) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2006.875977 · Cited by 2,614
A Fast and Accurate Online Sequential Learning Algorithm for Feedforward Networks
Liang, N.-Y., Huang, G.-B., Saratchandran, P., & Sundararajan, N. (2006) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2006.880583 · Cited by 1,965
Self-citationExtreme learning machines: a survey
Huang, G.-B., Wang, D. H., & Lan, Y. (2011) · International Journal of Machine Learning and Cybernetics · doi:10.1007/s13042-011-0019-y · Cited by 1,914
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
Self-citationYingwei, L., Sundararajan, N., & Saratchandran, P. (1997) · Neural Computation · doi:10.1162/neco.1997.9.2.461 · Cited by 507
Self-citation
Metadata
- Authors
- Yingwei, L., Sundararajan, N., & Saratchandran, P.
- Venue
- IEEE Transactions on Neural Networks
- Published
- 1998-03
- Volume
- 9
- Issue
- 2
- Pages
- 308-318
- ISSN
- 1045-9227 (ISSN-L)
- OpenAlex
- W2099244771
- Cited by
- 449
- References
- 14
- FWCI
- 14.44
- 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.