Dynamic query modification in binary LSH raises collision probability with near neighbors and lowers miss rates, with MQ-Forest achieving up to 40% faster build and query times on benchmarks.
We store these results inD, a1000×100matrix representing the heights of the100nearest neighbours to the query over all 1000hyperplanes
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Dynamic Query Modification for Binary Locality Sensitive Hashing
Dynamic query modification in binary LSH raises collision probability with near neighbors and lowers miss rates, with MQ-Forest achieving up to 40% faster build and query times on benchmarks.