The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
OP-ELM: Optimally Pruned Extreme Learning Machine
Abstract
In this brief, the optimally pruned extreme learning machine (OP-ELM) methodology is presented. It is based on the original extreme learning machine (ELM) algorithm with additional steps to make it more robust and generic. The whole methodology is presented in detail and then applied to several regression and classification problems. Results for both computational time and accuracy (mean square error) are compared to the original ELM and to three other widely used methodologies: multilayer perceptron (MLP), support vector machine (SVM), and Gaussian process (GP). As the experiments for both regression and classification illustrate, the proposed OP-ELM methodology performs several orders of magnitude faster than the other algorithms used in this brief, except the original ELM. Despite the simplicity and fast performance, the OP-ELM is still able to maintain an accuracy that is comparable to the performance of the SVM. A toolbox for the OP-ELM is publicly available online.
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
UCI Machine Learning Repository
Asuncion, A. (2007) · Medical Entomology and Zoology · Cited by 25,410
Multilayer feedforward networks are universal approximators
Hornik, K., Stinchcombe, M., & White, H. (1989) · Neural Networks · doi:10.1016/0893-6080(89)90020-8 · Cited by 21,728
Neural networks for pattern recognition
(1994) · Choice Reviews Online · doi:10.5860/choice.31-5500 · Cited by 18,538
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
Neural Networks for Pattern Recognition
Bishop, C. M. (1995) · doi:10.1093/oso/9780198538493.001.0001 · Cited by 12,287
Gaussian Processes for Machine Learning
Rasmussen, C. E., & Williams, C. K. I. (2005) · doi:10.7551/mitpress/3206.001.0001 · Cited by 11,705
Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond
Schölkopf, B., & Smola, A. J. (2001) · The MIT Press eBooks · doi:10.7551/mitpress/4175.001.0001 · Cited by 11,703
Libsvm : A library for support vector machines
Ferrari, V. (2008) · Medical Entomology and Zoology · Cited by 10,122
Efron, B., Hastie, T., Johnstone, I., & Tibshirani, R. (2004) · The Annals of Statistics · doi:10.1214/009053604000000067 · Cited by 9,357
Multilayer feedforward networks are universal approximators
HornikK., StinchcombeM., & WhiteH. (1989) · Neural Networks · doi:10.5555/70405.70408 · Cited by 9,081
Classical and Modern Regression With Applications.
Steinhorst, R. K., & Myers, R. H. (1988) · Journal of the American Statistical Association · doi:10.2307/2288958 · Cited by 3,690
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
Classical and Modern Regression with Applications
Ziegel, E. R., & Myers, R. (1991) · Technometrics · doi:10.2307/1269070 · Cited by 2,328
Generalized Inverse of Matrices and Its Applications
Banerjee, K. S. (1973) · Technometrics · doi:10.1080/00401706.1973.10489026 · Cited by 2,310
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
A Theory of Networks for Approximation and Learning
Poggio, T., & Girosi, F. (1989) · Cited by 703
A fast pruned-extreme learning machine for classification problem
Rong, H.-J., Ong, Y.-S., Tan, A.-H., & Zhu, Z. (2008) · Neurocomputing · doi:10.1016/j.neucom.2008.01.005 · Cited by 358
Multiresponse Sparse Regression with Application to Multidimensional Scaling
Similä, T., & Tikka, J. (2005) · Lecture notes in computer science · doi:10.1007/11550907_16 · Cited by 130
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
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
An Insight into Extreme Learning Machines: Random Neurons, Random Features and Kernels
Huang, G.-B. (2014) · Cognitive Computation · doi:10.1007/s12559-014-9255-2 · Cited by 957
Extreme Learning Machines [Trends & Controversies]
Cambria, E., Huang, G.-B., Kasun, L. L. C., Zhou, H., Vong, C. M., Lin, J., Yin, J., Cai, Z., Liu, Q., Li, K., et al. (2013) · IEEE Intelligent Systems · doi:10.1109/mis.2013.140 · Cited by 710
Self-citation
Metadata
- Authors
- Miche, Y., Sorjamaa, A., Bas, P., Simula, O., Jutten, C., & Lendasse, A.
- Venue
- IEEE Transactions on Neural Networks
- Published
- 2010-01
- Volume
- 21
- Issue
- 1
- Pages
- 158-162
- ISSN
- 1045-9227 (ISSN-L)
- 1941-0093
- OpenAlex
- W2130378394
- Cited by
- 765
- References
- 20
- FWCI
- 24.58
- 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.