Skip to main content
Log in

Finite-Sample Convergence Properties of the LVQ1 Algorithm and the Batch LVQ1 Algorithm

  • Published:
Neural Processing Letters Aims and scope Submit manuscript

Abstract

This letter addresses the asymptotic convergence of Kohonen's LVQ1 algorithm when the number of training samples are finite with an analysis that uses the dynamical systems and optimisation theories. It establishes the sufficient conditions to ensure the convergence of LVQ1 near a minimum of its cost function for constant step sizes and cyclic sampling. It also proposes a batch version of LVQ1 based on the very fast Newton optimisation method that cancels the dependence of the on-line version on the order of supplied training samples.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Kohonen, T.: Self-Organizing Maps, 2nd Edn, Springer-Verlag, Berlin (1996).

    Google Scholar 

  2. LaVigna, A.: Nonparametric classification using LVQ. Ph.D. Dissertation. University of Maryland (1989).

  3. Zhu, C. et al.: Analysis of LVQ algorithms for Pattern Classification. Proc. of ICASSP 95, 5 (1995), 3471–3474.

    Google Scholar 

  4. Bottou, L.: Online Learning and Stochastic Approximations, In D. Saal (ed.), Online Learning and Neural Networks, Cambridge University Press, Cambridge (1998).

    Google Scholar 

  5. Benveniste, A., Métivier, M. and Priouret, P.: Adaptive Algorithms and Stochastic Approximations, Springer-Verlag, Berlin (1990).

    Google Scholar 

  6. Devaney, R. L.: An Introduction to Chaotic Dynamical Systems, 2nd edn. Reading, Addison-Wesley, Boston, MA (1989).

    Google Scholar 

  7. Hiriart-Urruty, J. B. and Lemaréchal, C.: Convex Analysis and Minimization Algorithms, Springer-Verlag, Berlin (1993).

    Google Scholar 

  8. Dennis Jr. J. E. and Schnabel, R. B.: A View of Unconstrained Optimization, In G. L. Nemhauser, A. H. G. Rinnooy Kan and M. J. Todd (eds.), Optimization, North-Holland, Amsterdam (1989).

    Google Scholar 

  9. Hestenes, M.: Conjugate Direction Methods in Optimization, Springer-Verlag, Berlin (1980).

    Google Scholar 

  10. Kohonen, T., Hynninen, J., Kangas, J., Laaksonen, J. and Torkkola, K. Kari,: LVQPAK. The Learning Vector Quantization Program Package. Version 3.1, Laboratory of Computer and Information Science, Helsinki University of Technology (1995).

  11. Bishop, C. M.: Neural Networks and Pattern Recognition, Oxford University Press, Oxford (1995).

    Google Scholar 

  12. Devroye, L., Györfi, L. and Lugosi, G.: A Probabilistic Theory of Pattern Recognition, Springer-Verlag, Berlin (1996).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bermejo, S., Cabestany, J. Finite-Sample Convergence Properties of the LVQ1 Algorithm and the Batch LVQ1 Algorithm. Neural Processing Letters 13, 135–157 (2001). https://doi.org/10.1023/A:1011328322315

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1011328322315

Navigation