Prototype‐based models in machine learning
Open accessThe DOI matches its Crossref record; 63 of the 63 references it cites were found in a registry or an index.
Abstract
An overview is given of prototype‐based models in machine learning. In this framework, observations, i.e., data, are stored in terms of typical representatives. Together with a suitable measure of similarity, the systems can be employed in the context of unsupervised and supervised analysis of potentially high‐dimensional, complex datasets. We discuss basic schemes of competitive vector quantization as well as the so‐called neural gas approach and Kohonen's topology‐preserving self‐organizing map. Supervised learning in prototype systems is exemplified in terms of learning vector quantization. Most frequently, the familiar Euclidean distance serves as a dissimilarity measure. We present extensions of the framework to nonstandard measures and give an introduction to the use of adaptive distances in relevance learning. WIREs Cogn Sci 2016, 7:92–111. doi: 10.1002/wcs.1378 This article is categorized under: Psychology > Development and Aging Psychology > Learning
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
The Elements of Statistical Learning
Hastie, T., Tibshirani, R., & Friedman, J. (2009) · Springer Series in Statistics · doi:10.1007/978-0-387-84858-7 · Cited by 25,970
Nearest neighbor pattern classification
Cover, T., & Hart, P. (1967) · IEEE Transactions on Information Theory · doi:10.1109/tit.1967.1053964 · Cited by 16,936 · cited 3×
“Before discussing LVQ, we provide an intuitive introduction in terms of the simplest and most popular data-driven classifier: the Nearest neighbor (NN) classifier or its extensions to k-nearest neighbor (kNN) schemes.(3,6,50) It is roughly the machine learning counterpart of the idea of exemplars used to represent obs…”
MethodKohonen, T. (2001) · Springer Series in Information Sciences · doi:10.1007/978-3-642-56927-2 · Cited by 16,019
Least squares quantization in PCM
Lloyd, S. (1982) · IEEE Transactions on Information Theory · doi:10.1109/tit.1982.1056489 · Cited by 15,836
Advances in Neural Information Processing Systems 19
(2007) · The MIT Press eBooks · doi:10.52202/085713 · Cited by 15,539
THE USE OF MULTIPLE MEASUREMENTS IN TAXONOMIC PROBLEMS
FISHER, R. A. (1936) · Annals of Eugenics · doi:10.1111/j.1469-1809.1936.tb02137.x · Cited by 15,227 · cited 2×
“For illustration purposes, we revisit the wellknown Iris flower data, which was already considered by Fisher.(24) In the dataset as available from the UCI repository,(25) 150 individual flowers are represented by four numerical features (sepal length, sepal width, petal length, petal width) and belong to three differe…”
MethodA Stochastic Approximation Method
Robbins, H., & Monro, S. (1951) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729586 · Cited by 9,643 · cited 1×
“As in any stochastic gradient descent, convergence of the prototype vectors has to be guaranteed by employing a time-dependent learning rate, which slowly approaches zero in the course of training.(9) For a discussion of stochastic gradient descent in machine learning, its convergence properties, the role of the step…”
BackgroundKernel Methods for Pattern Analysis
Shawe-Taylor, J., & Cristianini, N. (2004) · Cambridge University Press eBooks · doi:10.1017/cbo9780511809682 · Cited by 6,587 · cited 5×
“A proper kernel function corresponds to an inner product of transformed feature vectors.(60,61,67) Consider the simple example of a quadratic kernel”
BackgroundMethodInfluentialChiang, L. H., Russell, E. L., & Braatz, R. D. (2001) · Advanced Textbooks in Control and Signal Processing · doi:10.1007/978-1-4471-0347-9_3 · Cited by 5,003
Distance Metric Learning for Large Margin Nearest Neighbor Classification
Weinberger, K. Q., & Saul, L. K. (2009) · Journal of Machine Learning Research · doi:10.5555/1577069.1577078 · Cited by 4,044
Metadata
- Authors
- Biehl, M., Hammer, B., & Villmann, T.
- Venue
- WIREs Cognitive Science
- Publisher
- Wiley
- Published
- 2016-01-21
- Volume
- 7
- Issue
- 2
- Pages
- 92-111
- ISSN
- 1939-5078 (ISSN-L)
- 1939-5086
- OpenAlex
- W2272817333
- Cited by
- 160
- References
- 63
- FWCI
- 11.34
- Type
- journal article
- Language
- en
- Open access
- hybrid
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: Prototype‐based models in machine learning. https://app.cochat.ai/papers/10.1002/wcs.1378
- The paper
- Biehl, M., Hammer, B., & Villmann, T. (2016). Prototype‐based models in machine learning. WIREs Cognitive Science. https://doi.org/10.1002/wcs.1378
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.