The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Probabilistic neural networks and the polynomial Adaline as complementary techniques for classification
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.
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
Nearest neighbor pattern classification
Cover, T., & Hart, P. (1967) · IEEE Transactions on Information Theory · doi:10.1109/tit.1967.1053964 · Cited by 16,936
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
On Estimation of a Probability Density Function and Mode
Parzen, E. (1962) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177704472 · Cited by 10,585
WIDROW, B., & HOFF, M. E. (1960) · doi:10.21236/ad0241531 · Cited by 4,009
Specht, D. F. (1990) · Neural Networks · doi:10.1016/0893-6080(90)90049-q · Cited by 3,762
Self-citationEstimation of a multivariate density
Cacoullos, T. (1966) · Annals of the Institute of Statistical Mathematics · doi:10.1007/bf02869528 · Cited by 654
Probabilistic neural networks for classification, mapping, or associative memory
Specht (1988) · IEEE International Conference on Neural Networks/IEEE ... International Conference on Neural Networks · doi:10.1109/icnn.1988.23887 · Cited by 583
Decision-Making Processes in Pattern Recognition
Eddy, R. P., & Sebestyen, G. S. (1963) · Mathematics of Computation · doi:10.2307/2004038 · Cited by 402
Computer-Oriented Approaches to Pattern Recognition
(1972) · Mathematics in Science and Engineering · doi:10.1016/s0076-5392(08)x6008-4 · Cited by 360
Generation of Polynomial Discriminant Functions for Pattern Recognition
Specht, D. F. (1967) · IEEE Transactions on Electronic Computers · doi:10.1109/pgec.1967.264667 · Cited by 249
Self-citationVenables, W. N., & Ripley, B. D. (1997) · Statistics and Computing · doi:10.1007/978-1-4757-2719-7_13 · Cited by 232
The use of an adaptive threshold element to design a linear optimal pattern classifier
Koford, J. S., & Groner, G. F. (1966) · IEEE Transactions on Information Theory · doi:10.1109/tit.1966.1053856 · Cited by 119
Research works printed but not linked: 10
- specht, 1966, Generation of polynomial discriminant functions for pattern recognition
- 10.1109/TBME.1967.4502476 · doi:10.1109/tbme.1967.4502476
- marchette, 1987, An application of neural networks to a data fusion problem, Proc 1987 Tri-Service Data Fusion Symp, 1, 230
- caudill, 1988, The polynomial Adaline algorithm, Comput Lang
- maloney, 1988, An application of probabilistic neural networks to a hull-to-emitter correlation problem, 6th Annu Intelligence Community Al Symp
- widrow, 1959, Adaptive sampled-data systems?A statistical theory of adaption, 1959 WESCON Convention Record, 74
- 10.1109/IJCNN.1989.118593 · doi:10.1109/ijcnn.1989.118593
- mood, 1962, Introduction to the Theory of Statistics
- 10.1214/aoms/1177700074 · doi:10.1214/aoms/1177700074
- widrow, 1963, Practical applications for adaptive data-processing systems, 1963 WESCON Conv Ree
Cited by
Pattern Recognition and Neural Networks
Ripley, B. D. (1996) · Cambridge University Press eBooks · doi:10.1017/cbo9780511812651 · Cited by 6,459
Prediction, Learning, and Games
Cesa-Bianchi, N., & Lugosi, G. (2006) · Cambridge University Press eBooks · doi:10.1017/cbo9780511546921 · Cited by 3,162
A new Fruit Fly Optimization Algorithm: Taking the financial distress model as an example
Pan, W.-T. (2012) · Knowledge-Based Systems · doi:10.1016/j.knosys.2011.07.001 · Cited by 1,543
Machine learning and radiology
Wang, S., & Summers, R. M. (2012) · Medical Image Analysis · doi:10.1016/j.media.2012.02.005 · Cited by 697
Neural Networks and Related Methods for Classification
Ripley, B. D. (1994) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1994.tb01990.x · Cited by 627
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
- 12
- 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
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.