The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Feature Discovery by Competitive Learning*
Open accessAbstract
This paper reports the results of our studies with an unsupervised learning paradigm which we have called “Competitive Learning.” We have examined competitive learning using both computer simulation and formal analysis and have found that when it is applied to parallel networks of neuron‐like elements, many potentially useful learning tasks can be accomplished. We were attracted to competitive learning because it seems to provide a way to discover the salient, general features which can be used to classify a set of patterns. We show how a very simply competitive mechanism can discover a set of feature detectors which capture important aspects of the set of stimulus input patterns. We also show how these feature detectors can form the basis of a multilayer system that can serve to learn categorizations of stimulus sets which are not linearly separable. We show how the use of correlated stimuli con serve as a kind of “teaching” input to the system to allow the development of feature detectors which would not develop otherwise. Although we find the competitive learning mechanism a very interesting and powerful learning principle, we do not, of course, imagine thot it is the only learning principle. Competitive learning is an essentially nonassociative statistical learning scheme. We certainly imagine that other kinds of learning mechanisms will be involved in the building of associations among patterns of activation in a more complete neural network. We offer this analysis of these competitive learning mechanisms to further our understanding of how simple adaptive networks can discover features important in the description of the stimulus environment in which the system finds itself.
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 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
Hebb, D. O. (2005) · doi:10.4324/9781410612403 · Cited by 9,825
indicated, N. A. (1950) · Journal of Consulting Psychology · doi:10.1037/h0049612 · Cited by 6,923
McClelland, J. L., & Rumelhart, D. E. (1981) · Psychological Review · doi:10.1037/0033-295x.88.5.375 · Cited by 4,889
Self-citationBienenstock, E., Cooper, L., & Munro, P. (1982) · The Journal of Neuroscience · doi:10.1523/jneurosci.02-01-00032.1982 · Cited by 2,896 · cited 1×
“The second method is similar to that employed by Bienenstock, Cooper, and Munro (1982), in which a unit modulates its own sensitivity so that when it is not receiving enough inputs, it becomes increasingly sensitive.”
MethodGrossberg, S. (1976) · Biological Cybernetics · doi:10.1007/bf00344744 · Cited by 1,909
Rumelhart, D. E., & McClelland, J. L. (1982) · Psychological Review · doi:10.1037//0033-295x.89.1.60 · Cited by 1,525
Self-citationSelf-organization of orientation sensitive cells in the striate cortex
von der Malsburg, C. (1973) · Kybernetik · doi:10.1007/bf00288907 · Cited by 1,461
Bek, R. (1978) · Czech digital mathematics library · Cited by 787
Cognitron: A self-organizing multilayered neural network
Fukushima, K. (1975) · Biological Cybernetics · doi:10.1007/bf00342633 · Cited by 757
DISCRIMINATION LEARNING WITH AND WITHOUT “ERRORS”1
Terrace, H. S. (1963) · Journal of the Experimental Analysis of Behavior · doi:10.1901/jeab.1963.6-1 · Cited by 725
Simulation of self-organizing systems by digital computer
Farley, B., & Clark, W. (1954) · Transactions of the IRE Professional Group on Information Theory · doi:10.1109/tit.1954.1057468 · Cited by 270
Cited by
Deep learning in neural networks: an overview
Schmidhuber, J. (2015) · Neural Networks · doi:10.1016/j.neunet.2014.09.003 · Cited by 18,570
A theory of lexical access in speech production
Levelt, W. J. M., Roelofs, A., & Meyer, A. S. (1999) · Behavioral and Brain Sciences · doi:10.1017/s0140525x99001776 · Cited by 5,136
Representativeness revisited: Attribute substitution in intuitive judgment.
Kahneman, D., & Frederick, S. (2002) · Heuristics and Biases · doi:10.1017/cbo9780511808098.004 · Cited by 3,476
Learning internal representations by error propagation
RUMELHART, D. E., HINTON, G. E., & WILLIAMS, R. J. (1988) · Readings in Cognitive Science · doi:10.1016/b978-1-4832-1446-7.50035-2 · Cited by 3,002
Self-citationThe TRACE model of speech perception
McClelland, J. L., & Elman, J. L. (1986) · Cognitive Psychology · doi:10.1016/0010-0285(86)90015-0 · Cited by 2,956
Metadata
- Authors
- Rumelhart, D. E., & Zipser, D.
- Venue
- Cognitive Science
- Publisher
- Wiley
- Published
- 1985-01
- Volume
- 9
- Issue
- 1
- Pages
- 75-112
- ISSN
- 0364-0213 (ISSN-L)
- 1551-6709
- OpenAlex
- W1490454746
- Cited by
- 1,057
- References
- 12
- FWCI
- 26.86
- Type
- journal article
- Language
- en
- Open access
- bronze
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.