On Distance Mapping from non-Euclidean Spaces to Euclidean Spaces

Wei Ren, Yoan Miche, Ian Oliver, Silke Holtmanns, Kaj-Mikael Björk, Amaury Lendasse

Forskningsoutput: Kapitel i bok/rapport/konferenshandlingKonferensbidragVetenskapligPeer review


Most Machine Learning techniques traditionally rely on some forms of Euclidean Distances, computed in a Euclidean space (typically R d). In more general cases, data might not live in a classical Euclidean space, and it can be difficult (or impossible) to find a direct representation for it in R d. Therefore, distance mapping from a non-Euclidean space to a canonical Euclidean space is essentially needed. We present in this paper a possible distance-mapping algorithm, such that the behavior of the pairwise distances in the mapped Euclidean space is preserved, compared to those in the original non-Euclidean space. Experimental results of the mapping algorithm are discussed on a specific type of datasets made of timestamped GPS coordinates. The comparison of the original and mapped distances, as well as the standard errors of the mapped distributions, are discussed.
Titel på värdpublikationCD-MAKE 2017: Machine Learning and Knowledge Extraction
Antal sidor11
ISBN (tryckt)978-3-319-66807-9
ISBN (elektroniskt)978-3-319-66808-6
StatusPublicerad - 24.08.2017
MoE-publikationstypA4 Artikel i en konferenspublikation
Evenemang2017 International Cross-Domain Conference for Machine Learning and Knowledge Extraction - Reggio, Italien
Varaktighet: 29.08.201701.09.2017


NamnLecture Notes in Computer Science (LNCS)


  • 512 Företagsekonomi


Fördjupa i forskningsämnen för ”On Distance Mapping from non-Euclidean Spaces to Euclidean Spaces”. Tillsammans bildar de ett unikt fingeravtryck.

Citera det här