On Distance Mapping from non-Euclidean Spaces to Euclidean Spaces - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2017

On Distance Mapping from non-Euclidean Spaces to Euclidean Spaces


Most Machine Learning techniques traditionally rely on some forms of Euclidean Distances, computed in a Euclidean space (typically $$\mathbb {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 $$\mathbb {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.
Fichier principal
Vignette du fichier
456304_1_En_1_Chapter.pdf (244.49 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01677143 , version 1 (08-01-2018)





Wei Ren, Yoan Miche, Ian Oliver, Silke Holtmanns, Kaj-Mikael Björk, et al.. On Distance Mapping from non-Euclidean Spaces to Euclidean Spaces. 1st International Cross-Domain Conference for Machine Learning and Knowledge Extraction (CD-MAKE), Aug 2017, Reggio, Italy. pp.3-13, ⟨10.1007/978-3-319-66808-6_1⟩. ⟨hal-01677143⟩
101 View
172 Download



Gmail Facebook X LinkedIn More