{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T15:22:51Z","timestamp":1761578571874,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":11,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,7,28]],"date-time":"2013-07-28T00:00:00Z","timestamp":1374969600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,7,28]]},"DOI":"10.1145\/2484028.2484162","type":"proceedings-article","created":{"date-parts":[[2013,7,30]],"date-time":"2013-07-30T13:40:50Z","timestamp":1375191650000},"page":"1009-1012","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Neighbourhood preserving quantisation for LSH"],"prefix":"10.1145","author":[{"given":"Sean","family":"Moran","sequence":"first","affiliation":[{"name":"The University of Edinburgh, Edinburgh, United Kingdom"}]},{"given":"Victor","family":"Lavrenko","sequence":"additional","affiliation":[{"name":"The University of Edinburgh, Edinburgh, United Kingdom"}]},{"given":"Miles","family":"Osborne","sequence":"additional","affiliation":[{"name":"The University of Edinburgh, Edinburgh, United Kingdom"}]}],"member":"320","published-online":{"date-parts":[[2013,7,28]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509965"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995432"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"e_1_3_2_1_4_1","volume-title":"AAAI","author":"Kong W.","year":"2012","unstructured":"W. Kong and W.-J. Li . Double-bit quantization for hashing . In AAAI , 2012 . W. Kong and W.-J. Li. Double-bit quantization for hashing. In AAAI, 2012."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2348283.2348293"},{"key":"e_1_3_2_1_6_1","first-page":"1","volume-title":"ICML","author":"Liu W.","year":"2011","unstructured":"W. Liu , J. Wang , S. Kumar , and S.-F. Chang . Hashing with graphs . In ICML , pages 1 -- 8 , 2011 . W. Liu, J. Wang, S. Kumar, and S.-F. Chang. Hashing with graphs. In ICML, pages 1--8, 2011."},{"key":"e_1_3_2_1_7_1","first-page":"950","volume-title":"Proceedings of the 33rd international conference on Very large data bases, VLDB '07","author":"Lv Q.","year":"2007","unstructured":"Q. Lv , W. Josephson , Z. Wang , M. Charikar , and K. Li . Multi-probe lsh: efficient indexing for high-dimensional similarity search . In Proceedings of the 33rd international conference on Very large data bases, VLDB '07 , pages 950 -- 961 . VLDB Endowment , 2007 . Q. Lv, W. Josephson, Z. Wang, M. Charikar, and K. Li. Multi-probe lsh: efficient indexing for high-dimensional similarity search. In Proceedings of the 33rd international conference on Very large data bases, VLDB '07, pages 950--961. VLDB Endowment, 2007."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011139631724"},{"key":"e_1_3_2_1_9_1","first-page":"1509","volume-title":"NIPS","author":"Raginsky M.","year":"2009","unstructured":"M. Raginsky and S. Lazebnik . Locality-sensitive binary codes from shift-invariant kernels . In NIPS , pages 1509 -- 1517 , 2009 . M. Raginsky and S. Lazebnik. Locality-sensitive binary codes from shift-invariant kernels. In NIPS, pages 1509--1517, 2009."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.48"},{"key":"e_1_3_2_1_11_1","first-page":"1753","volume-title":"NIPS","author":"Weiss Y.","year":"2008","unstructured":"Y. Weiss , A. Torralba , and R. Fergus . Spectral hashing . In NIPS , pages 1753 -- 1760 , 2008 . Y. Weiss, A. Torralba, and R. Fergus. Spectral hashing. In NIPS, pages 1753--1760, 2008."}],"event":{"name":"SIGIR '13: The 36th International ACM SIGIR conference on research and development in Information Retrieval","sponsor":["SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Dublin Ireland","acronym":"SIGIR '13"},"container-title":["Proceedings of the 36th international ACM SIGIR conference on Research and development in information retrieval"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2484028.2484162","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2484028.2484162","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:35:48Z","timestamp":1750235748000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2484028.2484162"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7,28]]},"references-count":11,"alternative-id":["10.1145\/2484028.2484162","10.1145\/2484028"],"URL":"https:\/\/doi.org\/10.1145\/2484028.2484162","relation":{},"subject":[],"published":{"date-parts":[[2013,7,28]]},"assertion":[{"value":"2013-07-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}