A randomized approximate nearest neighbors algorithm

DOI10.1016/j.acha.2012.07.003zbMath1262.68188OpenAlexW2069585704MaRDI QIDQ1948601

Peter W. Jones, Andrei Osipov, Vladimir Rokhlin

Publication date: 24 April 2013

Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.acha.2012.07.003

zbMATH Keywords

randomized algorithmsapproximate nearest neighborsfast random rotations

Mathematics Subject Classification ID

Searching and sorting (68P10) Data structures (68P05) Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)

Related Items (8)

Detecting low-rank clusters via random sampling ⋮ Detecting the large entries of a sparse covariance matrix in sub-quadratic time ⋮ Index structures for fast similarity search for real vectors. II ⋮ ASKIT: An Efficient, Parallel Library for High-Dimensional Kernel Summations ⋮ Spatiotemporal pattern extraction by spectral analysis of vector-valued observables ⋮ A class of Laplacian multiwavelets bases for high-dimensional data ⋮ Unnamed Item ⋮ Graph-theoretic algorithms for Kolmogorov operators: approximating solutions and their gradients in elliptic and parabolic problems on manifolds

This page was built for publication: A randomized approximate nearest neighbors algorithm