Zhang, Dell and Wang, J. and Cai, D. and Lu, J. (2010) Laplacian co-hashing of terms and documents. In: Gurrin, C. and He, Y. and Kazai, G. and Kruschwitz, U. and Little, S. and Roelleke, T. and Ruger, S.M. and van Rijsbergen, K. (eds.) Advances in Information Retrieval. Lecture Notes In Computer Science 5993. Berlin, Germany: Springer, pp. 577-580. ISBN 9783642122743.
Abstract
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.
Metadata
| Item Type: | Book Section |
|---|---|
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Research Centres and Institutes: | Birkbeck Knowledge Lab |
| Depositing User: | Administrator |
| Date Deposited: | 30 May 2013 11:07 |
| Last Modified: | 09 Aug 2023 12:33 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/7089 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
