A conformal classifier for dissimilarity data

6Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Current classification algorithms focus on vectorial data, given in euclidean or kernel spaces. Many real world data, like biological sequences are not vectorial and often non-euclidean, given by (dis-)similarities only, requesting for efficient and interpretable models. Current classifiers for such data require complex transformations and provide only crisp classification without any measure of confidence, which is a standard requirement in the life sciences. In this paper we propose a prototype-based conformal classifier for dissimilarity data. It effectively deals with dissimilarity data. The model complexity is automatically adjusted and confidence measures are provided. In experiments on dissimilarity data we investigate the effectiveness with respect to accuracy and model complexity in comparison to different state of the art classifiers. © 2012 IFIP International Federation for Information Processing.

Cite

CITATION STYLE

APA

Schleif, F. M., Zhu, X., & Hammer, B. (2012). A conformal classifier for dissimilarity data. In IFIP Advances in Information and Communication Technology (Vol. 382 AICT, pp. 234–243). Springer New York LLC. https://doi.org/10.1007/978-3-642-33412-2_24

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