In this tutorial we will explore a learning to hash model and compare its performance to Locality Sensitive Hashing (LSH). Specifically we will implement Graph Regularised Hashing (GRH), a method for learning the hashing hyperplanes using supervision:
@incollection{ year={2015}, isbn={978-3-319-16353-6}, booktitle={Advances in Information Retrieval}, volume={9022}, series={Lecture Notes in Computer Science},
editor={Hanbury, Allan and Kazai, Gabriella and Rauber, Andreas and Fuhr, Norbert}, doi={10.1007/978-3-319-16354-3_15}, title={Graph Regularised Hashing},
url={http://dx.doi.org/10.1007/978-3-319-16354-3_15}, publisher={Springer International Publishing}, author={Moran, Sean and Lavrenko, Victor}, pages={135-146},
language={English} }