The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Extreme learning machine: a new learning scheme of feedforward neural networks
Abstract
It is clear that the learning speed of feedforward neural networks is in general far slower than required and it has been a major bottleneck in their applications for past decades. Two key reasons behind may be: 1) the slow gradient-based learning algorithms are extensively used to train neural networks, and 2) all the parameters of the networks are tuned iteratively by using such learning algorithms. Unlike these traditional implementations, this paper proposes a new learning algorithm called extreme learning machine (ELM) for single-hidden layer feedforward neural networks (SLFNs) which randomly chooses the input weights and analytically determines the output weights of SLFNs. In theory, this algorithm tends to provide the best generalization performance at extremely fast learning speed. The experimental results based on real-world benchmarking function approximation and classification problems including large complex applications show that the new algorithm can produce best generalization performance in some cases and can learn much faster than traditional popular learning algorithms for feedforward neural networks.
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
Neural Networks: A Comprehensive Foundation
Haykin, S. (1998) · Cited by 30,070
Libsvm : A library for support vector machines
Ferrari, V. (2008) · Medical Entomology and Zoology · Cited by 10,122
Approximation capabilities of multilayer feedforward networks
Hornik, K. (1991) · Neural Networks · doi:10.1016/0893-6080(91)90009-t · Cited by 6,091
Leshno, M., Lin, V. Y., Pinkus, A., & Schocken, S. (1993) · Neural Networks · doi:10.1016/s0893-6080(05)80131-5 · Cited by 2,121
Bartlett, P. L. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.661502 · Cited by 1,166
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-citationMatrices: theory and applications
(2003) · Choice Reviews Online · doi:10.5860/choice.40-4658 · Cited by 648
Huang, G.-B., & Babri, H. A. (1998) · IEEE Transactions on Neural Networks · doi:10.1109/72.655045 · Cited by 538
Self-citationCapabilities of a four-layered feedforward neural network: four layers versus three
Tamura, S., & Tateishi, M. (1997) · IEEE Transactions on Neural Networks · doi:10.1109/72.557662 · Cited by 422
A Parallel Mixture of SVMs for Very Large Scale Problems
Collobert, R., Bengio, S., & Bengio, Y. (2002) · Neural Computation · doi:10.1162/089976602753633402 · Cited by 359
Classification ability of single hidden layer feedforward neural networks
Huang, G.-B., Chen, Y.-Q., & Babri, H. A. (2000) · IEEE Transactions on Neural Networks · doi:10.1109/72.846750 · Cited by 261
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-citationFor Valid Generalization the Size of the Weights is More Important than the Size of the Network
Bartlett, P. L. (1996) · Cited by 213
Ito, Y. (1992) · Neural Networks · doi:10.1016/s0893-6080(05)80009-7 · Cited by 122
An Improvement of AdaBoost to Avoid Overfitting
Raeetsch, G., Onoda, T., & Müller, K. R. (1998) · International Conference on Neural Information Processing · Cited by 52
Heterogeneous radial basis function networks
Wilson, D. R., & Martinez, T. R. (2002) · doi:10.1109/icnn.1996.549079 · Cited by 34
(1996)
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-citationUniversal 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-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-citation
Metadata
- Authors
- Huang, G.-B., Zhu, Q.-Y., & Siew, C.-K.
- Venue
- 2004 IEEE International Joint Conference on Neural Networks (IEEE Cat. No.04CH37541)
- Publisher
- IEEE
- Published
- 2005-04-05
- Volume
- 2
- Pages
- 985-990
- OpenAlex
- W2134603844
- Cited by
- 4,084
- References
- 18
- FWCI
- 18.13
- Type
- conference paper
- 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.