Efficient Online Locality Sensitive Hashing via Reservoir Counting

Benjamin Van Durme1 and Ashwin Lall2
1HLTCOE Johns Hopkins University, 2Denison


Abstract

We describe a novel mechanism called Reservoir Counting for application in online Locality Sensitive Hashing. This technique allows for significant savings in the streaming setting, allowing for maintaining a larger number of signatures, or an increased level of approximation accuracy at a similar memory footprint.




Full paper: http://www.aclweb.org/anthology/P/P11/P11-2004.pdf