{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:50:30Z","timestamp":1740099030000,"version":"3.37.3"},"publisher-location":"Singapore","reference-count":24,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811085291"},{"type":"electronic","value":"9789811085307"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-981-10-8530-7_32","type":"book-chapter","created":{"date-parts":[[2018,2,28]],"date-time":"2018-02-28T10:04:19Z","timestamp":1519812259000},"page":"327-338","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Fast Nearest Neighbor Search Based on\u00a0Approximate k-NN Graph"],"prefix":"10.1007","author":[{"given":"Jie","family":"Yang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7915-447X","authenticated-orcid":false,"given":"Wan-Lei","family":"Zhao","sequence":"additional","affiliation":[]},{"given":"Cheng-Hao","family":"Deng","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6913-9786","authenticated-orcid":false,"given":"Hanzi","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Sangwhan","family":"Moon","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,3,1]]},"reference":[{"key":"32_CR1","unstructured":"Andoni, A.: E2LSH Searching Toolkit. http:\/\/www.mit.edu\/~andoni\/LSH\/"},{"key":"32_CR2","doi-asserted-by":"crossref","unstructured":"Babenko, A., Lempitsky, V.: Additive quantization for extreme vector compression. In: CVPR, pp. 931\u2013938 (2014)","DOI":"10.1109\/CVPR.2014.124"},{"issue":"9","key":"32_CR3","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"JL Bentley","year":"1975","unstructured":"Bentley, J.L.: Multidimensional binary search trees used for associative searching. Commun. ACM 18(9), 509\u2013517 (1975)","journal-title":"Commun. ACM"},{"issue":"4","key":"32_CR4","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1145\/358841.358850","volume":"23","author":"JL Bentley","year":"1980","unstructured":"Bentley, J.L.: Multidimensional divide-and-conquer. Commun. ACM 23(4), 214\u2013229 (1980)","journal-title":"Commun. ACM"},{"key":"32_CR5","doi-asserted-by":"crossref","first-page":"11259","DOI":"10.3390\/s101211259","volume":"10","author":"Y Chen","year":"2010","unstructured":"Chen, Y., Guan, T., Wang, C.: Approximate nearest neighbor search by residual vector quantization. Sensors 10, 11259\u201311273 (2010)","journal-title":"Sensors"},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"Chua, T.-S., Tang, J., Hong, R., Li, H., Luo, Z., Zheng, Y.-T.: NUS-WIDE: a real-world web image database from national university of Singapore. In: ACM International Conference on Image and Video Retrieval (2009)","DOI":"10.1145\/1646396.1646452"},{"key":"32_CR7","doi-asserted-by":"crossref","unstructured":"Datar, M., Immorlica, N., Indyk, P., Mirrokni, V.S.: Locality-sensitive hashing scheme based on p-stable distributions. In: Proceedings of the Twentieth Annual Symposium on Computational Geometry. ACM, New York, pp. 253\u2013262 (2004)","DOI":"10.1145\/997817.997857"},{"key":"32_CR8","doi-asserted-by":"crossref","unstructured":"Dong, W., Moses, C., Li, K.: Efficient k-nearest neighbor graph construction for generic similarity measures. In: Proceedings of the 20th International Conference on World Wide Web, WWW 2011, pp. 577\u2013586 (2011). ACM, New York","DOI":"10.1145\/1963405.1963487"},{"key":"32_CR9","unstructured":"Fu, C., Cai, D.: EFANNA: an extremely fast approximate nearest neighbor search algorithm based on kNN graph. arXiv.org (2016). arXiv:1609.07228"},{"issue":"4","key":"32_CR10","doi-asserted-by":"crossref","first-page":"744","DOI":"10.1109\/TPAMI.2013.240","volume":"36","author":"T Ge","year":"2014","unstructured":"Ge, T., He, K., Ke, Q., Sun, J.: Optimized product quantization. Trans. PAMI 36(4), 744\u2013755 (2014)","journal-title":"Trans. PAMI"},{"key":"32_CR11","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: a dynamic index structure for spatial searching. In: Proceedings of the 1984 ACM SIGMOD international conference on Management of data, vol. 14, pp. 47\u201357. ACM, New York, June 1984","DOI":"10.1145\/602259.602266"},{"key":"32_CR12","unstructured":"Hajebi, K., Abbasi-Yadkor, Y., Shahbazi, H., Zhang, H.: Fast approximate nearest-neighbor search with k-nearest neighbor graph. In: International Joint Conference on Artificial Intelligence, pp. 1312\u20131317 (2011)"},{"issue":"1","key":"32_CR13","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1109\/TPAMI.2010.57","volume":"33","author":"H J\u00e9gou","year":"2011","unstructured":"J\u00e9gou, H., Douze, M., Schmid, C.: Product quantization for nearest neighbor search. Trans. PAMI 33(1), 117\u2013128 (2011)","journal-title":"Trans. PAMI"},{"key":"32_CR14","doi-asserted-by":"crossref","unstructured":"Jegou, H., Tavenard, R., Douze, M., Amsaleg, L.: Searching in one billion vectors: re-rank with source coding. In: ICASSP (2011)","DOI":"10.1109\/ICASSP.2011.5946540"},{"key":"32_CR15","unstructured":"Li, W., Zhang, Y., Sun, Y., Wang, W., Zhang, W., Lin, X.: Approximate nearest neighbor search on high dimensional data\u2013experiments, analysis and improvement. Arxiv.org (2016). https:\/\/arxiv.org\/abs\/1610.02455"},{"key":"32_CR16","unstructured":"Malkov, Y.A., Yashunin, D.A.: Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs. Arxiv.org (2016). https:\/\/arxiv.org\/abs\/1411.2173"},{"key":"32_CR17","unstructured":"Martinez, J., Hoos, H.H., Little, J.J.: Stacked quantizers for compositional vector compression. Arxiv.org (2014). https:\/\/arxiv.org\/abs\/1411.2173"},{"key":"32_CR18","doi-asserted-by":"crossref","first-page":"2227","DOI":"10.1109\/TPAMI.2014.2321376","volume":"36","author":"M Muja","year":"2014","unstructured":"Muja, M., Lowe, D.G.: Scalable nearest neighbor algorithms for high dimensional data. Trans. PAMI 36, 2227\u20132240 (2014)","journal-title":"Trans. PAMI"},{"key":"32_CR19","doi-asserted-by":"crossref","unstructured":"Norouzi, M., Fleet, D.J.: Cartesian k-means. In: CVPR, pp. 3017\u20133024 (2013)","DOI":"10.1109\/CVPR.2013.388"},{"key":"32_CR20","unstructured":"Verma, N., Kpotufe, S., Dasgupta, S.: Which spatial partition trees are adaptive to intrinsic dimension? In: Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence, pp. 565\u2013574 (2009)"},{"key":"32_CR21","doi-asserted-by":"crossref","unstructured":"Wang, J., Li, S.: Query-driven iterated neighborhood graph search for large scale indexing. In: Proceedings of the 20th ACM International Conference on Multimedia, pp. 179\u2013188. ACM, New York (2012)","DOI":"10.1145\/2393347.2393378"},{"key":"32_CR22","doi-asserted-by":"crossref","unstructured":"Wang, J., Wang, J., Zeng, G., Tu, Z., Gan, R., Li, S.: Scalable k-NN graph construction for visual descriptors. In: CVPR, pp. 1106\u20131113 (2012)","DOI":"10.1109\/CVPR.2012.6247790"},{"key":"32_CR23","unstructured":"Zhang, T., Du, C., Wang, J.: Composite quantization for approximate nearest neighbor search. In: ICML, pp. 838\u2013846 (2014)"},{"key":"32_CR24","doi-asserted-by":"crossref","unstructured":"Zhou, W., Yuan, C., Gu, R., Huang, Y.: Large scale nearest neighbors search based on neighborhood graph. In: International Conference on Advanced Cloud and Big Data (2013)","DOI":"10.1109\/CBD.2013.20"}],"container-title":["Communications in Computer and Information Science","Internet Multimedia Computing and Service"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-10-8530-7_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,11]],"date-time":"2019-10-11T21:44:42Z","timestamp":1570830282000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-10-8530-7_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9789811085291","9789811085307"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-981-10-8530-7_32","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2018]]}}}