The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
Perceptron-based learning algorithms
Abstract
A key task for connectionist research is the development and analysis of learning algorithms. An examination is made of several supervised learning algorithms for single-cell and network models. The heart of these algorithms is the pocket algorithm, a modification of perceptron learning that makes perceptron learning well-behaved with nonseparable training data, even if the data are noisy and contradictory. Features of these algorithms include speed algorithms fast enough to handle large sets of training data; network scaling properties, i.e. network methods scale up almost as well as single-cell models when the number of inputs is increased; analytic tractability, i.e. upper bounds on classification error are derivable; online learning, i.e. some variants can learn continually, without referring to previous data; and winner-take-all groups or choice groups, i.e. algorithms can be adapted to select one out of a number of possible classifications. These learning algorithms are suitable for applications in machine learning, pattern recognition, and connectionist expert systems.
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
Neural networks and physical systems with emergent collective computational abilities.
Hopfield, J. J. (1982) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.79.8.2554 · Cited by 19,270
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
Pattern Classification and Scene Analysis
Thompson, M., Duda, R. O., & Hart, P. E. (1974) · Leonardo · doi:10.2307/1573081 · Cited by 4,495
Perceptrons: An Introduction to Computational Geometry
Minsky, M., & Papert, S. A. (1969) · Cited by 3,718
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
Cover, T. M. (1965) · IEEE Transactions on Electronic Computers · doi:10.1109/pgec.1965.264137 · Cited by 2,044
PRINCIPLES OF NEURODYNAMICS. PERCEPTRONS AND THE THEORY OF BRAIN MECHANISMS
ROSENBLATT, F. (1961) · doi:10.21236/ad0256582 · Cited by 1,691
What Size Net Gives Valid Generalization?
Baum, E. B., & Haussler, D. (1989) · Neural Computation · doi:10.1162/neco.1989.1.1.151 · Cited by 1,541
Connectionist learning procedures
Hinton, G. E. (1989) · Artificial Intelligence · doi:10.1016/0004-3702(89)90049-0 · Cited by 1,430
Learning Efficient Classification Procedures and Their Application to Chess End Games
Quinlan, J. R. (1983) · Machine Learning · doi:10.1007/978-3-662-12405-5_15 · Cited by 1,178
Hinton, G. E. (2018) · KiltHub Repository · doi:10.1184/r1/6604925 · Cited by 1,025
Anderson, J. A., Silverstein, J. W., Ritz, S. A., & Jones, R. S. (1977) · Psychological Review · doi:10.1037//0033-295x.84.5.413 · Cited by 899
Kohonen, T. (1972) · IEEE Transactions on Computers · doi:10.1109/tc.1972.5008975 · Cited by 885
Neural Networks and Natural Intelligence
(1988) · The MIT Press eBooks · doi:10.7551/mitpress/4934.001.0001 · Cited by 720
Gallant, S. I. (1988) · Communications of the ACM · doi:10.1145/42372.42377 · Cited by 660
Self-citationLearning quickly when irrelevant attributes abound: A new linear-threshold algorithm
Littlestone, N. (1988) · Machine Learning · doi:10.1007/bf00116827 · Cited by 497
Learning Patterns and Pattern Sequences by Self-Organizing Nets of Threshold Elements
Amari, S.-I. (1972) · IEEE Transactions on Computers · doi:10.1109/t-c.1972.223477 · Cited by 474
Learning in feedforward layered networks: the tiling algorithm
Mezard, M., & Nadal, J.-P. (1989) · Journal of Physics A: Mathematical and General · doi:10.1088/0305-4470/22/12/019 · Cited by 426
Associatron-A Model of Associative Memory
Nakano, K. (1972) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1972.4309133 · Cited by 369
Steinbuch, K. (1961) · Kybernetik · doi:10.1007/bf00293853 · Cited by 325
Mathematical foundations of neurocomputing
Amari, S.-I. (1990) · Proceedings of the IEEE · doi:10.1109/5.58324 · Cited by 228
A method of statistical neurodynamics
Амари, Ш.-И. (1974) · Kybernetik · doi:10.1007/bf00274806 · Cited by 180
Perceptron Trees: A Case Study in Hybrid Concept Representations
UTGOFF, P. E. (1989) · Connection Science · doi:10.1080/09540098908915648 · Cited by 179
Phoneme classification experiments using radial basis functions
Renals, & Rohwer (1989) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.1989.118620 · Cited by 124
An experimental comparison of symbolic and connectionist learning algorithms
Mooney, R. J., SHAVLIK, J. W., Towell, G. G., & Gove, A. N. (1989) · Cited by 108
Kamath, U., Liu, J., & Whitaker, J. (2019) · Springer eBooks · doi:10.1007/978-3-030-14596-5_5 · Cited by 82
A connectionist learning algorithm with provable generalization and scaling bounds
Gallant, S. I. (1990) · Neural Networks · doi:10.1016/0893-6080(90)90089-4 · Cited by 28
Self-citationAlphanumeric character recognition using a connectionist model with the pocket algorithm
Hayashi, Y., Sakata, M., Nakao, T., Ohno, T., & Ohhashi, S. (1989) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.1989.118426 · Cited by 8
Cited by
A Survey on Evaluation of Large Language Models
Chang, Y., Wang, X., Wang, J., Wu, Y., Yang, L., Zhu, K., Chen, H., Yi, X., Wang, C., Wang, Y., et al. (2024) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/3641289 · Cited by 4,254
“For instance, the Perceptron algorithm [46], touted as an Artificial General Intelligence (AGI) approach in the 1950s, was later revealed as inadequate due to its inability to resolve the XOR problem.”
MethodA Survey on Human Activity Recognition using Wearable Sensors
Lara, O. D., & Labrador, M. A. (2013) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2012.110112.00192 · Cited by 2,662
Multilayer perceptrons for classification and regression
Murtagh, F. (1991) · Neurocomputing · doi:10.1016/0925-2312(91)90023-5 · Cited by 1,014
On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems
Amaldi, E., & Kann, V. (1998) · Theoretical Computer Science · doi:10.1016/s0304-3975(97)00115-1 · Cited by 753
Theodoridis, S. (2003) · Encyclopedia of Information Systems · doi:10.1016/b0-12-227240-4/00132-5 · Cited by 326
Metadata
- Authors
- Gallant, S. I.
- Venue
- IEEE Transactions on Neural Networks
- Published
- 1990-06
- Volume
- 1
- Issue
- 2
- Pages
- 179-191
- ISSN
- 1045-9227 (ISSN-L)
- OpenAlex
- W2129727551
- Cited by
- 558
- References
- 30
- 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.