VBLSH: volume-balancing locality-sensitive hashing algorithm for K-nearest neighbors search

DOI10.1016/J.INS.2021.11.006OpenAlexW3214000401MaRDI QIDQ6154810FDOQ6154810

Authors: Shi Zhang, H. Lai, Wei-Lin Chen, Lu-Lu Zhang, Xinhong Lin, Ruliang Xiao 

Publication date: 16 February 2024

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2021.11.006

Recommendations

• A locality-sensitive hash for real vectors
• LSH Forest: Practical Algorithms Made Theoretical
• Why locality sensitive hashing works: a practical perspective
• Locality-sensitive hashing scheme based on \(p\)-stable distributions
• Fast exact \(k\) nearest neighbors search using an orthogonal search tree

zbMATH Keywords

information retrievallocality-sensitive hashinghigh-dimension massive data queryK-nearest neighbors search

Mathematics Subject Classification ID

Computer science (68-XX) Operations research, mathematical programming (90-XX)

Cites Work

• Similarity estimation techniques from rounding algorithms
• Title not available (Why is that?)
• Multidimensional binary search trees used for associative searching
• Locality-sensitive hashing scheme based on \(p\)-stable distributions
• A neural algorithm for a fundamental computing problem
• GLDH: toward more efficient global low-density locality-sensitive hashing for high dimensions
• Data-dependent hashing via nonlinear spectral gaps
• Minimum density hyperplanes

Cited In (1)

• FLEX: a fast and light-weight learned index for \(k\)NN search in high-dimensional space

This page was built for publication: VBLSH: volume-balancing locality-sensitive hashing algorithm for K-nearest neighbors search

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