Convergence of Kohonen's learning vector quantization
1990
It is shown that the learning vector quantization (LVQ) algorithm (T. Kohonen, 1986), converges to locally asymptotic stable equilibria of an ordinary differential equation. It is shown that the learning algorithm performs stochastic approximation. Convergence of the vectors is guaranteed under the appropriate conditions on the underlying statistics of the classification problem. Also presented is a modification to the learning algorithm which results in more robust convergence. With this modification, it is possible to show that as the appropriate parameters go to infinity, the decision regions associated with the modified LVQ algorithm approach the Bayesian optimal
Keywords:
- Machine learning
- Mathematical optimization
- Ordinary differential equation
- Artificial intelligence
- Parallel algorithm
- Stochastic process
- Learning vector quantization
- Linde–Buzo–Gray algorithm
- Pattern recognition
- Wake-sleep algorithm
- Self-organizing map
- Stochastic approximation
- Mathematics
- Computer science
- Convergence (routing)
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
5
References
18
Citations
NaN
KQI