{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,18]],"date-time":"2025-03-18T04:16:59Z","timestamp":1742271419913,"version":"3.40.1"},"reference-count":22,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T00:00:00Z","timestamp":1743465600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T00:00:00Z","timestamp":1743465600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T00:00:00Z","timestamp":1743465600000},"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":["61972326","61572408"],"award-info":[{"award-number":["61972326","61572408"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Big Data"],"published-print":{"date-parts":[[2025,4]]},"DOI":"10.1109\/tbdata.2024.3460534","type":"journal-article","created":{"date-parts":[[2024,9,13]],"date-time":"2024-09-13T18:46:15Z","timestamp":1726253175000},"page":"879-886","source":"Crossref","is-referenced-by-count":0,"title":["Dynamic NN-Descent: An Efficient k-NN Graph Construction Method"],"prefix":"10.1109","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-4609-7395","authenticated-orcid":false,"given":"Jie-Feng","family":"Wang","sequence":"first","affiliation":[{"name":"Department of Computer Science and Technology, Xiamen University, Xiamen, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7915-447X","authenticated-orcid":false,"given":"Wan-Lei","family":"Zhao","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Technology, Xiamen University, Xiamen, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-0658-9843","authenticated-orcid":false,"given":"Shihai","family":"Xiao","sequence":"additional","affiliation":[{"name":"Huawei Technologies Company Ltd., Hangzhou, China"}]},{"given":"Jiajie","family":"Yao","sequence":"additional","affiliation":[{"name":"Huawei Technologies Company Ltd., Hangzhou, China"}]},{"given":"Xuecang","family":"Zhang","sequence":"additional","affiliation":[{"name":"Huawei Technologies Company Ltd., Hangzhou, China"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.14778\/3303753.3303754"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2012.6247790"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3414067"},{"key":"ref4","first-page":"17 792","article-title":"Fewer is more: A deep graph metric learning perspective using fewer proxies","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Zhu"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403342"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2018.2889473"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963487"},{"article-title":"EFANNA: An extremely fast approximate nearest neighbor search algorithm based on kNN graph","year":"2016","author":"Fu","key":"ref8"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2909204"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3067706"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2021.3073811"},{"issue":"9","key":"ref12","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":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40991-2_42"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/tbdata.2021.3101517"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482344"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2022.3161156"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.57"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1646396.1646421"},{"key":"ref19","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"},{"article-title":"SPTAG: A library for fast approximate nearest neighbor search","year":"2018","author":"Chen","key":"ref20"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975673.21"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/icde60146.2024.00323"}],"container-title":["IEEE Transactions on Big Data"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6687317\/10925345\/10679929.pdf?arnumber=10679929","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,17]],"date-time":"2025-03-17T21:18:13Z","timestamp":1742246293000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10679929\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4]]},"references-count":22,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tbdata.2024.3460534","relation":{},"ISSN":["2332-7790","2372-2096"],"issn-type":[{"type":"electronic","value":"2332-7790"},{"type":"electronic","value":"2372-2096"}],"subject":[],"published":{"date-parts":[[2025,4]]}}}