The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
A study on effectiveness of extreme learning machine
Open accessAbstract
Abstract Extreme learning machine (ELM), proposed by Huang et al., has been shown a promising learning algorithm for single-hidden layer feedforward neural networks (SLFNs). Nevertheless, because of the random choice of input weights and biases, the ELM algorithm sometimes makes the hidden layer output matrix H of SLFN not full column rank, which lowers the effectiveness of ELM. This paper discusses the effectiveness of ELM and proposes an improved algorithm called EELM that makes a proper selection of the input weights and bias before calculating the output weights, which ensures the full column rank of H in theory. This improves to some extend the learning rate (testing accuracy, prediction accuracy, learning time) and the robustness property of the networks. The experimental results based on both the benchmark function approximation and real-world problems including classification and regression applications show the good performances of EELM.
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
Approximation by superpositions of a sigmoidal function
Cybenko, G. (1989) · Mathematics of Control, Signals, and Systems · doi:10.1007/bf02551274 · Cited by 13,883
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
UCI Repository of machine learning databases
Blake, C. L. (1998) · Medical Entomology and Zoology · Cited by 10,582
Approximation capabilities of multilayer feedforward networks
Hornik, K. (1991) · Neural Networks · doi:10.1016/0893-6080(91)90009-t · Cited by 6,091
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 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
UCI Repository of Machine Learning Databases
Merz, C. J. (1996) · Medical Entomology and Zoology · Cited by 2,363
Generalized Inverse of Matrices and Its Applications
Banerjee, K. S. (1973) · Technometrics · doi:10.1080/00401706.1973.10489026 · Cited by 2,310
Leshno, M., Lin, V. Y., Pinkus, A., & Schocken, S. (1993) · Neural Networks · doi:10.1016/s0893-6080(05)80131-5 · Cited by 2,121
Chen, T., & Chen, H. (1995) · IEEE Transactions on Neural Networks · doi:10.1109/72.392253 · Cited by 1,230
Bartlett, P. L. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.661502 · Cited by 1,166
Convex incremental extreme learning machine
Huang, G.-B., & Chen, L. (2007) · Neurocomputing · doi:10.1016/j.neucom.2007.02.009 · Cited by 1,139
Enhanced random search based incremental extreme learning machine
Huang, G.-B., & Chen, L. (2008) · Neurocomputing · doi:10.1016/j.neucom.2007.10.008 · Cited by 891
Optimization 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
Generalized Inverse of Matrices and Its Applications
Mayne, A. J., Rao, C. R., & Mitra, S. K. (1972) · Operational Research Quarterly (1970-1977) · doi:10.2307/3007981 · Cited by 817
Evolutionary extreme learning machine
Zhu, Q.-Y., Qin, A. K., Suganthan, P. N., & Huang, G.-B. (2005) · Pattern Recognition · doi:10.1016/j.patcog.2005.03.028 · Cited by 815
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
Approximation by superpositions of a sigmoidal function
Cybenko, G. (1992) · Mathematics of Control, Signals, and Systems · doi:10.1007/bf02134016 · Cited by 703
Error Minimized Extreme Learning Machine With Growth of Hidden Nodes and Incremental Learning
Feng, G., Huang, G.-B., Lin, Q., & Gay, R. (2009) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2009.2024147 · Cited by 654
Matrices: 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
Experiment with a new boosting algorithm
Freund, Y. (1996) · Medical Entomology and Zoology · Cited by 497
Chen, T., & Chen, H. (1995) · IEEE Transactions on Neural Networks · doi:10.1109/72.392252 · Cited by 394
Zhang, R., Huang, G.-B., Sundararajan, N., & Saratchandran, P. (2007) · IEEE/ACM Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2007.1012 · Cited by 247
The estimate for approximation error of neural networks: A constructive approach
Cao, F., Xie, T., & Xu, Z. (2007) · Neurocomputing · doi:10.1016/j.neucom.2007.07.024 · Cited by 90
Self-citationAn 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
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
(1996)
Cited by
Extreme 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
Trends 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
Semi-Supervised and Unsupervised Extreme Learning Machines
Huang, G., Song, S., Gupta, J. N. D., & Wu, C. (2014) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2014.2307349 · Cited by 797
Extreme 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
A review on extreme learning machine
Wang, J., Lu, S., Wang, S.-H., & Zhang, Y.-D. (2022) · Multimedia Tools and Applications · doi:10.1007/s11042-021-11007-7 · Cited by 572
Metadata
- Authors
- Wang, Y., Cao, F., & Yuan, Y.
- Venue
- Neurocomputing
- Publisher
- Elsevier BV
- Published
- 2011-09
- Volume
- 74
- Issue
- 16
- Pages
- 2483-2490
- ISSN
- 0925-2312 (ISSN-L)
- OpenAlex
- W2028759731
- Cited by
- 269
- References
- 29
- FWCI
- 17.44
- Type
- journal article
- Language
- en
- Open access
- green
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.