{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,14]],"date-time":"2025-06-14T12:25:33Z","timestamp":1749903933370},"reference-count":46,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","funder":[{"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"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61572408","61972326"],"award-info":[{"award-number":["61572408","61972326"]}],"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":[[2021]]},"DOI":"10.1109\/tbdata.2021.3101517","type":"journal-article","created":{"date-parts":[[2021,8,4]],"date-time":"2021-08-04T20:15:46Z","timestamp":1628108146000},"page":"1-1","source":"Crossref","is-referenced-by-count":4,"title":["On the Merge of k-NN Graph"],"prefix":"10.1109","author":[{"given":"Wan-Lei","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hui","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peng-Cheng","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chong-Wah","family":"Ngo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/1646396.1646421"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2003.1238663"},{"key":"ref33","article-title":"Hierarchical clustering-based graphs for large scale approximate nearest neighbor search","volume":"96","author":"mu\u00f1oz","year":"2019","journal-title":"Pattern Recognit"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.14778\/3303753.3303754"},{"key":"ref31","article-title":"k-NN graph construction: A generic online approach","author":"zhao","year":"2018"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2909204"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2019.02.006"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1023\/B:VISI.0000029664.99615.94"},{"key":"ref35","first-page":"777","article-title":"Maximum likelihood estimation of intrinsic dimension","author":"levina","year":"2004","journal-title":"in Proc Adv Neural Inf Process Syst"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.616"},{"key":"ref10","first-page":"1312","article-title":"Fast approximate nearest-neighbor search with k-nearest neighbor graph","author":"hajebi","year":"2011","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/D14-1162"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2016.7498244"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2013.10.006"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2018.2889473"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/361002.361007"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/602259.602266"},{"key":"ref16","first-page":"28","article-title":"The X-tree : An index structure for high-dimensional data","author":"berchtold","year":"1996","journal-title":"Proc 22th Int Conf Very Large Data Bases"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2008.130"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.125"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2014.2321376"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2017.2699960"},{"key":"ref4","first-page":"873","article-title":"Fast graph construction using auction algorithm","author":"wang","year":"2012","journal-title":"Proc 28th Conf Uncertainty Artif Intell"},{"key":"ref27","first-page":"2074","article-title":"Supervised hashing with kernels","author":"liu","year":"0","journal-title":"Proc IEEE Conf Comput Vis Pattern Recognit"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.3015777"},{"key":"ref6","article-title":"EFANNA : An extremely fast approximate nearest neighbor search algorithm based on kNN graph","author":"fu","year":"2016"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/2393347.2393378"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963487"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2012.6247790"},{"key":"ref7","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":"ref2","doi-asserted-by":"publisher","DOI":"10.1126\/science.290.5500.2323"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40991-2_42"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"2319","DOI":"10.1126\/science.290.5500.2319","article-title":"A global geometric framework for nonlinear dimensionality reduction","volume":"290","author":"tenenbaum","year":"2000","journal-title":"Science"},{"key":"ref46","article-title":"Graph based nearest neighbor search: Promises and failures","author":"lin","year":"2019"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587638"},{"key":"ref45","year":"0"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.57"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.3390\/s101211259"},{"key":"ref42","article-title":"SPTAG: A library for fast approximate nearest neighbor search","author":"chen","year":"2018"},{"key":"ref24","first-page":"838","article-title":"Composite quantization for approximate nearest neighbor search","author":"zhang","year":"2014","journal-title":"Proc 31st Int Conf Mach Learn"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/2983554.2983557"},{"key":"ref23","first-page":"2055","article-title":"Efficient indexing of billion-scale datasets of deep descriptors","author":"babenko","year":"2016","journal-title":"Proc IEEE Conf Comput Vis Pattern Recognit"},{"key":"ref44","article-title":"Annoy: Approximate nearest neighbors in C++\/Python optimized for memory usage and loading\/saving to disk","author":"bernhardsson","year":"2016"},{"key":"ref26","first-page":"950","article-title":"Multi-probe LSH: Efficient indexing for high-dimensional similarity search","author":"lv","year":"2007","journal-title":"Proc Very Large Data Bases"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.14778\/2735461.2735462"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/997817.997857"}],"container-title":["IEEE Transactions on Big Data"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6687317\/7153538\/09506836.pdf?arnumber=9506836","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,11]],"date-time":"2022-11-11T16:52:36Z","timestamp":1668185556000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9506836\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":46,"URL":"https:\/\/doi.org\/10.1109\/tbdata.2021.3101517","relation":{},"ISSN":["2332-7790","2372-2096"],"issn-type":[{"value":"2332-7790","type":"electronic"},{"value":"2372-2096","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]}}}