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)

• 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)
• Consensus hashing
• Multiple feature kernel hashing for large-scale visual search
• Set-based approximate approach for lossless graph summarization
• The Johnson-Lindenstrauss lemma almost characterizes Hilbert space, but not quite
• Statistical mechanics of complex neural systems and high dimensional data
• Faster compression methods for a weighted graph using locality sensitive hashing
• GLDH: toward more efficient global low-density locality-sensitive hashing for high dimensions
• Beyond locality-sensitive hashing
• Representation and coding of signal geometry
• On the Distortion of Locality Sensitive Hashing
• Approximate range searching in higher dimension
• SALSAS: sub-linear active learning strategy with approximate \(k\)-NN search
• An Improved Algorithm Finding Nearest Neighbor Using Kd-trees
• Lattice-based locality sensitive hashing is optimal
• Lower bounds on performance of metric tree indexing schemes for exact similarity search in high dimensions
• Robust proximity search for balls using sublinear space
• Approximate nearest neighbor search for \(\ell_{p}\)-spaces \((2 < p < \infty)\) via embeddings
• New Analysis on Sparse Solutions to Random Standard Quadratic Optimization Problems and Extensions
• Approximate \(k\)-closest-pairs in large high-dimensional data sets
• A locality-sensitive hash for real vectors
• A non-gradient method for solving elliptic partial differential equations with deep neural networks
• On variants of the Johnson–Lindenstrauss lemma
• Similarity, kernels, and the fundamental constraints on cognition
• Approximate nearest neighbor: towards removing the curse of dimensionality
• A simple proof of the restricted isometry property for random matrices
• Fast dimension reduction using Rademacher series on dual BCH codes
• Nearest-neighbor-preserving embeddings
• Two-dimensional random projection
• Coding of image feature descriptors for distributed rate-efficient visual correspondences
• Dimensionality reduction with subgaussian matrices: a unified theory
• Kernels as features: on kernels, margins, and low-dimensional mappings
• A variant of the Johnson-Lindenstrauss lemma for circulant matrices
• New analysis of manifold embeddings and signal recovery from compressive measurements
• Algorithmic paradigms for stability-based cluster validity and model selection statistical methods, with applications to microarray data analysis
• Randomized numerical linear algebra: Foundations and algorithms
• Diffusion wavelets
• Chromatic nearest neighbor searching: A query sensitive approach
• Database Theory - ICDT 2005
• Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
• Frequent-itemset mining using locality-sensitive hashing
• Title not available (Why is that?)
• Random projections for quadratic programs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Biomechanical simulation and control of hands and tendinous systems
• Robust property-preserving hash functions for Hamming distance and more
• A survey on unsupervised outlier detection in high‐dimensional numerical data
• Proximity-preserving labeling schemes
• Property-preserving hash functions for Hamming distance from standard assumptions
• Fast approximate \(k\)NN graph construction for high dimensional data via recursive Lanczos bisection
• Binary vectors for fast distance and similarity estimation
• Decomposable algorithms for nearest neighbor computing
• Vector representations for efficient comparison and search for similar strings
• An algorithmic theory of learning: Robust concepts and random projection
• Fast and RIP-optimal transforms

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)