Constructive training of probabilistic neural networks
Open accessThe DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
This paper presents an easy to use, constructive training algorithm for probabilistic neural networks, a special type of radial basis function networks. In contrast to other algorithms, predefinition of the network topology is not required. The proposed algorithm introduces new hidden units whenever necessary and adjusts the shape of already existing units individually to minimize the risk of misclassification. This leads to smaller networks compared to classical PNNs and therefore enables the use of large data sets. Using eight classification benchmarks from the StatLog project, the new algorithm is compared to other state of the art classification methods. It is demonstrated that the proposed algorithm generates probabilistic neural networks that achieve a comparable classification performance on these data sets. Only two rather uncritical parameters are required to be adjusted manually and there is no danger of overtraining – the algorithm clearly indicates the end of training. In addition, the networks generated are small due to the lack of redundant neurons in the hidden layer.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
A direct adaptive method for faster backpropagation learning: the RPROP algorithm
Riedmiller, M., & Braun, H. (2002) · IEEE International Conference on Neural Networks · doi:10.1109/icnn.1993.298623 · Cited by 3,917 · cited 1×
“Figure 9 shows the resulting classi cation of the feature space using a PNN trained through the DDA, a Multi Layer Perceptron (trained with RPROP [11], a fast version of Error Back Propagation) and a decision tree constructed through c4.”
MethodMcClelland, J. L., Rumelhart, D. E., & AU (1987) · doi:10.7551/mitpress/5237.001.0001 · Cited by 3,315
Cited by
Computational methods for prediction of in vitro effects of new chemical structures
Banerjee, P., Siramshetty, V. B., Drwal, M. N., & Preissner, R. (2016) · Journal of Cheminformatics · doi:10.1186/s13321-016-0162-2 · Cited by 60
Silahtaroğlu, G., & Yılmaztürk, N. (2021) · Communications in Statistics - Theory and Methods · doi:10.1080/03610926.2019.1622728 · Cited by 37
“Probabilistic Neural Network (PNN) based on the DDA (Dynamic Decay Adjustment) and Random Forest Decision Tree models are separately trained on the vectorized data-set.”
Method
Metadata
- Authors
- Berthold, M. R., & Diamond, J.
- Venue
- Neurocomputing
- Publisher
- Elsevier BV
- Published
- 1998-04
- Volume
- 19
- Issue
- 1-3
- Pages
- 167-183
- ISSN
- 0925-2312 (ISSN-L)
- OpenAlex
- W2004417280
- Cited by
- 191
- References
- 2
- FWCI
- 2.63
- Type
- journal article
- Language
- en
- Open access
- green
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: Constructive training of probabilistic neural networks. https://app.cochat.ai/papers/10.1016/s0925-2312(97)00063-5
- The paper
- Berthold, M. R., & Diamond, J. (1998). Constructive training of probabilistic neural networks. Neurocomputing. https://doi.org/10.1016/s0925-2312(97)00063-5
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.