Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 576

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

Probabilistic neural networks and the polynomial Adaline as complementary techniques for classification

Specht, D.F.·1990·IEEE Transactions on Neural Networks

Abstract

Two methods for classification based on the Bayes strategy and nonparametric estimators for probability density functions are reviewed. The two methods are named the probabilistic neural network (PNN) and the polynomial Adaline. Both methods involve one-pass learning algorithms that can be implemented directly in parallel neural network architectures. The performances of the two methods are compared with multipass backpropagation networks, and relative advantages and disadvantages are discussed. PNN and the polynomial Adaline are complementary techniques because they implement the same decision boundaries but have different advantages for applications. PNN is easy to use and is extremely fast for moderate-sized databases. For very large databases and for mature applications in which classification speed is more important than training speed, the polynomial equivalent can be found.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/72.80210

Cites

2 of 2 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 2 references

Research works printed but not linked: 20

  1. murthy, 1966, Multivariate Analysis, 43
  2. 10.1007/BF02869528 · DOI
  3. 10.1109/PGEC.1967.264667 · DOI · Paper page
  4. specht, 1966, Generation of polynomial discriminant functions for pattern recognition
  5. 10.1109/TBME.1967.4502476 · doi:10.1109/tbme.1967.4502476
  6. marchette, 1987, An application of neural networks to a data fusion problem, Proc 1987 Tri-Service Data Fusion Symp, 1, 230
  7. caudill, 1988, The polynomial Adaline algorithm, Comput Lang
  8. sebestyen, 1962, Decision-Making Processes in Pattern Recognition
  9. maloney, 1988, An application of probabilistic neural networks to a hull-to-emitter correlation problem, 6th Annu Intelligence Community Al Symp
  10. 10.1016/0893-6080(90)90049-Q · DOI · Paper page
  11. widrow, 1959, Adaptive sampled-data systems?A statistical theory of adaption, 1959 WESCON Convention Record, 74
  12. 10.1109/IJCNN.1989.118593 · doi:10.1109/ijcnn.1989.118593
  13. 10.1214/aoms/1177704472 · DOI · Paper page
  14. mood, 1962, Introduction to the Theory of Statistics
  15. 10.1109/ICNN.1988.23887 · DOI
  16. rumelhart, 1986, Parallel Distributed Processing, 1, 10.7551/mitpress/5236.001.0001 · DOI · Paper page
  17. 10.1214/aoms/1177700074 · doi:10.1214/aoms/1177700074
  18. 10.1109/TIT.1966.1053856 · DOI
  19. meisel, 1972, Computer-Oriented Approaches to Pattern Recognition
  20. widrow, 1963, Practical applications for adaptive data-processing systems, 1963 WESCON Conv Ree

Cited by

See all 576

Metadata

Authors
Specht, D. F.
Venue
IEEE Transactions on Neural Networks
Published
1990-03
Volume
1
Issue
1
Pages
111-121
ISSN
1045-9227 (ISSN-L)
OpenAlex
W2169554323
Cited by
576
References
2
FWCI
12.27
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: Probabilistic neural networks and the polynomial Adaline as complementary techniques for classification. https://app.cochat.ai/papers/10.1109/72.80210
The paper
Specht, D. F. (1990). Probabilistic neural networks and the polynomial Adaline as complementary techniques for classification. IEEE Transactions on Neural Networks. https://doi.org/10.1109/72.80210

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.