The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Error Minimized Extreme Learning Machine With Growth of Hidden Nodes and Incremental Learning
Abstract
One of the open problems in neural network research is how to automatically determine network architectures for given applications. In this brief, we propose a simple and efficient approach to automatically determine the number of hidden nodes in generalized single-hidden-layer feedforward networks (SLFNs) which need not be neural alike. This approach referred to as error minimized extreme learning machine (EM-ELM) can add random hidden nodes to SLFNs one by one or group by group (with varying group size). During the growth of the networks, the output weights are updated incrementally. The convergence of this approach is proved in this brief as well. Simulation results demonstrate and verify that our new approach is much faster than other sequential/incremental/growing algorithms with good generalization performance.
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
Linear Matrix Inequalities in System and Control Theory
Boyd, S., El Ghaoui, L., Feron, E., & Balakrishnan, V. (1994) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970777 · Cited by 21,687
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
Orthonormal bases of compactly supported wavelets
Daubechies, I. (1988) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.3160410705 · Cited by 8,190
The wavelet transform, time-frequency localization and signal analysis
Daubechies, I. (1990) · IEEE Transactions on Information Theory · doi:10.1109/18.57199 · Cited by 6,483 · cited 2×
“Such computational hidden nodes include additive/radial basis function (RBF) hidden nodes, multiplicative nodes, fuzzy rules [11], fully complex nodes [12], [13], hinging functions [14], high-order nodes [15], ridge polynomials [16], wavelets [17], [18], Fourier series [19], etc.”
BackgroundExtreme 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-citationHarnessing Nonlinearity: Predicting Chaotic Systems and Saving Energy in Wireless Communication
Jaeger, H., & Haas, H. (2004) · Science · doi:10.1126/science.1091277 · Cited by 3,811
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-citationGeneralized Inverse of Matrices and Its Applications
Banerjee, K. S. (1973) · Technometrics · doi:10.1080/00401706.1973.10489026 · Cited by 2,310
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-citationA Resource-Allocating Network for Function Interpolation
Platt, J. (1991) · Neural Computation · doi:10.1162/neco.1991.3.2.213 · Cited by 1,354
Convex incremental extreme learning machine
Huang, G.-B., & Chen, L. (2007) · Neurocomputing · doi:10.1016/j.neucom.2007.02.009 · Cited by 1,139
Self-citationLearning 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-citationLearning, invariance, and generalization in high-order neural networks
Giles, C. L., & Maxwell, T. (1987) · Applied Optics · doi:10.1364/ao.26.004972 · Cited by 676
Yingwei, L., Sundararajan, N., & Saratchandran, P. (1997) · Neural Computation · doi:10.1162/neco.1997.9.2.461 · Cited by 507
Hinging hyperplanes for regression, classification, and function approximation
Breiman, L. (1993) · IEEE Transactions on Information Theory · doi:10.1109/18.256506 · Cited by 445
On-Line Sequential Extreme Learning Machine
Huang, G.-B., Liang, N., Rong, H.-J., Saratchandran, P., & Sundararajan, N. (2005) · Computational intelligence · Cited by 257
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-citationApproximation by Fully Complex Multilayer Perceptrons
Kim, T., & Adalı, T. (2003) · Neural Computation · doi:10.1162/089976603321891846 · Cited by 243
Deniz Erdogmus, B., Fontenla-Romero, Ó., Príncipe, J. C., Alonso‐Betanzos, A., & Castillo, E. (2005) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2004.841777 · Cited by 60
Approximation of multivariate functions using ridge polynomial networks
Shin, Y., & Ghosh, J. (2003) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.1992.226958 · Cited by 46
Cited by
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-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-citationTrends in extreme learning machines: A review
Huang, G., Huang, G.-B., Song, S., & You, K. (2015) · Neural Networks · doi:10.1016/j.neunet.2014.10.001 · Cited by 1,732
Self-citationOptimization method based extreme learning machine for classification
Huang, G.-B., Ding, X., & Zhou, H. (2010) · Neurocomputing · doi:10.1016/j.neucom.2010.02.019 · Cited by 869
Self-citationExtreme learning machine: algorithm, theory and applications
Ding, S., Zhao, H., Zhang, Y., Xu, X., & Nie, R. (2015) · Artificial Intelligence Review · doi:10.1007/s10462-013-9405-z · Cited by 593
Metadata
- Authors
- Feng, G., Huang, G.-B., Lin, Q., & Gay, R.
- Venue
- IEEE Transactions on Neural Networks
- Published
- 2009-08
- Volume
- 20
- Issue
- 8
- Pages
- 1352-1357
- ISSN
- 1045-9227 (ISSN-L)
- 1941-0093
- OpenAlex
- W2096987757
- Cited by
- 654
- References
- 21
- FWCI
- 32.17
- 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.