AI Chat AI Image Generator AI Video Text to Speech

Similarity Problems in High Dimensions

06/11/2019

∙

by Johan von Tangen Sivertsen, et al.

∙

∙

The main contribution of this dissertation is the introduction of new or improved approximation algorithms and data structures for several similarity search problems. We examine the furthest neighbor query, the annulus query, distance sensitive membership, nearest neighbor preserving embeddings and set similarity queries in the large-scale, high-dimensional setting.

research

∙ 12/06/2018

Confirmation Sampling for Exact Nearest Neighbor Search

Locality-sensitive hashing (LSH), introduced by Indyk and Motwani in STO...

0 Tobias Christiani, et al. ∙

research

∙ 08/05/2023

DeDrift: Robust Similarity Search under Content Drift

The statistical distribution of content uploaded and searched on media s...

0 Dmitry Baranchuk, et al. ∙

research

∙ 06/22/2021

Practical Near Neighbor Search via Group Testing

We present a new algorithm for the approximate near neighbor problem tha...

0 Joshua Engels, et al. ∙

research

∙ 08/02/2023

Rethinking Similarity Search: Embracing Smarter Mechanisms over Smarter Data

In this vision paper, we propose a shift in perspective for improving th...

0 Renzhi Wu, et al. ∙

research

∙ 03/20/2017

Fast Spectral Ranking for Similarity Search

Despite the success of deep learning on representing images for particul...

0 Ahmet Iscen, et al. ∙

research

∙ 08/07/2023

Semantic Equivalence of e-Commerce Queries

Search query variation poses a challenge in e-commerce search, as equiva...

0 Aritra Mandal, et al. ∙

research

∙ 03/08/2021

Nearest Neighbor Search Under Uncertainty

Nearest Neighbor Search (NNS) is a central task in knowledge representat...

0 Blake Mason, et al. ∙