Log In Sign Up

Elliptical Ordinal Embedding

by   Aissatou Diallo, et al.

Ordinal embedding aims at finding a low dimensional representation of objects from a set of constraints of the form "item j is closer to item i than item k". Typically, each object is mapped onto a point vector in a low dimensional metric space. We argue that mapping to a density instead of a point vector provides some interesting advantages, including an inherent reflection of the uncertainty about the representation itself and its relative location in the space. Indeed, in this paper, we propose to embed each object as a Gaussian distribution. We investigate the ability of these embeddings to capture the underlying structure of the data while satisfying the constraints, and explore properties of the representation. Experiments on synthetic and real-world datasets showcase the advantages of our approach. In addition, we illustrate the merit of modelling uncertainty, which enriches the visual perception of the mapped objects in the space.


page 7

page 11

page 13

page 14


Word Representations via Gaussian Embedding

Current work in lexical distributed representations maps each word to a ...

Uncertainty Estimates for Ordinal Embeddings

To investigate objects without a describable notion of distance, one can...

Analysis of Multibeam SONAR Data using Dissimilarity Representations

This paper considers the problem of low-dimensional visualisation of ver...

Landmark Ordinal Embedding

In this paper, we aim to learn a low-dimensional Euclidean representatio...

Simultaneous Preference and Metric Learning from Paired Comparisons

A popular model of preference in the context of recommendation systems i...

Factoring out prior knowledge from low-dimensional embeddings

Low-dimensional embedding techniques such as tSNE and UMAP allow visuali...

Revealing the Basis: Ordinal Embedding Through Geometry

Ordinal Embedding places n objects into R^d based on comparisons such as...