Application of the cross entropy method to the GLVQ algorithm

  • Authors:
  • Abderrahmane Boubezoul;Sébastien Paris;Mustapha Ouladsine

  • Affiliations:
  • Laboratory of Sciences of Information's and of System, LSIS UMR6168, University Paul Cézanne, Aix-Marseille III Av Escadrille de Normandie Niemen, 13397 Marseille Cedex 20, France;Laboratory of Sciences of Information's and of System, LSIS UMR6168, University Paul Cézanne, Aix-Marseille III Av Escadrille de Normandie Niemen, 13397 Marseille Cedex 20, France;Laboratory of Sciences of Information's and of System, LSIS UMR6168, University Paul Cézanne, Aix-Marseille III Av Escadrille de Normandie Niemen, 13397 Marseille Cedex 20, France

  • Venue:
  • Pattern Recognition
  • Year:
  • 2008

Quantified Score

Hi-index 0.01

Visualization

Abstract

This paper discusses an alternative approach to parameter optimization of well-known prototype-based learning algorithms (minimizing an objective function via gradient search). The proposed approach considers a stochastic optimization called the cross entropy method (CE method). The CE method is used to tackle efficiently the initialization sensitiveness problem associated with the original generalized learning vector quantization (GLVQ) algorithm and its variants. Results presented in this paper indicate that the CE method can be successfully applied to this kind of problem on real-world data sets. As far as known by the authors, it is the first use of the CE method in prototype-based learning.