The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
What connectionist models learn: Learning and representation in connectionist networks
Abstract
Connectionist models provide a promising alternative to the traditional computational approach that has for several decades dominated cognitive science and artificial intelligence, although the nature of connectionist models and their relation to symbol processing remains controversial. Connectionist models can be characterized by three general computational features: distinct layers of interconnected units, recursive rules for updating the strengths of the connections during learning, and “simple” homogeneous computing elements. Using just these three features one can construct surprisingly elegant and powerful models of memory, perception, motor control, categorization, and reasoning. What makes the connectionist approach unique is not its variety of representational possibilities (including “distributed representations”) or its departure from explicit rule-based models, or even its preoccupation with the brain metaphor. Rather, it is that connectionist models can be used to explore systematically the complex interaction between learning and representation, as we try to demonstrate through the analysis of several large networks.
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
Learning representations by back-propagating errors
Rumelhart, D. E., Hinton, G. E., & Williams, R. J. (1986) · Nature · doi:10.1038/323533a0 · Cited by 31,892
A logical calculus of the ideas immanent in nervous activity
McCulloch, W. S., & Pitts, W. (1943) · The Bulletin of Mathematical Biophysics · doi:10.1007/bf02478259 · Cited by 18,566
Approximation by superpositions of a sigmoidal function
Cybenko, G. (1989) · Mathematics of Control, Signals, and Systems · doi:10.1007/bf02551274 · Cited by 13,883
Searle, J. R. (1980) · Behavioral and Brain Sciences · doi:10.1017/s0140525x00005756 · Cited by 6,954
WIDROW, B., & HOFF, M. E. (1960) · doi:10.21236/ad0241531 · Cited by 4,009
A learning algorithm for Boltzmann machines
Ackley, D. H., Hinton, G. E., & Sejnowski, T. J. (1985) · Cognitive Science · doi:10.1207/s15516709cog0901_7 · Cited by 3,402
Valiant, L. G. (1984) · Communications of the ACM · doi:10.1145/1968.1972 · Cited by 3,279
A New Approach to Manipulator Control: The Cerebellar Model Articulation Controller (CMAC)
Albus, J. S. (1975) · Journal of Dynamic Systems, Measurement, and Control · doi:10.1115/1.3426922 · Cited by 2,177 · cited 1×
“The logistic or hyperbolic tangent functions have been used in the fan-out of units in models like ART (adaptive resonance theory, Grossberg 1987), brain-state-in-box, Boltzmann machines (Ackley et al. 1985), CMAC (Albus 1975), and back-propagation (Rumelhart, Hinton & Williams 1986).”
Cover, T. M. (1965) · IEEE Transactions on Electronic Computers · doi:10.1109/pgec.1965.264137 · Cited by 2,044
Competitive learning: From interactive activation to adaptive resonance
Grossberg, S. (1987) · Cognitive Science · doi:10.1111/j.1551-6708.1987.tb00862.x · Cited by 1,471
Cited by
Understanding normal and impaired word reading: Computational principles in quasi-regular domains.
Plaut, D. C., McClelland, J. L., Seidenberg, M. S., & Patterson, K. (1996) · Psychological Review · doi:10.1037/0033-295x.103.1.56 · Cited by 2,698
ALCOVE: An exemplar-based connectionist model of category learning.
Kruschke, J. K. (1992) · Psychological Review · doi:10.1037/0033-295x.99.1.22 · Cited by 1,582
Rules vs. analogy in English past tenses: a computational/experimental study
Albright, A., & Hayes, B. (2003) · Cognition · doi:10.1016/s0010-0277(03)00146-x · Cited by 769
A weighted nearest neighbor algorithm for learning with symbolic features
Cost, S., & Salzberg, S. (1993) · Machine Learning · doi:10.1007/bf00993481 · Cited by 764
Mathematical principles of reinforcement
Killeen, P. R. (1994) · Springer eBooks · doi:10.1007/978-3-032-17450-5_4 · Cited by 264
Metadata
- Authors
- Hanson, S. J., & Burr, D. J.
- Venue
- Behavioral and Brain Sciences
- Publisher
- Cambridge University Press (CUP)
- Published
- 1990-09
- Volume
- 13
- Issue
- 3
- Pages
- 471-489
- ISSN
- 0140-525X (ISSN-L)
- 1469-1825
- OpenAlex
- W60533568
- Cited by
- 175
- References
- 14
- FWCI
- 9.89
- 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: What connectionist models learn: Learning and representation in connectionist networks. https://app.cochat.ai/papers/10.1017/s0140525x00079760
- The paper
- Hanson, S. J., & Burr, D. J. (1990). What connectionist models learn: Learning and representation in connectionist networks. Behavioral and Brain Sciences. https://doi.org/10.1017/s0140525x00079760
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.