Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

The DOI matches its Crossref record; 56 of the 58 references it cites were found in a registry or an index.

Broad Learning System: An Effective and Efficient Incremental Learning System Without the Need for Deep Architecture

Chen, C. L. Philip, Liu, Zhulin · 2018 · IEEE Transactions on Neural Networks and Learning Systems

Abstract

Broad Learning System (BLS) that aims to offer an alternative way of learning in deep structure is proposed in this paper. Deep structure and learning suffer from a time-consuming training process because of a large number of connecting parameters in filters and layers. Moreover, it encounters a complete retraining process if the structure is not sufficient to model the system. The BLS is established in the form of a flat network, where the original inputs are transferred and placed as "mapped features" in feature nodes and the structure is expanded in wide sense in the "enhancement nodes." The incremental learning algorithms are developed for fast remodeling in broad expansion without a retraining process if the network deems to be expanded. Two incremental learning algorithms are given for both the increment of the feature nodes (or filters in deep structure) and the increment of the enhancement nodes. The designed model and algorithms are very versatile for selecting a model rapidly. In addition, another incremental learning is developed for a system that has been modeled encounters a new incoming input. Specifically, the system can be remodeled in an incremental way without the entire retraining from the beginning. Satisfactory result for model reduction using singular value decomposition is conducted to simplify the final structure. Compared with existing deep neural networks, experimental results on the Modified National Institute of Standards and Technology database and NYU NORB object recognition dataset benchmark data demonstrate the effectiveness of the proposed BLS.

Overview

Integrity signals

Registry

Crossref · 10.1109/tnnls.2017.2716952

Cites

56 of 56 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

6 more claims about this paper

Create a free account to see every claim other papers make about this one.

See all claims — free account

Citations

Cites

Show all 58 references

Research works printed but not linked: 2

  1. serre, 2002, Matrices, Theory and Applications
  2. goodfellow, 2016, Deep Learning

Cited by

See all 1,957

Metadata

Authors
Chen, C. L. P., & Liu, Z.
Affiliations
  • Chinese Academy of Sciences (CN)
  • University of Macau (MO)
Venue
IEEE Transactions on Neural Networks and Learning Systems
Published
2018-01
Volume
29
Issue
1
Pages
10-24
ISSN
  • 2162-237X (ISSN-L)
  • 2162-2388
OpenAlex
W2738226240
Cited by
1,957
References
58
Citations by year
2026: 177 · 2025: 312 · 2024: 303 · 2023: 255 · 2022: 270 · 2021: 223 · 2020: 177 · 2019: 158 · 2018: 73
FWCI
68.00
Type
journal article
Language
en
Open access
closed
Locations
  • IEEE Transactions on Neural Networks and Learning Systems (publishedVersion)
  • PubMed (publishedVersion)
Funders
  • Fundo para o Desenvolvimento das Ciências e da Tecnologia (019/2015/A1)
  • UM Research Grants
  • National Nature Science Foundation of China (61572540)
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 › Computer Vision and Pattern Recognition › Advanced Neural Network Applications
Keywords
broad learning system, incremental learning, flat network architecture, network expansion, model reduction, singular value decomposition, object recognition

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: Broad Learning System: An Effective and Efficient Incremental Learning System Without the Need for Deep Architecture. https://app.cochat.ai/papers/10.1109/tnnls.2017.2716952
The paper
Chen, C. L. P., & Liu, Z. (2018). Broad Learning System: An Effective and Efficient Incremental Learning System Without the Need for Deep Architecture. IEEE Transactions on Neural Networks and Learning Systems. https://doi.org/10.1109/tnnls.2017.2716952

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.