Non-Euclidean dissimilarity measures can be well suited for building representation spaces that are more beneficial for pattern classification systems than the related Euclidean ones [1,2]. A non-Euclidean representation space is however cumbersome for training classifiers, as many statistical techniques rely on the Euclidean inner product that is missing there. In this paper we report our findings on the applicability of corrections that transform a non-Euclidean representation space into a Euclidean one in which similar or better classifiers can be trained. In a case-study based on four principally different classifiers we find out that standard correction procedures fail to construct an appropriate Euclidean space, equivalent to the original non-Euclidean one. © 2008 Springer Berlin Heidelberg.
CITATION STYLE
Duin, R. P. W., Pȩkalska, E., Harol, A., Lee, W. J., & Bunke, H. (2008). On Euclidean corrections for non-Euclidean dissimilarities. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5342 LNCS, pp. 551–561). https://doi.org/10.1007/978-3-540-89689-0_59
Mendeley helps you to discover research relevant for your work.