About the multidimensional competitive learning vector quantization algorithm with constant gain

DOI10.1214/AOAP/1034801249MaRDI QIDQ1370999zbMATH OpenOpenAlexFDO

Authors Catherine Bouton, Gilles Pagès

Publication date 9 August 1998

Published in The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1214/aoap/1034801249

zbMATH Keywords

Markov chainneural networksvector quantizationuniform ergodicity

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Limit theorems in probability theory (60F99)

Recommendations

• Average competitive learning vector quantization
• Convergence in Distribution of the One-Dimensional Kohonen Algorithms when the Stimuli are not Uniform
• Convergence of the one-dimensional Kohonen algorithm

Cites work

• scientific article; zbMATH DE number 48067 (Why is no real title available?)
• scientific article; zbMATH DE number 3519673 (Why is no real title available?)
• scientific article; zbMATH DE number 3085434 (Why is no real title available?)
• A self-organizing cluster process
• Analysis of a simple self-organizing process
• Convergence in Distribution of the One-Dimensional Kohonen Algorithms when the Stimuli are not Uniform
• Exponential rate of convergence for Lloyd's method I
• Markov chains and stochastic stability
• On the a.s. convergence of the Kohonen algorithm with a general neighborhood function
• Self-organization and a.s. convergence of the one-dimensional Kohonen algorithm with non-uniformly distributed stimuli
• Self-organization and associative memory
• Sufficient conditions for uniqueness of a locally optimal quantizer for a class of convex error weighting functions
• Étude d'un processus d'auto-organisation. (Study of a self-organization process)

Cited in

(8)

• Numerical methods for the exit time of a piecewise-deterministic Markov process
• Limit theorems for random normalized distortion
• Simulated annealing with a potential function with discontinuous gradient on \(\mathbb R^d\)
• A space quantization method for numerical integration
• Average competitive learning vector quantization
• Pointwise convergence of the Lloyd I algorithm in higher dimension
• Bridging the gap between constant step size stochastic gradient descent and Markov chains
• Error analysis of the optimal quantization algorithm for obstacle problems.

This page was built for publication: About the multidimensional competitive learning vector quantization algorithm with constant gain

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1370999)