Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
From MaRDI portal
Recommendations
Cited in
(65)- Fast dimension reduction using Rademacher series on dual BCH codes
- Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
- A Gaussian small deviation inequality for convex functions
- Efficient clustering on Riemannian manifolds: a kernelised random projection approach
- Approximate nearest neighbor search for \(\ell_{p}\)-spaces \((2 < p < \infty)\) via embeddings
- Lower bounds on performance of metric tree indexing schemes for exact similarity search in high dimensions
- GLDH: toward more efficient global low-density locality-sensitive hashing for high dimensions
- Instability results for Euclidean distance, nearest neighbor search on high dimensional Gaussian data
- Random-walk based approximate \(k\)-nearest neighbors algorithm for diffusion state distance
- Exploiting pseudo-locality of interchange distance
- Exploiting lower bounds to accelerate approximate nearest neighbor search on high-dimensional data
- Dimension reduction by random hyperplane tessellations
- An \(O(\log n)\) query time algorithm for reducing \(\varepsilon \)-NN to \((c,r)\)-NN
- Index structures for fast similarity search for symbol strings
- Binary vectors for fast distance and similarity estimation
- The Johnson-Lindenstrauss lemma almost characterizes Hilbert space, but not quite
- Longest common substring with approximately \(k\) mismatches
- Approximate range searching in higher dimension
- Lower bounds for predecessor searching in the cell probe model
- Is the \(k\)-NN classifier in high dimensions affected by the curse of dimensionality?
- Similarity search in high-dimensional vector spaces (Thesis, ETH Zürich 2000)
- Finding correlations in subquadratic time, with applications to learning parities and the closest pair problem
- Parallel algorithms for nearest neighbor search problems in high dimensions
- Approximate nearest neighbor search for low-dimensional queries
- Computing (and Life) Is All about Tradeoffs
- A combinatorial algorithm for all-pairs shortest paths in directed vertex-weighted graphs with applications to disc graphs
- Approximate nearest neighbor: towards removing the curse of dimensionality
- A Heterogeneous High-Dimensional Approximate Nearest Neighbor Algorithm
- scientific article; zbMATH DE number 2086332 (Why is no real title available?)
- The Andoni-Krauthgamer-Razenshteyn characterization of sketchable norms fails for sketchable metrics
- A unified approach to approximate proximity searching
- Spherical LSH for Approximate Nearest Neighbor Search on Unit Hypersphere
- scientific article; zbMATH DE number 1947041 (Why is no real title available?)
- scientific article; zbMATH DE number 2017877 (Why is no real title available?)
- scientific article; zbMATH DE number 2065611 (Why is no real title available?)
- Indexability, concentration, and VC theory
- scientific article; zbMATH DE number 1753922 (Why is no real title available?)
- scientific article; zbMATH DE number 1775450 (Why is no real title available?)
- scientific article; zbMATH DE number 1775451 (Why is no real title available?)
- Sketching and embedding are equivalent for norms
- Proximity in the age of distraction: robust approximate nearest neighbor search
- Efficient Nearest Neighbors via Robust Sparse Hashing
- A c-approximate nearest neighbor query algorithm based on learning for high-dimensional data
- Polylogarithmic approximation for edit distance and the asymmetric query complexity
- scientific article; zbMATH DE number 1445325 (Why is no real title available?)
- Approximate near neighbors for general symmetric norms
- Approximate sparse linear regression
- One-sided error communication complexity of gap Hamming distance
- Optimal (Euclidean) Metric Compression
- Two Party Distribution Testing: Communication and Security
- scientific article; zbMATH DE number 7204982 (Why is no real title available?)
- Approximate nearest neighbor search in high dimensions
- Approximate Nearest Neighbor Searching with Non-Euclidean and Weighted Distances
- Approximate nearest line search in high dimensions
- scientific article; zbMATH DE number 6783438 (Why is no real title available?)
- Comparison of metric spectral gaps
- A locality-sensitive hash for real vectors
- Cell-probe lower bounds for the partial match problem
- On approximate near-neighbors search under the (continuous) Fréchet distance in higher dimensions
- scientific article; zbMATH DE number 7758348 (Why is no real title available?)
- Nearly optimal property preserving hashing
- (1+)-ANN data structure for curves via subspaces of bounded doubling dimension
- Exploiting pseudo-locality of interchange distance
- Efficient nearest neighbors methods for support vector machines in high dimensional feature spaces
- A strong lower bound for approximate nearest neighbor searching
This page was built for publication: Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4507359)
