Locality-sensitive hashing scheme based on p-stable distributions
From MaRDI portal
Publication:5361678
DOI10.1145/997817.997857zbMath1373.68193OpenAlexW2162006472MaRDI QIDQ5361678
Nicole Immorlica, Mayur Datar, Vahab S. Mirrokni, Piotr Indyk
Publication date: 29 September 2017
Published in: Proceedings of the twentieth annual symposium on Computational geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/997817.997857
Searching and sorting (68P10) Data structures (68P05) Information storage and retrieval of data (68P20)
Related Items (60)
Binary vectors for fast distance and similarity estimation ⋮ Accelerating patch-based low-rank image restoration using kd-forest and Lanczos approximation ⋮ Improved maximum inner product search with better theoretical guarantee using randomized partition trees ⋮ Federated personalized random forest for human activity recognition ⋮ Propagation kernels: efficient graph kernels from propagated information ⋮ I/O-Efficient Similarity Join ⋮ Locality sensitive hashing with extended differential privacy ⋮ Unnamed Item ⋮ Habituation as a neural algorithm for online odor discrimination ⋮ An efficient quasi-identifier index based approach for privacy preservation over incremental data sets on cloud ⋮ Classification tree methods for panel data using wavelet-transformed time series ⋮ I/O-efficient similarity join ⋮ Optimal Lower Bounds for Locality-Sensitive Hashing (Except When q is Tiny) ⋮ Faster Sieving for Shortest Lattice Vectors Using Spherical Locality-Sensitive Hashing ⋮ Explicit embeddings for nearest neighbor search with Mercer kernels ⋮ A new coding-based algorithm for finding closest pair of vectors ⋮ On approximate near-neighbors search under the (continuous) Fréchet distance in higher dimensions ⋮ Deep asymmetric hashing with dual semantic regression and class structure quantization ⋮ Multiple feature kernel hashing for large-scale visual search ⋮ VBLSH: volume-balancing locality-sensitive hashing algorithm for K-nearest neighbors search ⋮ Representation and coding of signal geometry ⋮ Time for dithering: fast and quantized random embeddings via the restricted isometry property ⋮ Detecting the large entries of a sparse covariance matrix in sub-quadratic time ⋮ The complexity of LSH feasibility ⋮ A comparative study of data-dependent approaches without learning in measuring similarities of data objects ⋮ Filtering Multi-set Tree: Data Structure for Flexible Matching Using Multi-track Data ⋮ Lattice-based locality sensitive hashing is optimal ⋮ Is-ClusterMPP: clustering algorithm through point processes and influence space towards high-dimensional data ⋮ Scalable density-based clustering with quality guarantees using random projections ⋮ Learning Binary Hash Codes for Large-Scale Image Search ⋮ Why locality sensitive hashing works: a practical perspective ⋮ Vector representations for efficient comparison and search for similar strings ⋮ Fast, linear time, \(m\)-adic hierarchical clustering for search and retrieval using the Baire metric, with linkages to generalized ultrametrics, hashing, formal concept analysis, and precision of data measurement ⋮ GLDH: toward more efficient global low-density locality-sensitive hashing for high dimensions ⋮ SALSAS: sub-linear active learning strategy with approximate \(k\)-NN search ⋮ An \(O(\log n)\) query time algorithm for reducing \(\varepsilon \)-NN to \((c,r)\)-NN ⋮ Finding Correlations in Subquadratic Time, with Applications to Learning Parities and the Closest Pair Problem ⋮ Privacy Preserving Query over Encrypted Multidimensional Massive Data in Cloud Storage ⋮ Index structures for fast similarity search for symbol strings ⋮ Global similarity preserving hashing ⋮ An Improved Algorithm Finding Nearest Neighbor Using Kd-trees ⋮ A reusable and single-interactive model for secure approximate \(k\)-nearest neighbor query in cloud ⋮ Investigation of accelerated search for close text sequences with the help of vector representations ⋮ A sub-linear time algorithm for approximating k-nearest-neighbor with full quality guarantee ⋮ Unnamed Item ⋮ Consensus hashing ⋮ A general framework for efficient clustering of large datasets based on activity detection ⋮ Locality-Sensitive Hashing Without False Negatives for $$l_p$$ ⋮ Random projection-based auxiliary information can improve tree-based nearest neighbor search ⋮ Unified binary generative adversarial network for image retrieval and compression ⋮ Hadamard matrix guided online hashing ⋮ Anchor-based self-ensembling for semi-supervised deep pairwise hashing ⋮ Image matching from handcrafted to deep features: a survey ⋮ Heterogeneous distributed big data clustering on sparse grids ⋮ Parallel Transport Unfolding: A Connection-Based Manifold Learning Approach ⋮ Sharing hash codes for multiple purposes ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Local Density Estimation in High Dimensions ⋮ A Detailed Study of the Distributed Rough Set Based Locality Sensitive Hashing Feature Selection Technique
This page was built for publication: Locality-sensitive hashing scheme based on p-stable distributions
