The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
A Penalty-Function Approach for Pruning Feedforward Neural Networks
Abstract
This article proposes the use of a penalty function for pruning feedforward neural network by weight elimination. The penalty function proposed consists of two terms. The first term is to discourage the use of unnecessary connections, and the second term is to prevent the weights of the connections from taking excessively large values. Simple criteria for eliminating weights from the network are also given. The effectiveness of this penalty function is tested on three well-known problems: the contiguity problem, the parity problems, and the monks problems. The resulting pruned networks obtained for many of these problems have fewer connections than previously reported in the literature.
Overview
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.
Integrity signals
Registry
Cites
Statistics
Verification
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.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Dynamic node creation in backpropagation networks
ASH, T. (1989) · Connection Science · doi:10.1080/09540098908915647 · Cited by 415
Cited by
Maier, H. R., & Dandy, G. C. (2000) · Environmental Modelling & Software · doi:10.1016/s1364-8152(99)00007-9 · Cited by 2,377
A systematic review on overfitting control in shallow and deep neural networks
Bejani, M. M., & Ghatee, M. (2021) · Artificial Intelligence Review · doi:10.1007/s10462-021-09975-1 · Cited by 573
Using Neural Network Rule Extraction and Decision Tables for Credit-Risk Evaluation
Baesens, B., Setiono, R., Mues, C., & Vanthienen, J. (2003) · Management Science · doi:10.1287/mnsc.49.3.312.12739 · Cited by 536
Self-citationNeural-network feature selector
Setiono, R., & Liu, H. (1997) · IEEE Transactions on Neural Networks · doi:10.1109/72.572104 · Cited by 379
Self-citationEffective data mining using neural networks
Lu, H., Setiono, R., & Liu, H. (1996) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.553163 · Cited by 358
Self-citation
Metadata
- Authors
- Setiono, R.
- Venue
- Neural Computation
- Publisher
- MIT Press - Journals
- Published
- 1997-01-01
- Volume
- 9
- Issue
- 1
- Pages
- 185-204
- ISSN
- 0899-7667 (ISSN-L)
- 1530-888X
- OpenAlex
- W2111719156
- Cited by
- 192
- References
- 1
- FWCI
- 11.41
- Type
- journal article
- Language
- en
- Open access
- closed
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: A Penalty-Function Approach for Pruning Feedforward Neural Networks. https://app.cochat.ai/papers/10.1162/neco.1997.9.1.185
- The paper
- Setiono, R. (1997). A Penalty-Function Approach for Pruning Feedforward Neural Networks. Neural Computation. https://doi.org/10.1162/neco.1997.9.1.185
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.