Variable Bit Quantisation for LSH

Sean Moran, Victor Lavrenko, Miles Osborne

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.
Original languageEnglish
Title of host publicationProceedings of the 51st Annual Meeting of the Association for Computational Linguistics (Volume 2: Short Papers)
Place of PublicationSofia, Bulgaria
PublisherAssociation for Computational Linguistics
Pages753-758
Number of pages6
ISBN (Print)978-1-937284-51-0
Publication statusPublished - 1 Aug 2013

Fingerprint

Dive into the research topics of 'Variable Bit Quantisation for LSH'. Together they form a unique fingerprint.

Cite this