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)

• 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
• An optimal algorithm for approximate nearest neighbor searching fixed dimensions
• Random Projection RBF Nets for Multidimensional Density Estimation
• Compressed labeling on distilled labelsets for multi-label learning
• Title not available (Why is that?)
• Limitations on quantum dimensionality reduction
• Indexability, concentration, and VC theory
• Title not available (Why is that?)
• Almost Optimal Explicit Johnson-Lindenstrauss Families
• Similarity based deduplication with small data chunks
• Approximate closest-point queries in high dimensions
• Nearest neighbors search using point location in balls with applications to approximate Voronoi decompositions
• On the distance concentration awareness of certain data reduction techniques
• Title not available (Why is that?)
• Geometric component analysis and its applications to data analysis
• On clustering induced Voronoi diagrams
• Nonparametric link prediction in large scale dynamic networks
• A randomized approximate nearest neighbors algorithm
• Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
• On locality-sensitive orderings and their applications
• Iterative denoising
• 3D rectangulations and geometric matrix multiplication
• An elementary proof of a theorem of Johnson and Lindenstrauss
• Approximating Minimization Diagrams and Generalized Proximity Search
• Lower bounds for predecessor searching in the cell probe model
• Locality-sensitive hashing scheme based on \(p\)-stable distributions
• Vector data transformation using random binary matrices
• Acceleration of randomized Kaczmarz method via the Johnson-Lindenstrauss lemma
• Fast construction of nets in low dimensional metrics, and their applications
• Group nearest-neighbor queries in the \(L_1\) plane
• On metric properties of maps between Hamming spaces and related graph homomorphisms
• Real-valued embeddings and sketches for fast distance and similarity estimation
• Sparser Johnson-Lindenstrauss transforms
• Deformable spanners and applications
• Streaming low-rank matrix approximation with an application to scientific simulation
• Dense fast random projections and Lean Walsh transforms
• The black-box complexity of nearest-neighbor search
• A localized meshless approach for modeling spatial-temporal calcium dynamics in ventricular myocytes
• A combinatorial algorithm for all-pairs shortest paths in directed vertex-weighted graphs with applications to disc graphs
• Improved linear embeddings via Lagrange duality
• On Locality-Sensitive Orderings and Their Applications
• Approximate sparse linear regression
• Johnson-Lindenstrauss lemma for circulant matrices
• Randomized algorithms in numerical linear algebra
• Is the \(k\)-NN classifier in high dimensions affected by the curse of dimensionality?
• Reductions among high dimensional proximity problems
• 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

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)