On not making dissimilarities euclidean

Elzbieta Pekalska, Elzbieta Pçkalska, Robert P W Duin, Simon Günter, Horst Bunke

    Research output: Chapter in Book/Conference proceedingConference contribution

    Abstract

    Non-metric dissimilarity measures may arise in practice e.g. when objects represented by sensory measurements or by structural descriptions are compared. It is an open issue whether such non-metric measures should be corrected in some way to be metric or even Euclidean. The reason for such corrections is the fact that pairwise metric distances are interpreted in metric spaces, while Euclidean distances can be embedded into Euclidean spaces. Hence, traditional learning methods can be used. The k-nearest neighbor rule is usually applied to dissimilarities. In our earlier study [12,13], we proposed some alternative approaches to general dissimilarity representations (DRs). They rely either on an embedding to a pseudo-Euclidean space and building classifiers there or on constructing classifiers on the representation directly. In this paper, we investigate ways of correcting DRs to make them more Euclidean (metric) either by adding a proper constant or by some concave transformations. Classification experiments conducted on five dissimilarity data sets indicate that non-metric dissimilarity measures can be more beneficial than their corrected Euclidean or metric counterparts. The discriminating power of the measure itself is more important than its Euclidean (or metric) properties. © Springer-Verlag 2004.
    Original languageEnglish
    Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|Lect. Notes Comput. Sci.
    PublisherSpringer Nature
    Pages1145-1154
    Number of pages9
    Volume3138
    Publication statusPublished - 2004
    EventStructural, Syntactic, and Statistical Pattern Recognition, Joint IAPR International Workshops, SSPR 2004 and SPR 2004, Lisbon, Portugal, August 18-20, 2004 Proceedings -
    Duration: 1 Jan 1824 → …
    http://dblp.uni-trier.de/db/conf/sspr/sspr2004.html#PekalskaDGB04http://dblp.uni-trier.de/rec/bibtex/conf/sspr/PekalskaDGB04.xmlhttp://dblp.uni-trier.de/rec/bibtex/conf/sspr/PekalskaDGB04

    Publication series

    NameLecture Notes in Computer Science

    Conference

    ConferenceStructural, Syntactic, and Statistical Pattern Recognition, Joint IAPR International Workshops, SSPR 2004 and SPR 2004, Lisbon, Portugal, August 18-20, 2004 Proceedings
    Period1/01/24 → …
    Internet address

    Fingerprint

    Dive into the research topics of 'On not making dissimilarities euclidean'. Together they form a unique fingerprint.

    Cite this