Mathematical Models for Local Sensing Hashes

11/16/2021
by   Li Wang, et al.
0

As data volumes continue to grow, searches in data are becoming increasingly time-consuming. Classical index structures for neighbor search are no longer sustainable due to the "curse of dimensionality". Instead, approximated index structures offer a good opportunity to significantly accelerate the neighbor search for clustering and outlier detection and to have the lowest possible error rate in the results of the algorithms. Local sensing hashes is one of those. We indicate directions to mathematically model the properties of it.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/11/2021

Towards a Model for LSH

As data volumes continue to grow, clustering and outlier detection algor...
research
12/02/2019

GGNN: Graph-based GPU Nearest Neighbor Search

Approximate nearest neighbor (ANN) search in high dimensions is an integ...
research
04/07/2021

Graph Reordering for Cache-Efficient Near Neighbor Search

Graph search is one of the most successful algorithmic trends in near ne...
research
12/15/2019

Progressive Neural Index Search for Database System

In database systems, index is the key component to support efficient sea...
research
01/22/2019

Just-in-Time Index Compilation

Creating or modifying a primary index is a time-consuming process, as th...
research
05/26/2023

RT-kNNS Unbound: Using RT Cores to Accelerate Unrestricted Neighbor Search

The problem of identifying the k-Nearest Neighbors (kNNS) of a point has...
research
05/26/2021

On the Exploitation of Neuroevolutionary Information: Analyzing the Past for a More Efficient Future

Neuroevolutionary algorithms, automatic searches of neural network struc...

Please sign up or login with your details

Forgot password? Click here to reset