The DOI matches its Crossref record; 48 of the 48 references it cites were found in a registry or an index.
Universal Approximation using Incremental Constructive Feedforward Networks with Random Hidden Nodes
Abstract
According to conventional neural network theories, single-hidden-layer feedforward networks (SLFNs) with additive or radial basis function (RBF) hidden nodes are universal approximators when all the parameters of the networks are allowed adjustable. However, as observed in most neural network implementations, tuning all the parameters of the networks may cause learning complicated and inefficient, and it may be difficult to train networks with nondifferential activation functions such as threshold networks. Unlike conventional neural network theories, this paper proves in an incremental constructive method that in order to let SLFNs work as universal approximators, one may simply randomly choose hidden nodes and then only need to adjust the output weights linking the hidden layer and the output layer. In such SLFNs implementations, the activation functions for additive nodes can be any bounded nonconstant piecewise continuous functions g : R --> R and the activation functions for RBF nodes can be any integrable piecewise continuous functions g : R --> R and integral of R g(x)dx not equal to 0. The proposed incremental method is efficient not only for SFLNs with continuous (including nondifferentiable) activation functions but also for SLFNs with piecewise continuous (such as threshold) activation functions. Compared to other popular methods such a new network is fully automatic and users need not intervene the learning process by manually tuning control parameters.
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
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
Wu, Y. (1999) · Technometrics · doi:10.1080/00401706.1999.10485951 · Cited by 27,221
Multilayer feedforward networks are universal approximators
Hornik, K., Stinchcombe, M., & White, H. (1989) · Neural Networks · doi:10.1016/0893-6080(89)90020-8 · Cited by 21,728
Approximation by superpositions of a sigmoidal function
Cybenko, G. (1989) · Mathematics of Control, Signals, and Systems · doi:10.1007/bf02551274 · Cited by 13,883
A tutorial on support vector regression
Smola, A. J., & Schölkopf, B. (2004) · Statistics and Computing · doi:10.1023/b:stco.0000035301.49549.88 · Cited by 13,387
Extreme learning machine: Theory and applications
Huang, G.-B., Zhu, Q.-Y., & Siew, C.-K. (2006) · Neurocomputing · doi:10.1016/j.neucom.2005.12.126 · Cited by 13,285
Self-citationUCI Repository of machine learning databases
Blake, C. L. (1998) · Medical Entomology and Zoology · Cited by 10,582
Libsvm : A library for support vector machines
Ferrari, V. (2008) · Medical Entomology and Zoology · Cited by 10,123
Multilayer feedforward networks are universal approximators
HornikK., StinchcombeM., & WhiteH. (1989) · Neural Networks · doi:10.5555/70405.70408 · Cited by 9,081
A comparison of methods for multiclass support vector machines
Hsu, C.-W., & Lin, C.-J. (2002) · IEEE Transactions on Neural Networks · doi:10.1109/72.991427 · Cited by 6,838
Approximation capabilities of multilayer feedforward networks
Hornik, K. (1991) · Neural Networks · doi:10.1016/0893-6080(91)90009-t · Cited by 6,091
Adaptive Mixtures of Local Experts
Jacobs, R. A., Jordan, M. I., Nowlan, S. J., & Hinton, G. E. (1991) · Neural Computation · doi:10.1162/neco.1991.3.1.79 · Cited by 5,384
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
Universal Approximation Using Radial-Basis-Function Networks
Park, J., & Sandberg, I. W. (1991) · Neural Computation · doi:10.1162/neco.1991.3.2.246 · Cited by 4,112
Extreme learning machine: a new learning scheme of feedforward neural networks
Huang, G.-B., Zhu, Q.-Y., & Siew, C.-K. (2005) · 2004 IEEE International Joint Conference on Neural Networks (IEEE Cat. No.04CH37541) · doi:10.1109/ijcnn.2004.1380068 · Cited by 4,084
Self-citationUniversal approximation bounds for superpositions of a sigmoidal function
Barron, A. R. (1993) · IEEE Transactions on Information Theory · doi:10.1109/18.256500 · Cited by 2,804
(1998) · Cited by 2,679
Hierarchical Mixtures of Experts and the EM Algorithm
Jordan, M. I., & Jacobs, R. A. (1994) · Neural Computation · doi:10.1162/neco.1994.6.2.181 · Cited by 2,673
UCI Repository of Machine Learning Databases
Merz, C. J. (1996) · Medical Entomology and Zoology · Cited by 2,363
Leshno, M., Lin, V. Y., Pinkus, A., & Schocken, S. (1993) · Neural Networks · doi:10.1016/s0893-6080(05)80131-5 · Cited by 2,121
A Resource-Allocating Network for Function Interpolation
Platt, J. (1991) · Neural Computation · doi:10.1162/neco.1991.3.2.213 · Cited by 1,354
LeCun, Y., Bottou, L., Orr, G., & Müller, K. (1998) · neural information processing systems · Cited by 1,333
Improvements to Platt's SMO Algorithm for SVM Classifier Design
Keerthi, S. S., Shevade, S. K., Bhattacharyya, C., & Murthy, K. R. K. (2001) · Neural Computation · doi:10.1162/089976601300014493 · Cited by 1,318
LeCun, Y., Bottou, L., Orr, G. B., & Müller, K. R. (1998) · Lecture Notes in Computer Science · doi:10.1007/3-540-49430-8_2 · Cited by 919
Networks and the best approximation property
Girosi, F., & Poggio, T. (1990) · Biological Cybernetics · doi:10.1007/bf00195855 · Cited by 888
Learning capability and storage capacity of two-hidden-layer feedforward networks
Huang, G.-B. (2003) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2003.809401 · Cited by 810
Self-citationKolmogorov's theorem and multilayer neural networks
Kůrková, V. (1992) · Neural Networks · doi:10.1016/0893-6080(92)90012-8 · Cited by 747
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-citationA Theory of Networks for Approximation and Learning
Poggio, T., & Girosi, F. (1989) · Cited by 703
Huang, G.-B., & Babri, H. A. (1998) · IEEE Transactions on Neural Networks · doi:10.1109/72.655045 · Cited by 538
Self-citationYingwei, L., Sundararajan, N., & Saratchandran, P. (1997) · Neural Computation · doi:10.1162/neco.1997.9.2.461 · Cited by 507
A 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
An Efficient Sequential Learning Algorithm for Growing and Pruning RBF (GAP-RBF) Networks
Huang, G.-B., Saratchandran, P., & Sundararajan, N. (2004) · IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2004.834428 · Cited by 391
Self-citationOn the capabilities of multilayer perceptrons
Baum, E. B. (1988) · Journal of Complexity · doi:10.1016/0885-064x(88)90020-9 · Cited by 379
Extreme learning machine: RBF network case
Huang, G.-B., & Siew, C.-K. (2005) · ICARCV 2004 8th Control, Automation, Robotics and Vision Conference, 2004. · doi:10.1109/icarcv.2004.1468985 · Cited by 278
Self-citationCan threshold networks be trained directly?
Huang, G.-B., Zhu, Q.-Y., Mao, K. Z., Siew, C.-K., Saratchandran, P., & Sundararajan, N. (2006) · IEEE Transactions on Circuits and Systems II: Express Briefs · doi:10.1109/tcsii.2005.857540 · Cited by 266
Self-citationReal-Time Learning Capability of Neural Networks
Huang, G.-B., Zhu, Q.-Y., & Siew, C.-K. (2006) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2006.875974 · Cited by 253
Self-citationStinchcombe, & White (1989) · International Joint Conference on Neural Networks · doi:10.1109/ijcnn.1989.118640 · Cited by 251
Objective functions for training new hidden units in constructive neural networks
Kwok, T.-Y., & Yeung, D.-Y. (1997) · IEEE Transactions on Neural Networks · doi:10.1109/72.623214 · Cited by 238
There exists a neural network that does not make avoidable mistakes
Gallant, & White (1988) · IEEE International Conference on Neural Networks · doi:10.1109/icnn.1988.23903 · Cited by 205
Approximation capability in C(R~/sup n/) by multilayer feedforward networks and related problems
Chen, T., Chen, H., & Liu, R.-W. (1995) · IEEE Transactions on Neural Networks · doi:10.1109/72.363453 · Cited by 176
Arbitrary nonlinearity is sufficient to represent all functions by neural networks: A theorem
Крейнович, В. (1991) · Neural Networks · doi:10.1016/0893-6080(91)90074-f · Cited by 145
Ito, Y. (1992) · Neural Networks · doi:10.1016/s0893-6080(05)80009-7 · Cited by 122
Approximation of functions on a compact set by finite sums of a sigmoid function without scaling
Ito, Y. (1991) · Neural Networks · doi:10.1016/0893-6080(91)90060-i · Cited by 117
Neural networks, approximation theory, and finite precision computation
Wray, J., & Green, G. G. R. (1995) · Neural Networks · doi:10.1016/0893-6080(94)00056-r · Cited by 76
Constructive neural networks with piecewise interpolation capabilities for function approximations
Choi, C., & Choi, J. (1994) · IEEE Transactions on Neural Networks · doi:10.1109/72.329691 · Cited by 37
A new incremental method for function approximation using feed-forward neural networks
Romero, E. E., & Alquézar, R. (2003) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.2002.1007821 · Cited by 24
Cited by
Extreme learning machine: Theory and applications
Huang, G.-B., Zhu, Q.-Y., & Siew, C.-K. (2006) · Neurocomputing · doi:10.1016/j.neucom.2005.12.126 · Cited by 13,285
Self-citationThe graph neural network model
Scarselli, F., Gori, M., Tsoi, A. C., Hagenbuchner, M., & Monfardini, G. (2009) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2008.2005605 · Cited by 9,582
Extreme Learning Machine for Regression and Multiclass Classification
Huang, G.-B., Zhou, H., Ding, X., & Zhang, R. (2012) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2011.2168604 · Cited by 5,550
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-citation
Metadata
- Authors
- Huang, G.-B., Chen, L., & Siew, C.-K.
- Venue
- IEEE Transactions on Neural Networks
- Published
- 2006-07
- Volume
- 17
- Issue
- 4
- Pages
- 879-892
- ISSN
- 1045-9227 (ISSN-L)
- 1941-0093
- OpenAlex
- W2141695047
- Cited by
- 2,614
- References
- 48
- FWCI
- 39.80
- 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.