scientific article; zbMATH DE number 1775450

zbMATH Open1029.68541MaRDI QIDQ4542583FDOQ4542583

Authors: Piotr Indyk, Rajeev Motwani 

Publication date: 1 August 2002

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 437552
• Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
• scientific article; zbMATH DE number 1559575
• Approximate nearest neighbor: towards removing the curse of dimensionality
• An optimal algorithm for approximate nearest neighbor searching fixed dimensions

zbMATH Keywords

locality-sensitive hashingnearest neighbor problem

Mathematics Subject Classification ID

Searching and sorting (68P10)

Cited In (only showing first 100 items - show all)

• Fast spectral analysis for approximate nearest neighbor search
• On binary embedding using circulant matrices
• Title not available (Why is that?)
• Sharing hash codes for multiple purposes
• The complexity of LSH feasibility
• Near-neighbor preserving dimension reduction via coverings for doubling subsets of \(\ell_1\)
• On closest pair in Euclidean metric: monochromatic is as hard as bichromatic
• Filtering multi-set tree: data structure for flexible matching using multi-track data
• Permuted pattern matching algorithms on multi-track strings
• Approximate hashing for bioinformatics
• Sequence graph transform (SGT): a feature embedding function for sequence data mining
• Approximation and inapproximability results for maximum clique of disc graphs in high dimensions
• Randomized large distortion dimension reduction
• Random-walk based approximate \(k\)-nearest neighbors algorithm for diffusion state distance
• Efficient binary embedding of categorical data using BinSketch
• On recovery guarantees for one-bit compressed sensing on manifolds
• Learning in compressed space
• Exact \(L_{\infty}\) nearest neighbor search in high dimensions
• Nearly optimal property preserving hashing
• Robust frequent directions with application in online learning
• Optimal bounds for Johnson-Lindenstrauss transformations
• Exploiting pseudo-locality of interchange distance
• Locality sensitive hashing with extended differential privacy
• How to find ternary LWE keys using locality sensitive hashing
• Index-based, high-dimensional, cosine threshold querying with optimality guarantees
• ForestDSH: a universal hash design for discrete probability distributions
• Correlations between random projections and the bivariate normal
• Sketching and embedding are equivalent for norms
• Towards Practical Large-Scale Randomized Iterative Least Squares Solvers through Uncertainty Quantification
• An Implicit Representation and Iterative Solution of Randomly Sketched Linear Systems
• Partitioning well-clustered graphs: spectral clustering works!
• Graph-based time-space trade-offs for approximate near neighbors
• Dense neighborhoods on affinity graph
• Adversarially robust property-preserving hash functions
• Anchor-based self-ensembling for semi-supervised deep pairwise hashing
• Weakly-supervised semantic guided hashing for social image retrieval
• Title not available (Why is that?)
• Title not available (Why is that?)
• An \(O(\log n)\) query time algorithm for reducing \(\varepsilon \)-NN to \((c,r)\)-NN
• Bayesian random projection-based signal detection for Gaussian scale space random fields
• Health policyholder clustering using medical consumption. A useful tool for targeting prevention plans
• Title not available (Why is that?)
• Diverse near neighbor problem
• Theoretical analysis of cross-validation for estimating the risk of the \(k\)-nearest neighbor classifier
• I/O-efficient similarity join
• I/O-efficient similarity join
• Manifold Learning and Nonlinear Homogenization
• Near-Neighbor Preserving Dimension Reduction for Doubling Subsets of L1
• The Closest Pair Problem under the Hamming Metric
• A simple test for zero multiple correlation coefficient in high-dimensional normal data using random projection
• A new coding-based algorithm for finding closest pair of vectors
• LSH-preserving functions and their applications
• Explicit correlation amplifiers for finding outlier correlations in deterministic subquadratic time
• A distance based clustering method for arbitrary shaped clusters in large datasets
• Low-quality dimension reduction and high-dimensional approximate nearest neighbor
• Identifying an unknown code by partial Gaussian elimination
• Probably correct \(k\)-nearest neighbor search in high dimensions
• Randomized embeddings with slack and high-dimensional approximate nearest neighbor
• On approximate nearest neighbors under \(l_\infty\) norm
• Tighter lower bounds for nearest neighbor search and related problems in the cell probe model
• Title not available (Why is that?)
• Cell-probe lower bounds for the partial match problem
• A strong lower bound for approximate nearest neighbor searching
• SONIC: streaming overlapping community detection
• Lattice Sieving via Quantum Random Walks
• Approximate maximum weight branchings
• Sieving for closest lattice vectors (with preprocessing)
• Title not available (Why is that?)
• Improved maximum inner product search with better theoretical guarantee using randomized partition trees
• Approximate Bregman near neighbors in sublinear time: beyond the triangle inequality
• Unique entity estimation with application to the Syrian conflict
• Automata, Languages and Programming
• Approximate \(k\)-flat nearest neighbor search
• Efficient Associative Computation with Discrete Synapses
• On the behavior of intrinsically high-dimensional spaces: distances, direct and reverse nearest neighbors, and hubness
• Proximity in the age of distraction: robust approximate nearest neighbor search
• An algorithmic theory of learning: robust concepts and random projection
• Fast cross-polytope locality-sensitive hashing
• The distortion of locality sensitive hashing
• Hypercube LSH for approximate near neighbors
• Fast algorithm for recovering the true solution with fixed weight of a system of linear Boolean equations with noised right-hand side
• Why locality sensitive hashing works: a practical perspective
• De-anonymization of heterogeneous random graphs in quasilinear time
• Viewpoint independent object recognition in cluttered scenes exploiting ray-triangle intersection and SIFT algorithms
• Nearest neighbour group-based classification
• Fuzzy \(c\)-means and cluster ensemble with random projection for big data clustering
• Multiple Bayesian discriminant functions for high-dimensional massive data classification
• Distance geometry and data science
• A mesh partitioning algorithm for preserving spatial locality in arbitrary geometries
• Sampling hyperspheres via extreme value theory: implications for measuring attractor dimensions
• Investigation of accelerated search for close text sequences with the help of vector representations
• Generalised kernel weighted fuzzy c-means clustering algorithm with local information
• Faster sieving for shortest lattice vectors using spherical locality-sensitive hashing
• Secure sampling with sublinear communication
• An asymptotic thin shell condition and large deviations for random multidimensional projections
• Learning Binary Hash Codes for Large-Scale Image Search
• Title not available (Why is that?)
• Finding correlations in subquadratic time, with applications to learning parities and the closest pair problem
• Locality-Sensitive Hashing Without False Negatives for $$l_p$$
• Optimal Lower Bounds for Locality-Sensitive Hashing (Except When q is Tiny)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4542583)