Cited by 179Machine Learning and ELMNeural Networks and ApplicationsStochastic Gradient Optimization Techniques

Non-iterative and Fast Deep Learning: Multilayer Extreme Learning Machines

Open access
Zhang, Jie, Li, Yanjiao, Xiao, Wendong, Zhang, Zhiqiang·2020·Journal of the Franklin Institute

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/j.jfranklin.2020.04.033

Cites

145 of 145 references verified0 citation errors · 0 not checkable

Statistics

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.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • A non-iterative learning method is highly efficient because it is a globally ordered and locally random learning mechanism.

    “It is highly efficient since it is a globally ordered and locally random learning mechanism [7].”

    From An Appraisal of Incremental Learning Methods (2020) · cites this paper as [7]

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

1 of the 146 references couldn’t be matched to a known paper.

Research works printed but not linked: 5

  1. M. Sun, X. Zhang, T. Zheng, Unseen noise estimation using separable deep autoencoder for speech recognition, IEEE/ACM Trans. Audio, Speech, Lang. Process. 24 (1) (2016) 93-104.
  2. L.L.C. Kasun, H. Zhou, G.B. Huang, C.M. Vong, Representational learning with ELMs for big data, IEEE Intell. Syst. 28 (6) (2013) 31-34.
  3. B. Mriza, S. Kok, F. Dong, Multi-layer online sequential extreme learning for image classification, In: Proceedings of ELM-2015, 2016, pp. 39-49. 740
  4. A. Veit, M. Wilber, S. Belongie, Residual networks behave like ensemble of relatively shallow networks, In: Proceedings of the advance in 755 neural information processing systems, 2016, pp. 550-558.
  5. B. Ribeiro, N. Lopes, Extreme learning machine with deep concepts, In: Proceedings of the Iberoamerican Congress on Pattern Recognition, 2013, pp. 182-189.

Cited by

Sorted by citations

Authors
Zhang, J., Li, Y., Xiao, W., & Zhang, Z.
Affiliations
  • Peking University (CN)
  • Beijing Institute of Technology (CN)
  • University of Science and Technology Beijing (CN)
  • University of Leeds (GB)
Corresponding author
Xiao, Wendong
Venue
Journal of the Franklin Institute
Publisher
Elsevier BV
Published
2020-09
Volume
357
Issue
13
Pages
8925-8955
ISSN
0016-0032 (ISSN-L)
OpenAlex
W3040832198
Cited by
179
References
146
Citations by year
2026: 6 · 2025: 14 · 2024: 22 · 2023: 83 · 2022: 35 · 2021: 17 · 2020: 2
FWCI
13.46
Type
journal article
Language
en
Open access
Locations
  • Journal of the Franklin Institute (publishedVersion)
  • White Rose Research Online (University of Leeds, The University of Sheffield, University of York) (acceptedVersion)
Funders
  • National Natural Science Foundation of China
  • China Postdoctoral Science Foundation
  • Ministry of Science and Technology of the People's Republic of China
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and ELM
  • Physical Sciences › Computer Science › Artificial Intelligence › Neural Networks and Applications
  • Physical Sciences › Computer Science › Artificial Intelligence › Stochastic Gradient Optimization Techniques
Keywords
extreme learning machine, random neural networks, universal approximation, deep learning training efficiency

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