Soft Learning Vector Quantization
The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Abstract
Learning vector quantization (LVQ) is a popular class of adaptive nearest prototype classifiers for multiclass classification, but learning algorithms from this family have so far been proposed on heuristic grounds. Here, we take a more principled approach and derive two variants of LVQ using a gaussian mixture ansatz. We propose an objective function based on a likelihood ratio and derive a learning rule using gradient descent. The new approach provides a way to extend the algorithms of the LVQ family to different distance measure and allows for the design of “soft” LVQ algorithms. Benchmark results show that the new methods lead to better classification performance than LVQ 2.1. An additional benefit of the new method is that model assumptions are made explicit, so that the method can be adapted more easily to different kinds of problems.
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
(1973) · CERN Document Server (European Organization for Nuclear Research) · Cited by 12,895
A Stochastic Approximation Method
Robbins, H., & Monro, S. (1951) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729586 · Cited by 9,643
Improved versions of learning vector quantization
Kohonen, T. (1990) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.1990.137622 · Cited by 585 · cited 4×
“There have also been proposed new versions designed to improve classification performance (Kohonen, 1990; Kohonen et al., 1995).”
BackgroundMethodInfluentialKohonen, T. (2001) · Springer Series in Information Sciences · doi:10.1007/978-3-642-56927-2_6 · Cited by 438
Multiclass least squares support vector machines
Suykens, J. A. K., & Vandewalle, J. (2003) · IJCNN'99. International Joint Conference on Neural Networks. Proceedings (Cat. No.99CH36339) · doi:10.1109/ijcnn.1999.831072 · Cited by 158 · cited 1×
“Note that the performance of our new method is comparable to and slightly better than the performance obtained with the support vector machine (SVM) method for multiclass classification (Suykens & Vandewalle, 1999).”
MethodA global optimization technique for statistical classifier design
Miller, D. J., Rao, A. V., Rose, K. H., & Gersho, A. (1996) · IEEE Transactions on Signal Processing · doi:10.1109/78.553484 · Cited by 103 · cited 1×
“In the spirit of deterministic annealing, which is a useful optimization procedure for clustering problems (Graepel, Burger, & Obermayer, 1997; Miller, Rao, Rose, & Gersho, 1996), σ 2 is set to a large value initially and is decreased during optimization (“annealing”) until an optimal value σ f is…”
MethodPhase transitions in stochastic self-organizing maps
Graepel, T., Burger, M., & Obermayer, K. (1997) · Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics · doi:10.1103/physreve.56.3876 · Cited by 97 · cited 1×
“of deterministic annealing, which is a useful optimization procedure for clustering problems ( Graepel, Burger, & Obermayer, 1997; Miller, Rao, Rose, & Gersho, 1996), σ 2 is set to a large value initially and is decreased during”
MethodSelf-citation
Cited by
Adaptive Relevance Matrices in Learning Vector Quantization
Schneider, P., Biehl, M., & Hammer, B. (2009) · Neural Computation · doi:10.1162/neco.2009.11-08-908 · Cited by 345
Prototype‐based models in machine learning
Biehl, M., Hammer, B., & Villmann, T. (2016) · WIREs Cognitive Science · doi:10.1002/wcs.1378 · Cited by 160
“Important examples are the so-called generalized LVQ (GLVQ), which is related to the concept of large margin classification(56,57) and robust soft LVQ (RSLVQ), which is based on the statistical modeling of the data.(58,59) The basic ingredients of most LVQ training prescriptions are, however, already apparent in heuri…”
(2021) · International Conference on Learning Representations · Cited by 65
Metadata
- Authors
- Seo, S., & Obermayer, K.
- Venue
- Neural Computation
- Publisher
- MIT Press - Journals
- Published
- 2003-07-01
- Volume
- 15
- Issue
- 7
- Pages
- 1589-1604
- ISSN
- 0899-7667 (ISSN-L)
- 1530-888X
- OpenAlex
- W2109993655
- Cited by
- 190
- References
- 7
- FWCI
- 7.77
- 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.