Laplacian Co-hashing of Terms and Documents

A promising way to accelerate similarity search is semantic hashing which designs compact binary codes for a large number of documents so that semantically similar documents are mapped to similar codes within a short Hamming distance. In this paper, we introduce the novel problem of co-hashing where both documents and terms are hashed simultaneously according to their semantic similarities. Furthermore, we propose a novel algorithm Laplacian Co-Hashing (LCH) to solve this problem which directly optimises the Hamming distance.

• Type: Conference
• Year: 2010
• Where: ECIR
• Authors: Dell Zhang, Jun Wang, Deng Cai, Jinsong Lu
• Keywords: ECIR 2010, Hamming Distance, Information Technology, Short Hamming Distance, Similar Documents