Sublinear data structures for nearest neighbor in ultra high dimensions
From MaRDI portal
Cites work
- A Functional Approach to Data Structures and Its Use in Multidimensional Searching
- Almost tight approximation algorithms for explainable clustering
- Approximate near neighbors for general symmetric norms
- Approximate range searching
- Approximate range searching in higher dimension
- Approximate range searching: The absolute model
- Beyond locality-sensitive hashing
- Dimensionality reduction for k-means clustering and low rank approximation
- Explainable k -means: don’t be greedy, plant bigger trees!
- Extensions of Lipschitz mappings into a Hilbert space
- Filtering Search: A New Approach to Query-Answering
- Finding nearest neighbors in growth-restricted metrics
- scientific article; zbMATH DE number 1775450 (Why is no real title available?)
- scientific article; zbMATH DE number 6469222 (Why is no real title available?)
- Multidimensional divide-and-conquer
- Near-optimal explainable k-means for all dimensions
- Nearest neighbor queries in metric spaces
- Optimal data-dependent hashing for approximate near neighbors
- Priority Search Trees
- Randomized Dimensionality Reduction for <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula>-Means Clustering
- Sorting and selection with imprecise comparisons
- Stable distributions, pseudorandom generators, embeddings, and data stream computation
- The price of explainability for clustering
This page was built for publication: Sublinear data structures for nearest neighbor in ultra high dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7312704)
