Skip to content

Extreme Learning Machine for Regression and Multiclass Classification

Guang-Bin Huang, Hongming Zhou, Xiaojian Ding, Rui Zhang

IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics) · 2011 · 5,578 citations

No retraction on record in OpenAlex.Check Crossref now

Cite this paper

Huang, G.-B., Zhou, H., Ding, X., & Zhang, R. (2011). Extreme learning machine for regression and multiclass classification. IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics), 42(2), 513–529. https://doi.org/10.1109/tsmcb.2011.2168604

In text: (Huang et al., 2011)

Ask a question about this research

One question, free, no account. Anchorcite finds the papers, checks each against Crossref and links every sentence of the answer to the passage it comes from.

Abstract

Due to the simplicity of their implementations, least square support vector machine (LS-SVM) and proximal support vector machine (PSVM) have been widely used in binary classification applications. The conventional LS-SVM and PSVM cannot be used in regression and multiclass classification applications directly, although variants of LS-SVM and PSVM have been proposed to handle such cases. This paper shows that both LS-SVM and PSVM can be simplified further and a unified learning framework of LS-SVM, PSVM, and other regularization algorithms referred to extreme learning machine (ELM) can be built. ELM works for the "generalized" single-hidden-layer feedforward networks (SLFNs), but the hidden layer (or called feature mapping) in ELM need not be tuned. Such SLFNs include but are not limited to SVM, polynomial network, and the conventional feedforward neural networks. This paper shows the following: 1) ELM provides a unified learning platform with a widespread type of feature mappings and can be applied in regression and multiclass classification applications directly; 2) from the optimization method point of view, ELM has milder optimization constraints compared to LS-SVM and PSVM; 3) in theory, compared to ELM, LS-SVM and PSVM achieve suboptimal solutions and require higher computational complexity; and 4) in theory, ELM can approximate any target continuous function and classify any disjoint regions. As verified by the simulation results, ELM tends to have better scalability and achieve similar (for regression and binary class cases) or much better (for multiclass cases) generalization performance at much faster learning speed (up to thousands times) than traditional SVM and LS-SVM.

  1. Long Short-Term Memory1997
  2. Gradient-based learning applied to document recognition1998
  3. Particle swarm optimization2002
  4. Greedy function approximation: A gradient boosting machine.2001
  5. Statistical Learning Theory1999

Metadata from OpenAlex (CC0). Citations are generated from the published record.