Login
Computer Science @ Rochester
Friday, August 06, 2010
2:00 PM
CSB 632
Benjamin Van Durme
Johns Hopkins University
Online Generation of Locality Sensitive Hash Signatures
This Friday, Benjamin Van Durme, our alumnus - now at JHU, will be presenting his paper (published at ACL 2010) with another of our alumnus, Ashwin Lall.

Date: August 6, Friday Time: 2pm Room: CSB 632

Title: Online Generation of Locality Sensitive Hash Signatures

Authors: Benjamin Van Durme and Ashwin Lall

Abstract: Motivated by the recent interest in streaming algorithms for processing large text collections, we revisit the work of Ravichandran et al. (2005) on using the Locality Sensitive Hash (LSH) method of Charikar (2002) to enable fast, approximate comparisons of vector cosine similarity. For the common case of feature updates being additive over a data stream, we show that LSH signatures can be maintained online, without additional approximation error, and with lower memory requirements than when using the standard offline technique.