Kernel functions based on triplet comparisons

by   Matthäus Kleindessner, et al.

Given only information in the form of similarity triplets "Object A is more similar to object B than to object C" about a data set, we propose two ways of defining a kernel function on the data set. While previous approaches construct a low-dimensional Euclidean embedding of the data set that reflects the given similarity triplets, we aim at defining kernel functions that correspond to high-dimensional embeddings. These kernel functions can subsequently be used to apply any kernel method to the data set.


page 8

page 16


Dimension Independent Data Sets Approximation and Applications to Classification

We revisit the classical kernel method of approximation/interpolation th...

Similarity Search Over Graphs Using Localized Spectral Analysis

This paper provides a new similarity detection algorithm. Given an input...

Bounded Statistics

If two probability density functions (PDFs) have values for their first ...

Measuring Place Function Similarity with Trajectory Embedding

Modeling place functions from a computational perspective is a prevalent...

Low-dimensional Data Embedding via Robust Ranking

We describe a new method called t-ETE for finding a low-dimensional embe...

Improving Stochastic Neighbour Embedding fundamentally with a well-defined data-dependent kernel

We identify a fundamental issue in the popular Stochastic Neighbour Embe...

Please sign up or login with your details

Forgot password? Click here to reset