{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T18:00:39Z","timestamp":1772906439050,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,7,25]],"date-time":"2010-07-25T00:00:00Z","timestamp":1280016000000},"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":[[2010,7,25]]},"DOI":"10.1145\/1835804.1835946","type":"proceedings-article","created":{"date-parts":[[2010,7,27]],"date-time":"2010-07-27T14:10:11Z","timestamp":1280239811000},"page":"1129-1138","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":108,"title":["Scalable similarity search with optimized kernel hashing"],"prefix":"10.1145","author":[{"given":"Junfeng","family":"He","sequence":"first","affiliation":[{"name":"Columbia University, New York, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Liu","sequence":"additional","affiliation":[{"name":"Columbia University, New York, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shih-Fu","family":"Chang","sequence":"additional","affiliation":[{"name":"Columbia University, New York, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,7,25]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/355744.355745"},{"key":"e_1_3_2_2_2_1","volume-title":"Satisfying general proximity \/ similarity queries with metric trees. Information Processing Letters, page 175--179","author":"Uhlmann J.","year":"1991","unstructured":"J. Uhlmann . Satisfying general proximity \/ similarity queries with metric trees. Information Processing Letters, page 175--179 , 1991 . J. Uhlmann. Satisfying general proximity \/ similarity queries with metric trees. Information Processing Letters, page 175--179, 1991."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/645925.671516"},{"key":"e_1_3_2_2_5_1","volume-title":"Proceedings of the ACM Symposium on Theory of Computing","author":"Charikar M.","year":"2002","unstructured":"M. Charikar . Similarity search in high dimensions via hashing . In Proceedings of the ACM Symposium on Theory of Computing , 2002 . M. Charikar. Similarity search in high dimensions via hashing. In Proceedings of the ACM Symposium on Theory of Computing, 2002."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/997817.997857"},{"key":"e_1_3_2_2_7_1","volume-title":"Proceedings of IEEE Conference on Computer Vision and Pattern Recognition","author":"Grauman K.","year":"2007","unstructured":"K. Grauman and T. Darrell . Pyramid match hashing: sub-Linear time indexing over partial correspondences . In Proceedings of IEEE Conference on Computer Vision and Pattern Recognition , 2007 . K. Grauman and T. Darrell. Pyramid match hashing: sub-Linear time indexing over partial correspondences. In Proceedings of IEEE Conference on Computer Vision and Pattern Recognition, 2007."},{"key":"e_1_3_2_2_8_1","volume-title":"Proceedings of IEEE Conference on Computer Vision and Pattern Recognition","author":"Jain P.","year":"2008","unstructured":"P. Jain , B. Kulis , and K. Grauman . Fast image search for learned metrics . In Proceedings of IEEE Conference on Computer Vision and Pattern Recognition , 2008 . P. Jain, B. Kulis, and K. Grauman. Fast image search for learned metrics. In Proceedings of IEEE Conference on Computer Vision and Pattern Recognition, 2008."},{"key":"e_1_3_2_2_9_1","volume-title":"Semantic hashing","author":"Salakhutdinov R.","year":"2007","unstructured":"R. Salakhutdinov and G. Hinton . Semantic hashing . In Proceedings of ACM SIGIR Special Interest Group on Information Retrieval, 2007 . R. Salakhutdinov and G. Hinton. Semantic hashing. In Proceedings of ACM SIGIR Special Interest Group on Information Retrieval, 2007."},{"key":"e_1_3_2_2_10_1","volume-title":"Proceedings of AI and Statistics","author":"Salakhutdinov R.","year":"2007","unstructured":"R. Salakhutdinov and G. Hinton . Learning a nonlinear embedding by preserving class neighbourhood structure . In Proceedings of AI and Statistics , 2007 . R. Salakhutdinov and G. Hinton. Learning a nonlinear embedding by preserving class neighbourhood structure. In Proceedings of AI and Statistics, 2007."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587633"},{"key":"e_1_3_2_2_12_1","volume-title":"Proceedings of Advances in Neural Information Processing Systems","author":"Weiss Y.","year":"2008","unstructured":"Y. Weiss , A. Torralba , and R. Fergus . Spectral hashing . In Proceedings of Advances in Neural Information Processing Systems , 2008 . Y. Weiss, A. Torralba, and R. Fergus. Spectral hashing. In Proceedings of Advances in Neural Information Processing Systems, 2008."},{"key":"e_1_3_2_2_13_1","volume-title":"Kulis and Kristen Grauman. Kernelized Locality-Sensitive Hashing for Scalable Image Search. In Proceedings of 12th International Conference on Computer Vision","author":"Brian","year":"2009","unstructured":"Brian Kulis and Kristen Grauman. Kernelized Locality-Sensitive Hashing for Scalable Image Search. In Proceedings of 12th International Conference on Computer Vision , 2009 . Brian Kulis and Kristen Grauman. Kernelized Locality-Sensitive Hashing for Scalable Image Search. In Proceedings of 12th International Conference on Computer Vision, 2009."},{"key":"e_1_3_2_2_14_1","volume-title":"Proceedings of Advances in Neural Information Processing Systems","author":"Kulis Brian","year":"2009","unstructured":"Brian Kulis and Trevor Darrell . Learning to hash with binary reconstructive embeddings . In Proceedings of Advances in Neural Information Processing Systems , 2009 . Brian Kulis and Trevor Darrell. Learning to hash with binary reconstructive embeddings. In Proceedings of Advances in Neural Information Processing Systems, 2009."},{"key":"e_1_3_2_2_15_1","volume-title":"Proceedings of Advances in Neural Information Processing Systems","author":"Raginsky M.","year":"2009","unstructured":"M. Raginsky and S. Lazebnik . Locality sensitive binary codes from shift-invariant kernels . In Proceedings of Advances in Neural Information Processing Systems , 2009 . M. Raginsky and S. Lazebnik. Locality sensitive binary codes from shift-invariant kernels. In Proceedings of Advances in Neural Information Processing Systems, 2009."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401921"},{"key":"e_1_3_2_2_17_1","volume-title":"Partha Niyogi. Locality Preserving Projections. In Proceedings of Advances in Neural Information Processing Systems","author":"He Xiaofei","year":"2003","unstructured":"Xiaofei He , and Partha Niyogi. Locality Preserving Projections. In Proceedings of Advances in Neural Information Processing Systems , 2003 . Xiaofei He, and Partha Niyogi. Locality Preserving Projections. In Proceedings of Advances in Neural Information Processing Systems, 2003."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011139631724"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:VISI.0000029664.99615.94"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2440-0","volume-title":"The Nature of Statistical Learning Theory","author":"Vapnik Vladimir N","year":"1995","unstructured":"Vladimir N Vapnik . The Nature of Statistical Learning Theory , 1995 . Vladimir N Vapnik. The Nature of Statistical Learning Theory, 1995."},{"key":"e_1_3_2_2_21_1","volume-title":"Proceedings of Advances in Neural Information Processing Systems","author":"Williams Christopher","year":"2001","unstructured":"Christopher Williams , Matthias Seeger . Using the nystr\u00a8om method to speed up kernel machines . In Proceedings of Advances in Neural Information Processing Systems , 2001 . Christopher Williams, Matthias Seeger. Using the nystr\u00a8om method to speed up kernel machines. In Proceedings of Advances in Neural Information Processing Systems, 2001."},{"key":"e_1_3_2_2_22_1","volume-title":"Proceedings of Advances in Neural Information Processing Systems","author":"Belkin Mikhail","year":"2001","unstructured":"Mikhail Belkin and Partha Niyogi . Laplacian eigenmaps and spectral techniques for embedding and clustering . In Proceedings of Advances in Neural Information Processing Systems , 2001 . Mikhail Belkin and Partha Niyogi. Laplacian eigenmaps and spectral techniques for embedding and clustering. In Proceedings of Advances in Neural Information Processing Systems, 2001."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/1032643.1033069"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2006.68"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1179352.1141964"},{"key":"e_1_3_2_2_26_1","volume-title":"Proceedings of Advances in Neural Information Processing Systems","author":"Shervashidze Nino","year":"2009","unstructured":"Nino Shervashidze , Karsten M. Borgwardt . Fast subtree kernels on graphs . In Proceedings of Advances in Neural Information Processing Systems , 2009 . Nino Shervashidze, Karsten M. Borgwardt. Fast subtree kernels on graphs. In Proceedings of Advances in Neural Information Processing Systems, 2009."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2006.39"}],"event":{"name":"KDD '10: The 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"Washington DC USA","acronym":"KDD '10","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1835804.1835946","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1835804.1835946","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:09:03Z","timestamp":1750248543000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1835804.1835946"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7,25]]},"references-count":27,"alternative-id":["10.1145\/1835804.1835946","10.1145\/1835804"],"URL":"https:\/\/doi.org\/10.1145\/1835804.1835946","relation":{},"subject":[],"published":{"date-parts":[[2010,7,25]]},"assertion":[{"value":"2010-07-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}