Optimized Learning Vector Quantization Classifier with an Adaptive Euclidean Distance

Authors:
Renata M. Souza;Telmo M. Silva Filho
Affiliations:
Centro de Informatica - CIn / UFPE, Recife, Brasil 50740-540;Centro de Informatica - CIn / UFPE, Recife, Brasil 50740-540
Venue:
ICANN '09 Proceedings of the 19th International Conference on Artificial Neural Networks: Part I
Year:
2009

Citing 6
Cited 0

Algorithms for clustering data

Algorithms for clustering data
Self-Organizing Maps

Self-Organizing Maps
Generalized relevance learning vector quantization

Neural Networks - New developments in self-organizing maps
Pattern Classification (2nd Edition)

Pattern Classification (2nd Edition)
Learning vector quantization: The dynamics of winner-takes-all algorithms

Neurocomputing
Letters: An LVQ-based adaptive algorithm for learning from very small codebooks

Neurocomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a classifier based on Optimized Learning Vector Quantization (optimized version of the basic LVQ1) and an adaptive Euclidean distance. The classifier furnishes discriminative class regions of the input data set that are represented by prototypes. In order to compare prototypes and patterns, the classifier uses an adaptive Euclidean distance that changes at each iteration but is the same for all the class regions. Experiments with real and synthetic data sets demonstrate the usefulness of this classifier.