{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,23]],"date-time":"2026-10-23T12:00:29Z","timestamp":1792756829096,"version":"4.5.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,3,28]],"date-time":"2011-03-28T00:00:00Z","timestamp":1301270400000},"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":[[2011,3,28]]},"DOI":"10.1145\/1963405.1963487","type":"proceedings-article","created":{"date-parts":[[2011,3,29]],"date-time":"2011-03-29T08:02:18Z","timestamp":1301385738000},"page":"577-586","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":570,"title":["Efficient k-nearest neighbor graph construction for generic similarity measures"],"prefix":"10.1145","author":[{"given":"Wei","family":"Dong","sequence":"first","affiliation":[{"name":"Princeton University, Princeton, NJ, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Charikar","family":"Moses","sequence":"additional","affiliation":[{"name":"Princeton University, Princeton, NJ, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kai","family":"Li","sequence":"additional","affiliation":[{"name":"Princeton University, Princeton, NJ, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2011,3,28]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.99"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242591"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/645503.656271"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143857"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587598"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-7152(96)00213-1"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509965"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1577069.1755852"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2010.9"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/997817.997857"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1458082.1458172"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/645925.671516"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335325"},{"key":"e_1_3_2_1_15_1","volume-title":"Advances in Neural Information Processing Systems 17.","author":"Liu T.","year":"2005","unstructured":"T. Liu , A. W. Moore , A. Gray , and K. Yang . An investigation of practical approximate nearest neighbor algorithms . In Advances in Neural Information Processing Systems 17. 2005 . T. Liu, A. W. Moore, A. Gray, and K. Yang. An investigation of practical approximate nearest neighbor algorithms. In Advances in Neural Information Processing Systems 17. 2005."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1031171.1031213"},{"key":"e_1_3_2_1_17_1","first-page":"950","volume-title":"VLDB '07: Proceedings of the 33rd international conference on Very large data bases","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 VLDB '07: Proceedings of the 33rd international conference on Very large data bases , pages 950 -- 961 , 2007 . Q. Lv, W. Josephson, Z. Wang, M. Charikar, and K. Li. Multi-Probe LSH: efficient indexing for high-dimensional similarity search. In VLDB '07: Proceedings of the 33rd international conference on Very large data bases, pages 950--961, 2007."},{"key":"e_1_3_2_1_18_1","first-page":"397","volume-title":"In Twelfth Conference on Uncertainty in Artificial Intelligence","author":"Moore A. W.","year":"2000","unstructured":"A. W. Moore . The anchors hierarchy: Using the triangle inequality to survive high dimensional data . In In Twelfth Conference on Uncertainty in Artificial Intelligence , pages 397 -- 405 , 2000 . A. W. Moore. The anchors hierarchy: Using the triangle inequality to survive high dimensional data. In In Twelfth Conference on Uncertainty in Artificial Intelligence, pages 397--405, 2000."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/11764298_8"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/938978.939133"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807222"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367516"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.12"}],"event":{"name":"WWW '11: 20th International World Wide Web Conference","location":"Hyderabad India","acronym":"WWW '11","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","The International Institute of Information Technology Bangalore The International Institute of Information Technology Bangalore"]},"container-title":["Proceedings of the 20th international conference on World wide web"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1963405.1963487","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1963405.1963487","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:52:19Z","timestamp":1750229539000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1963405.1963487"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3,28]]},"references-count":23,"alternative-id":["10.1145\/1963405.1963487","10.1145\/1963405"],"URL":"https:\/\/doi.org\/10.1145\/1963405.1963487","relation":{},"subject":[],"published":{"date-parts":[[2011,3,28]]},"assertion":[{"value":"2011-03-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}