The DOI matches its Crossref record; 35 of the 35 references it cites were found in a registry or an index.
A Fast and Accurate Online Sequential Learning Algorithm for Feedforward Networks
Abstract
In this paper, we develop an online sequential learning algorithm for single hidden layer feedforward networks (SLFNs) with additive or radial basis function (RBF) hidden nodes in a unified framework. The algorithm is referred to as online sequential extreme learning machine (OS-ELM) and can learn data one-by-one or chunk-by-chunk (a block of data) with fixed or varying chunk size. The activation functions for additive nodes in OS-ELM can be any bounded nonconstant piecewise continuous functions and the activation functions for RBF nodes can be any integrable piecewise continuous functions. In OS-ELM, the parameters of hidden nodes (the input weights and biases of additive nodes or the centers and impact factors of RBF nodes) are randomly selected and the output weights are analytically determined based on the sequentially arriving data. The algorithm uses the ideas of ELM of Huang et al. developed for batch learning which has been shown to be extremely fast with generalization performance better than other batch training methods. Apart from selecting the number of hidden nodes, no other control parameters have to be manually chosen. Detailed performance comparison of OS-ELM is done with other popular sequential learning algorithms on benchmark problems drawn from the regression, classification and time series prediction areas. The results show that the OS-ELM is faster than the other sequential algorithms and produces better generalization performance.
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
Learning Internal Representations by Error Propagation
Rumelhart, D. E., Hinton, G. E., & Williams, R. J. (1985) · doi:10.21236/ada164453 · Cited by 16,172
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
Golub, G. H., & Loan, C. F. V. (1996) · Johns Hopkins University Press eBooks · Cited by 6,027
Oscillation and Chaos in Physiological Control Systems
Mackey, M. C., & Glass, L. (1977) · Science · doi:10.1126/science.267326 · Cited by 4,135
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-citationLearning internal representations by error propagation
RUMELHART, D. E., HINTON, G. E., & WILLIAMS, R. J. (1988) · Readings in Cognitive Science · doi:10.1016/b978-1-4832-1446-7.50035-2 · Cited by 3,002
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
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
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
An Introduction to Optimization
Chong, E. K. P., & Zak, S. H. (1996) · IEEE Antennas and Propagation Magazine · doi:10.1109/map.1996.500234 · Cited by 875
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
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-citationA 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-citation(2004) · Choice Reviews Online · doi:10.5860/choice.41-5348 · Cited by 677
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
Self-citationA 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
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
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-citationSmooth Function Approximation Using Neural Networks
Ferrari, S., & Stengel, R. F. (2005) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2004.836233 · Cited by 319
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-citationClassification 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-citationObjective 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
On-Line Sequential Extreme Learning Machine
Huang, G.-B., Liang, N., Rong, H.-J., et al. (2005) · Computational intelligence · Cited by 183
Self-citationGeometrical Interpretation and Architecture Selection of MLP
Xiang, C., Ding, S., & Lee, T. H. (2005) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2004.836197 · Cited by 113
Neuron Selection for RBF Neural Network Classifier Based on Data Structure Preserving Criterion
Mao, K., & Huang, G.-B. (2005) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2005.853575 · Cited by 97
Self-citationAdaptive neural nets filter using a recursive Levenberg-Marquardt search direction
Ngia, L. S. H., Sjoberg, J. S., & Viberg, M. (2002) · Asilomar Conference on Signals, Systems and Computers (ACSSC) · doi:10.1109/acssc.1998.750952 · 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-citationDeep Learning for IoT Big Data and Streaming Analytics: A Survey
Mohammadi, M., Al-Fuqaha, A., Sorour, S., & Guizani, M. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2844341 · Cited by 1,471
Extreme Learning Machine for Multilayer Perceptron
Tang, J., Deng, C., & Huang, G.-B. (2016) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2015.2424995 · Cited by 1,451
Self-citation
Metadata
- Authors
- Liang, N.-Y., Huang, G.-B., Saratchandran, P., & Sundararajan, N.
- Venue
- IEEE Transactions on Neural Networks
- Published
- 2006-11
- Volume
- 17
- Issue
- 6
- Pages
- 1411-1423
- ISSN
- 1045-9227 (ISSN-L)
- 1941-0093
- OpenAlex
- W2158054309
- Cited by
- 1,965
- References
- 35
- FWCI
- 18.75
- 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.