A randomized approximate nearest neighbors algorithm
From MaRDI portal
Publication:1948601
DOI10.1016/J.ACHA.2012.07.003zbMATH Open1262.68188OpenAlexW2069585704MaRDI QIDQ1948601FDOQ1948601
Authors: Peter 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
Recommendations
Online algorithms; streaming algorithms (68W27) Data structures (68P05) Searching and sorting (68P10) Approximation algorithms (68W25)
Cited In (12)
- A class of Laplacian multiwavelets bases for high-dimensional data
- Graph-theoretic algorithms for Kolmogorov operators: approximating solutions and their gradients in elliptic and parabolic problems on manifolds
- Nearest neighbor sampling of point sets using rays
- ASKIT: an efficient, parallel library for high-dimensional kernel summations
- Detecting low-rank clusters via random sampling
- Index structures for fast similarity search for real vectors. II
- Detecting the large entries of a sparse covariance matrix in sub-quadratic time
- Spatiotemporal pattern extraction by spectral analysis of vector-valued observables
- Title not available (Why is that?)
- Title not available (Why is that?)
- Analysis of an adaptive algorithm to find the two nearest neighbors
- Approximate nearest neighbors and sequence comparison with block operations
This page was built for publication: A randomized approximate nearest neighbors algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1948601)