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

DOI10.1016/j.ins.2021.11.006OpenAlexW3214000401MaRDI QIDQ6154810

Huixia Lai, Wei-Lin Chen, Xinhong Lin, Ruliang Xiao, Shi Zhang, Lu-Lu Zhang

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

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

• GLDH: toward more efficient global low-density locality-sensitive hashing for high dimensions
• Similarity estimation techniques from rounding algorithms
• Multidimensional binary search trees used for associative searching
• A neural algorithm for a fundamental computing problem
• Data-dependent hashing via nonlinear spectral gaps
• Locality-sensitive hashing scheme based on p-stable distributions
• Unnamed Item
• Unnamed Item

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