{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T19:42:34Z","timestamp":1769024554934,"version":"3.49.0"},"reference-count":48,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61572408"],"award-info":[{"award-number":["61572408"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61972326"],"award-info":[{"award-number":["61972326"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008865","name":"Xiamen University","doi-asserted-by":"publisher","award":["20720180074"],"award-info":[{"award-number":["20720180074"]}],"id":[{"id":"10.13039\/501100008865","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Multimedia"],"published-print":{"date-parts":[[2022]]},"DOI":"10.1109\/tmm.2021.3073811","type":"journal-article","created":{"date-parts":[[2021,4,19]],"date-time":"2021-04-19T23:11:10Z","timestamp":1618873870000},"page":"1909-1921","source":"Crossref","is-referenced-by-count":29,"title":["Approximate <i>k<\/i>-NN Graph Construction: A Generic Online Approach"],"prefix":"10.1109","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7915-447X","authenticated-orcid":false,"given":"Wan-Lei","family":"Zhao","sequence":"first","affiliation":[{"name":"Department of Computer Science and Technology, Xiamen University, Xiamen, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8982-0571","authenticated-orcid":false,"given":"Hui","family":"Wang","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Technology, Xiamen University, Xiamen, China"}]},{"given":"Chong-Wah","family":"Ngo","sequence":"additional","affiliation":[{"name":"School of Computing and Information Systems, Singapore Management University, Singapore, Singapore"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1126\/science.290.5500.2319"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1126\/science.290.5500\u20132323"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2015.2495248"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963487"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2009.2012919"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/11764298_8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.616"},{"key":"ref8","article-title":"EFANNA : An extremely fast approximate nearest neighbor search algorithm based on knn graph","author":"Fu","year":"2016"},{"key":"ref9","first-page":"1989","article-title":"Fast approximate KNN graph construction for high dimensional data via recursive lanczos bisection","volume":"10","author":"Chen","year":"2009","journal-title":"J. Mach. Learn. Res."},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2012.6247790"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/997817.997857"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/602259.602266"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/361002.361007"},{"key":"ref14","first-page":"1312","article-title":"Fast approximate nearest-neighbor search with k-nearest neighbor graph","volume-title":"Proc. Int. Joint Conf. Artif. Intell.","author":"Hajebi","year":"2011"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2909204"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2018.2889473"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/356770.356776"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/93597.98741"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2014.2321376"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587638"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.3390\/s101211259"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.57"},{"key":"ref23","first-page":"2055","article-title":"Efficient indexing of billion-scale datasets of deep descriptors","volume-title":"Proc. IEEE Conf. Comput. Vis. Pattern Recognit.","author":"Babenko","year":"2016"},{"key":"ref24","first-page":"838","article-title":"Composite quantization for approximate nearest neighbor search","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Zhang","year":"2014"},{"key":"ref25","article-title":"Stacked quantizers for compositional vector compression","author":"Martinez","year":"2014"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"2325","DOI":"10.1109\/18.720541","volume":"44","author":"Gray","year":"2006","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.223"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2019.2921572"},{"key":"ref29","first-page":"950","article-title":"Multi-probe LSH: Efficient indexing for high-dimensional similarity search","volume-title":"Proc. Very Large Data bases","author":"Lv","year":"2007"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2018.2872898"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/2393347.2393378"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2013.10.006"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.14778\/3303753.3303754"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40991-2_42"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2012.6247790"},{"key":"ref36","article-title":"Fast Online K-NN Graph Building","author":"Debatty","year":"2016"},{"key":"ref37","first-page":"777","article-title":"Maximum likelihood estimation of intrinsic dimension","volume-title":"Adv. Neural Inf. Process. Syst.","author":"Levina","year":"2005"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.14778\/2735461.2735462"},{"key":"ref39","article-title":"Annoy: Approximate nearest neighbors in C++\/python optimized for memory usage and loading\/saving to disk","author":"Bernhardsson","year":"2017"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1023\/b:visi.0000029664.99615.94"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/1646396.1646421"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/D14-1162"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/1646396.1646452"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2003.1238663"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/2983554.2983557"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.90"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-68474-1_3"},{"key":"ref48","article-title":"A Comparative Study on Hierarchical Navigable Small World Graphs","author":"Lin","year":"2019"}],"container-title":["IEEE Transactions on Multimedia"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6046\/9687854\/09408407.pdf?arnumber=9408407","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,9]],"date-time":"2024-01-09T23:18:47Z","timestamp":1704842327000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9408407\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":48,"URL":"https:\/\/doi.org\/10.1109\/tmm.2021.3073811","relation":{},"ISSN":["1520-9210","1941-0077"],"issn-type":[{"value":"1520-9210","type":"print"},{"value":"1941-0077","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]}}}