Prototype-based classification of dissimilarity data

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

Abstract

Unlike many black-box algorithms in machine learning, prototype-based models offer an intuitive interface to given data sets, since prototypes can directly be inspected by experts in the field. Most techniques rely on Euclidean vectors such that their suitability for complex scenarios is limited. Recently, several unsupervised approaches have successfully been extended to general, possibly non-Euclidean data characterized by pairwise dissimilarities. In this paper, we shortly review a general approach to extend unsupervised prototype-based techniques to dissimilarities, and we transfer this approach to supervised prototype-based classification for general dissimilarity data. In particular, a new supervised prototype-based classification technique for dissimilarity data is proposed. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Hammer, B., Mokbel, B., Schleif, F. M., & Zhu, X. (2011). Prototype-based classification of dissimilarity data. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7014 LNCS, pp. 185–197). https://doi.org/10.1007/978-3-642-24800-9_19

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