Metric learning in dissimilarity space for improved nearest neighbor performance

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

This article is free to access.

Abstract

Showing the nearest neighbor is a useful explanation for the result of an automatic classification. Given, expert defined, distance measures may be improved on the basis of a training set. We study several proposals to optimize such measures for nearest neighbor classification, explicitly including non-Euclidean measures. Some of them may directly improve the distance measure, others may construct a dissimilarity space for which the Euclidean distances show significantly better performances. Results are application dependent and raise the question what characteristics of the original distance measures influence the possibilities of metric learning. © 2014 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Duin, R. P. W., Bicego, M., Orozco-Alzate, M., Kim, S. W., & Loog, M. (2014). Metric learning in dissimilarity space for improved nearest neighbor performance. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8621 LNCS, pp. 183–192). Springer Verlag. https://doi.org/10.1007/978-3-662-44415-3_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