Lavrenko, Victor

Moran, Sean

Osborne, Miles

We introduce a scheme for optimally allocating a variable number of bits per LSH hyperplane. Previous approaches assign a constant number of bits per hyperplane. This neglects the fact that a subset of hyperplanes may be more informative than others. Our method, dubbed Variable Bit Quantisation (VBQ), provides a data-driven non-uniform bit allocation across hyperplanes. Despite only using a fraction of the available hyperplanes, VBQ outperforms uniform quantisation by up to 168% for retrieval across standard text and image datasets

Edinburgh Research Explorer

Variable Bit Quantisation for LSH

https://www.pure.ed.ac.uk/ws/files/18849353/Moran_Lavrenko_Osborne_2013.pdf

Variable Bit Quantisation for LSH

Abstract

Similar works

Full text

Available Versions

Edinburgh Research Explorer