CoChat

Dynamic Node Creation in Backpropagation Networks

ASH, TIMUR · 1989 · Connection Science

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

Abstract

This paper introduces a new method called Dynamic Node Creation (DNC) which automatically grows BP networks until the target problem is solved. DNC sequentially adds nodes one at a time to the hidden layer(s) of the network until the desired approximation accuracy is achieved. Simulation results for parity, symmetry, binary addition, and the encoder problem are presented. The procedure was capable of finding known minimal topologies in many cases, and was always within three nodes of the minimum. Computational expense for finding the solutions was comparable to training normal BP networks with the same final topologies. Starting out with fewer nodes than needed to solve the problem actually seems to help find a solution. The method yielded a solution for every problem tried.

Overview

Integrity signals

Registry

Crossref · 10.1080/09540098908915647

Cites

17 of 17 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?

Citations

Cites

Show all 17 references

Research works printed but not linked: 8

  1. Diederich J., 1988, Knowledge-intensive recruitment learning
  2. Hirose Y., 1989, Poster session presented at the International Joint Conference on Neural Networks
  3. Honavar V., 1988, A network of neuron-like units that learns to perceive by generation as well as reweighting of its links
  4. Honavar V., 1988, Experimental results indicate that generation, local receptive fields and global convergence improve perceptual learning in Connectionist networks
  5. Hornik K., 1988, Neural Networks, 1
  6. Mclnerney J.M., 1989, Dynamic node creation for image compression
  7. Rumelhart D.E., 1988, Parallel distributed processing.
  8. White , H. ( 1987 )Some Asymptotic Results for Back Propagation., Proceedings of the IEEE First International Conference on Neural Networks, vIII, 261 – 266 .

Cited by

See all 415

Metadata

Authors
ASH, T.
Affiliations
University of California San Diego (US)
Corresponding author
ASH, TIMUR
Venue
Connection Science
Published
1989-01
Volume
1
Issue
4
Pages
365-375
ISSN
  • 0954-0091 (ISSN-L)
  • 1360-0494
OpenAlex
W2042481239
Cited by
415
References
17
Citations by year
2026: 1 · 2025: 1 · 2024: 6 · 2023: 4 · 2022: 6 · 2021: 12 · 2020: 5 · 2019: 9 · 2018: 10 · 2017: 10 · 2016: 4 · 2015: 6 · 2014: 10 · 2013: 11 · 2012: 11
FWCI
10.65
Type
journal article
Language
en
Open access
closed
Locations
Connection Science (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Neural Networks and Applications
  • Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and ELM
  • Physical Sciences › Computer Science › Artificial Intelligence › Evolutionary Algorithms and Applications
Keywords
BP neural network, hidden layer size, network topology optimization, parity problem, binary addition, symmetry problem

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: Dynamic Node Creation in Backpropagation Networks. https://app.cochat.ai/papers/10.1080/09540098908915647
The paper
ASH, T. (1989). Dynamic Node Creation in Backpropagation Networks. Connection Science. https://doi.org/10.1080/09540098908915647

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.