The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
A Generalized Growing and Pruning RBF (GGAP-RBF) Neural Network for Function Approximation
Abstract
This paper presents a new sequential learning algorithm for radial basis function (RBF) networks referred to as generalized growing and pruning algorithm for RBF (GGAP-RBF). The paper first introduces the concept of significance for the hidden neurons and then uses it in the learning algorithm to realize parsimonious networks. The growing and pruning strategy of GGAP-RBF is based on linking the required learning accuracy with the significance of the nearest or intentionally added new neuron. Significance of a neuron is a measure of the average information content of that neuron. The GGAP-RBF algorithm can be used for any arbitrary sampling density for training samples and is derived from a rigorous statistical point of view. Simulation results for bench mark problems in the function approximation area show that the GGAP-RBF outperforms several other sequential learning algorithms in terms of learning speed, network size and generalization performance regardless of the sampling density function 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
LIBSVM: A library for support vector machines
Chang, C.-C., & Lin, C.-J. (2011) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/1961189.1961199 · Cited by 40,918
Support Vector Regression Machines
Drucker, H., Burges, C. J. C., Kaufman, L., Smola, A. J., & Vapnik, V. N. (1996) · Cited by 4,658
Orthogonal least squares learning algorithm for radial basis function networks
Chen, S., Cowan, C. F. N., & Grant, P. M. (1991) · IEEE Transactions on Neural Networks · doi:10.1109/72.80341 · Cited by 3,362
(1998) · Cited by 2,679
A Resource-Allocating Network for Function Interpolation
Platt, J. (1991) · Neural Computation · doi:10.1162/neco.1991.3.2.213 · Cited by 1,354
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
Yingwei, L., Sundararajan, N., & Saratchandran, P. (1998) · IEEE Transactions on Neural Networks · doi:10.1109/72.661125 · Cited by 449
Self-citationRegularization 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
A Gaussian potential function network with hierarchically self-organizing learning
Lee, S., & Kil, R. M. (1991) · Neural Networks · doi:10.1016/0893-6080(91)90005-p · Cited by 325
Karayiannis, N. B., & Mi, G. W. (1997) · IEEE Transactions on Neural Networks · doi:10.1109/72.641471 · Cited by 307
Regularized orthogonal least squares algorithm for constructing radial basis function networks
Chen, S., Chng, E. S., & Alkadhimi, K. (1996) · International Journal of Control · doi:10.1080/00207179608921659 · Cited by 231
Gradient radial basis function networks for nonlinear and nonstationary time series prediction
Chng, E. S., Chen, S., & Mulgrew, B. (1996) · IEEE Transactions on Neural Networks · doi:10.1109/72.478403 · Cited by 159
Sequential support vector classifiers and regression
Vijayakumar, S., & Wu, S. (1999) · Cited by 68
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
Self-citationA 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
Self-citationSelection of Proper Neural Network Sizes and Architectures—A Comparative Study
Hunter, D., Yu, H., Pukish, III, Kolbusz, J., & Wilamowski, B. M. (2012) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2012.2187914 · Cited by 415
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
Metadata
- Authors
- Huang, G.-B., Saratchandran, P., & Sundararajan, N.
- Venue
- IEEE Transactions on Neural Networks
- Published
- 2005-01
- Volume
- 16
- Issue
- 1
- Pages
- 57-67
- ISSN
- 1045-9227 (ISSN-L)
- OpenAlex
- W2116119284
- Cited by
- 705
- References
- 15
- FWCI
- 43.63
- 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.