Dynamic Node Creation in Backpropagation Networks
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
Cites
Statistics
Verification
Claims the paper makes
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?
In the citing paper
“Allowing networks to reconfigure dynamically or acquire additional nodes has been shown to facilitate learning (Ash, 1989; Fahlman & Lebiere, 1990; Shultz & Schmidt, 1991).”
From Learning and development in neural networks: the importance of starting small (1993) · cites this paper as Ash, 1989
Citations
Cites
Multilayer feedforward networks are universal approximators
Hornik, K., Stinchcombe, M., & White, H. (1989) · Neural Networks · doi:10.1016/0893-6080(89)90020-8 · Cited by 21,728
Learning Internal Representations by Error Propagation
Rumelhart, D. E., Hinton, G. E., & Williams, R. J. (1985) · doi:10.21236/ada164453 · Cited by 16,172
Parallel Distributed Processing: Explorations in the Microstructure of Cognition: Foundations
Rumelhart, D. E., McClelland, J. L., & AU (1986) · doi:10.7551/mitpress/5236.001.0001 · Cited by 15,686
Multilayer feedforward networks are universal approximators
HornikK., StinchcombeM., & WhiteH. (1989) · Neural Networks · doi:10.5555/70405.70408 · Cited by 9,081
McClelland, J. L., Rumelhart, D. E., & AU (1987) · doi:10.7551/mitpress/5237.001.0001 · Cited by 3,315
Beyond Regression : "New Tools for Prediction and Analysis in the Behavioral Sciences
Werbos, P. J. (1974) · Medical Entomology and Zoology · Cited by 2,789
Beyond regression : new fools for prediction and analysis in the behavioral sciences
Werbos, P. J. (1974) · Medical Entomology and Zoology · Cited by 2,739
Theory of the backpropagation neural network
Hecht-Nielsen (1989) · International Joint Conference on Neural Networks · doi:10.1109/ijcnn.1989.118638 · Cited by 2,222
Comparing Biases for Minimal Network Construction with Back-Propagation
Hanson, S. J., & Pratt, L. (1988) · neural information processing systems · Cited by 738
Proceedings of the 1988 Connectionist Models Summer School
Touretzsky, D., Hinton, G. E., & B, T. J. S. A. (1989) · Morgan Kaufmann eBooks · Cited by 611
Research works printed but not linked: 8
- Diederich J., 1988, Knowledge-intensive recruitment learning
- Hirose Y., 1989, Poster session presented at the International Joint Conference on Neural Networks
- Honavar V., 1988, A network of neuron-like units that learns to perceive by generation as well as reweighting of its links
- Honavar V., 1988, Experimental results indicate that generation, local receptive fields and global convergence improve perceptual learning in Connectionist networks
- Hornik K., 1988, Neural Networks, 1
- Mclnerney J.M., 1989, Dynamic node creation for image compression
- Rumelhart D.E., 1988, Parallel distributed processing.
- White , H. ( 1987 )Some Asymptotic Results for Back Propagation., Proceedings of the IEEE First International Conference on Neural Networks, vIII, 261 – 266 .
Cited by
Deep learning in neural networks: an overview
Schmidhuber, J. (2015) · Neural Networks · doi:10.1016/j.neunet.2014.09.003 · Cited by 18,570
Theory of the backpropagation neural network
Hecht-Nielsen (1989) · International Joint Conference on Neural Networks · doi:10.1109/ijcnn.1989.118638 · Cited by 2,222
Learning and development in neural networks: the importance of starting small
Elman, J. L. (1993) · Cognition · doi:10.1016/0010-0277(93)90058-4 · Cited by 1,988
Improving generalization with active learning
Cohn, D., Atlas, L., & Ladner, R. (1994) · Machine Learning · doi:10.1007/bf00993277 · Cited by 1,591
An evolutionary algorithm that constructs recurrent neural networks
Angeline, P. J., Saunders, G. M., & Pollack, J. B. (1994) · IEEE Transactions on Neural Networks · doi:10.1109/72.265960 · Cited by 1,012
Metadata
- Authors
- ASH, T.
- Affiliations
- University of California San Diego (US)
- Corresponding author
- ASH, TIMUR
- Venue
- Connection Science
- Publisher
- Informa UK Limited
- 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.