Efficient Kernelized Prototype Based Classification

FM Schleif, T Villmann, B Hammer, Petra Schneider

    Research output: Contribution to journalArticle

    28 Citations (Scopus)


    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.
    Original languageEnglish
    Pages (from-to)443-457
    Number of pages15
    JournalInternational Journal of Neural Systems
    Issue number6
    Publication statusPublished - 1 Dec 2011


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


    Dive into the research topics of 'Efficient Kernelized Prototype Based Classification'. Together they form a unique fingerprint.

    Cite this