The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Universal Approximation of Extreme Learning Machine With Adaptive Growth of Hidden Nodes
Abstract
Extreme learning machines (ELMs) have been proposed for generalized single-hidden-layer feedforward networks which need not be neuron-like and perform well in both regression and classification applications. In this brief, we propose an ELM with adaptive growth of hidden nodes (AG-ELM), which provides a new approach for the automated design of networks. Different from other incremental ELMs (I-ELMs) whose existing hidden nodes are frozen when the new hidden nodes are added one by one, in AG-ELM the number of hidden nodes is determined in an adaptive way in the sense that the existing networks may be replaced by newly generated networks which have fewer hidden nodes and better generalization performance. We then prove that such an AG-ELM using Lebesgue p-integrable hidden activation functions can approximate any Lebesgue p-integrable function on a compact input set. Simulation results demonstrate and verify that this new approach can achieve a more compact network architecture than the I-ELM.
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
Neural Networks for Pattern Recognition
Bishop, C. M. (1995) · doi:10.1093/oso/9780198538493.001.0001 · Cited by 12,287
On the capabilities of multilayer perceptrons
Baum, E. B. (1988) · Journal of Complexity · doi:10.1016/0885-064x(88)90020-9 · Cited by 379
Cited by
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
Self-citationSemi-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
Self-citationNeural networks: An overview of early research, current frameworks and new challenges
Prieto, A., Prieto, B., Ortigosa, E. M., Ros, E., Pelayo, F., Ortega, J., & Rojas, I. (2016) · Neurocomputing · doi:10.1016/j.neucom.2016.06.014 · Cited by 391
Multi-kernel extreme learning machine for EEG classification in brain-computer interfaces
Zhang, Y., Wang, Y., Zhou, G., Jin, J., Wang, B., Wang, X., & Cichocki, A. (2018) · Expert Systems with Applications · doi:10.1016/j.eswa.2017.12.015 · Cited by 255
IncDet: In Defense of Elastic Weight Consolidation for Incremental Object Detection
Liu, L., Kuang, Z., Chen, Y., Xue, J.-H., Yang, W., & Zhang, W. (2021) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2020.3002583 · Cited by 90
Metadata
- Authors
- Zhang, R., Lan, Y., Huang, G.-B., & Xu, Z.-B.
- Venue
- IEEE Transactions on Neural Networks and Learning Systems
- Published
- 2012-02
- Volume
- 23
- Issue
- 2
- Pages
- 365-371
- ISSN
- 2162-237X (ISSN-L)
- 2162-2388
- OpenAlex
- W2021150359
- Cited by
- 216
- References
- 2
- FWCI
- 19.00
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Universal Approximation of Extreme Learning Machine With Adaptive Growth of Hidden Nodes. https://app.cochat.ai/papers/10.1109/tnnls.2011.2178124
- The paper
- Zhang, R., Lan, Y., Huang, G.-B., & Xu, Z.-B. (2012). Universal Approximation of Extreme Learning Machine With Adaptive Growth of Hidden Nodes. IEEE Transactions on Neural Networks and Learning Systems. https://doi.org/10.1109/tnnls.2011.2178124
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.