Self-Taught Hashing for Fast Similarity Search

Details Self-Taught Hashing for Fast Similarity Search Self-Taught Hashing for Fast Similarity Search

2010-04-29

arxiv.org/abs/1004.5370v1

Computer Science

Information Retrieval

Scientific paper

The ability of fast similarity search at large scale is of great importance to many Information Retrieval (IR) applications. 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). Although some recently proposed techniques are able to generate high-quality codes for documents known in advance, obtaining the codes for previously unseen documents remains to be a very challenging problem. In this paper, we emphasise this issue and propose a novel Self-Taught Hashing (STH) approach to semantic hashing: we first find the optimal $l$-bit binary codes for all documents in the given corpus via unsupervised learning, and then train $l$ classifiers via supervised learning to predict the $l$-bit code for any query document unseen before. Our experiments on three real-world text datasets show that the proposed approach using binarised Laplacian Eigenmap (LapEig) and linear Support Vector Machine (SVM) outperforms state-of-the-art techniques significantly.

Affiliated with

Also associated with

No associations

Rating

Self-Taught Hashing for Fast Similarity Search does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Self-Taught Hashing for Fast Similarity Search, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Self-Taught Hashing for Fast Similarity Search will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-285746