Efficient Kernelized Prototype Based Classification

Research output: Contribution to journalArticle

Authors

Abstract

Prototype based classifiers are effective algorithms in modeling classification problems and have been applied in multiple domains. While many supervised learning algorithms have been successfully extended to kernels to improve the discrimination power by means of the kernel concept, prototype based classifiers are typically still used with Euclidean distance measures. Kernelized variants of prototype based classifiers are currently too complex to be applied for larger data sets. Here we propose an extension of Kernelized Generalized Learning Vector Quantization (KGLVQ) employing a sparsity and approximation technique to reduce the learning complexity. We provide generalization error bounds and experimental results on real world data, showing that the extended approach is comparable to SVM on different public data.

Details

Original languageEnglish
Pages (from-to)443-457
Number of pages15
JournalInternational Journal of Neural Systems
Volume21
Issue number6
Publication statusPublished - 1 Dec 2011

Keywords

  • vector quantization, interpretable models, Prototype learning, classification, kernel