Rejection Strategies for Learning Vector Quantization - A Comparison of Probabilistic and Deterministic Approaches

11Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this contribution, we focus on reject options for prototype-based classifiers, and we present a comparison of reject options based on statistical models for prototype-based classification as compared to alternatives which are motivated by simple geometric principles. We compare the behavior of generative models such as Gaussian mixture models and discriminative ones to results from robust soft learning vector quantization. It turns out that (i) reject options based on simple geometric show a comparable quality as compared to reject options based on statistical approaches. This behavior of the simple options offers a nice alternative towards making a probabilistic modeling and allowing a more fine-grained control of the size of the remaining data in many settings. It is shown that (ii) discriminative models provide a better classification accuracy also when combined with reject strategies based on probabilistic models as compared to generative ones. © Springer International Publishing Switzerland 2014.

Cite

CITATION STYLE

APA

Fischer, L., Nebel, D., Villmann, T., Hammer, B., & Wersing, H. (2014). Rejection Strategies for Learning Vector Quantization - A Comparison of Probabilistic and Deterministic Approaches. In Advances in Intelligent Systems and Computing (Vol. 295, pp. 109–118). Springer Verlag. https://doi.org/10.1007/978-3-319-07695-9_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free