Cited by 888Neural Networks and ApplicationsDomain Adaptation and Few-Shot LearningData Stream Mining Techniques

Learn++: an incremental learning algorithm for supervised neural networks

Polikar, R., Upda, L., Upda, S.S., Honavar, V.·2001·IEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews)

Abstract

We introduce Learn++, an algorithm for incremental training of neural network (NN) pattern classifiers. The proposed algorithm enables supervised NN paradigms, such as the multilayer perceptron (MLP), to accommodate new data, including examples that correspond to previously unseen classes. Furthermore, the algorithm does not require access to previously used data during subsequent incremental learning sessions, yet at the same time, it does not forget previously acquired knowledge. Learn++ utilizes ensemble of classifiers by generating multiple hypotheses using training data sampled according to carefully tailored distributions. The outputs of the resulting classifiers are combined using a weighted majority voting procedure. We present simulation results on several benchmark datasets as well as a real-world classification task. Initial results indicate that the proposed algorithm works rather well in practice. A theoretical upper bound on the error of the classifiers constructed by Learn++ is also provided.

Integrity signals

Registry

Crossref · 10.1109/5326.983933

Cites

41 of 41 references verified0 citation errors · 0 not checkable

Statistics

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

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?

  • Learn++ has the ability to learn new classes, a small number of parameters, and short training time, but suffers from data imbalance when learning new classes.

    “As an algorithm proposed earlier, the ability to learn new classes is one of the main features and advantages of learn++. It also has the advantages of a small number of parameters and short training time. However, it suffers from data imbalance when learning new classes.”

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

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Polikar, R., Upda, L., Upda, S. S., & Honavar, V.
Affiliations
  • Iowa State University (US)
  • Michigan State University (US)
Venue
IEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews)
Published
2001
Volume
31
Issue
4
Pages
497-508
ISSN
1094-6977 (ISSN-L)
OpenAlex
W2103753221
Cited by
888
References
41
Citations by year
2026: 12 · 2025: 26 · 2024: 29 · 2023: 44 · 2022: 57 · 2021: 65 · 2020: 73 · 2019: 76 · 2018: 44 · 2017: 44 · 2016: 32 · 2015: 40 · 2014: 43 · 2013: 29 · 2012: 32
FWCI
8.15
Type
journal article
Language
en
Open access
closed
Locations
IEEE Transactions on Systems Man and Cybernetics Part C (Applications and Reviews) (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Neural Networks and Applications
  • Physical Sciences › Computer Science › Artificial Intelligence › Domain Adaptation and Few-Shot Learning
  • Physical Sciences › Computer Science › Artificial Intelligence › Data Stream Mining Techniques
Keywords
incremental learning, neural network classifier, multilayer perceptron, ensemble classifiers, weighted majority voting, unseen classes, catastrophic forgetting, training data sampling, error bounds

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