{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T16:38:52Z","timestamp":1775666332400,"version":"3.50.1"},"reference-count":92,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2020,8,1]],"date-time":"2020-08-01T00:00:00Z","timestamp":1596240000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,8,1]],"date-time":"2020-08-01T00:00:00Z","timestamp":1596240000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,8,1]],"date-time":"2020-08-01T00:00:00Z","timestamp":1596240000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"ARC DPs","award":["170103710"],"award-info":[{"award-number":["170103710"]}]},{"name":"ARC DPs","award":["180103411"],"award-info":[{"award-number":["180103411"]}]},{"name":"ARC DPs","award":["D2DCRC DC25002"],"award-info":[{"award-number":["D2DCRC DC25002"]}]},{"name":"ARC DPs","award":["DC25003"],"award-info":[{"award-number":["DC25003"]}]},{"name":"ARC","award":["DP180103096"],"award-info":[{"award-number":["DP180103096"]}]},{"DOI":"10.13039\/501100003816","name":"Huawei Technologies","doi-asserted-by":"publisher","award":["YBN2017100007"],"award-info":[{"award-number":["YBN2017100007"]}],"id":[{"id":"10.13039\/501100003816","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61672235"],"award-info":[{"award-number":["61672235"]}],"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":["DP170101628"],"award-info":[{"award-number":["DP170101628"]}],"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":["DP180103096"],"award-info":[{"award-number":["DP180103096"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2020,8,1]]},"DOI":"10.1109\/tkde.2019.2909204","type":"journal-article","created":{"date-parts":[[2019,4,3]],"date-time":"2019-04-03T22:21:53Z","timestamp":1554330113000},"page":"1475-1488","source":"Crossref","is-referenced-by-count":330,"title":["Approximate Nearest Neighbor Search on High Dimensional Data \u2014 Experiments, Analyses, and Improvement"],"prefix":"10.1109","volume":"32","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3565-1180","authenticated-orcid":false,"given":"Wen","family":"Li","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2674-1638","authenticated-orcid":false,"given":"Ying","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Yifang","family":"Sun","sequence":"additional","affiliation":[]},{"given":"Wei","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Mingjie","family":"Li","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6572-2600","authenticated-orcid":false,"given":"Wenjie","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref73","article-title":"Scalable nearest neighbor search based on KNN graph","volume":"abs 1701 8475","author":"zhao","year":"2017","journal-title":"CoRR"},{"key":"ref72","first-page":"1106","article-title":"Scalable k-NN graph construction for visual descriptors","author":"gan","year":"2012","journal-title":"Proc IEEE Conf Comput Vis Pattern Recognit"},{"key":"ref71","first-page":"1312","article-title":"Fast approximate nearest-neighbor search with k-nearest neighbor graph","author":"hajebi","year":"2011","journal-title":"Proc 22nd Int Joint Conf Artif Intell"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143857"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-10-8530-7_32"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1145\/358841.358850"},{"key":"ref39","article-title":"Hashing for similarity search: A survey","volume":"abs 1408 2927","author":"wang","year":"2014","journal-title":"CoRR"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963487"},{"key":"ref38","first-page":"1655","article-title":"Isotropic hashing","author":"kong","year":"2012","journal-title":"Proc 26th Annu Conf Neural Inform Process Syst"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40991-2_42"},{"key":"ref78","author":"dong","year":"2011","journal-title":"High-Dimensional Similarity Search for Large Datasets"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2014.2302018"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/2502081.2502100"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.64"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835946"},{"key":"ref30","first-page":"3419","article-title":"Discrete graph hashing","author":"liu","year":"2014","journal-title":"Proc Annu Conf Neural Inf Process Syst"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.193"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995709"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.39"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.377"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46454-1_14"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2018.2789887"},{"key":"ref61","article-title":"Discrete hashing with deep neural network","volume":"abs 1508 7148","author":"do","year":"2015","journal-title":"CoRR"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/2505515.2505765"},{"key":"ref63","first-page":"311","article-title":"Data structures and algorithms for nearest neighbor search in general metric spaces","author":"yianilos","year":"1993","journal-title":"Proc 9th Annual ACM-SIAM Symp on Discrete Algorithms"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882930"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390171"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374452"},{"key":"ref29","first-page":"1753","article-title":"Spectral hashing","author":"weiss","year":"2008","journal-title":"Proc 21st Int Conf Neural Inf Process Syst"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587638"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2014.2321376"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1975.224297"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1007\/s007780200060"},{"key":"ref2","first-page":"194","article-title":"A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces","author":"weber","year":"1998","journal-title":"Proc 24rd Int Conf Very Large Data Bases"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"ref20","first-page":"518","article-title":"Similarity search in high dimensions via hashing","author":"gionis","year":"1999","journal-title":"Proc 5th Int Conf Very Large Data Bases"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559905"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1109557.1109688"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/1459359.1459388"},{"key":"ref23","first-page":"950","article-title":"Multi-probe LSH: Efficient indexing for high-dimensional similarity search","author":"lv","year":"2007","journal-title":"Proc Int Conf On Very Large Data Bases"},{"key":"ref26","first-page":"541","article-title":"Locality-sensitive hashing scheme based on dynamic collision counting","author":"gan","year":"2012","journal-title":"Proc ACM SIGMOD Int Conf Manage Data"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.14778\/3137765.3137836"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.124"},{"key":"ref51","first-page":"838","article-title":"Composite quantization for approximate nearest neighbor search","author":"zhang","year":"2014","journal-title":"Proc 31st Int Conf Int Conf Mach Learn"},{"key":"ref92","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783405"},{"key":"ref91","article-title":"On the difficulty of nearest neighbor search","author":"he","year":"2012","journal-title":"Proc of the 29th Int Conf on Machine Learning ICML 2012"},{"key":"ref90","first-page":"1574","article-title":"Learning to prune in metric and non-metric spaces","author":"boytsov","year":"2013","journal-title":"Proc 26th Int Conf Neural Inf Process Syst"},{"key":"ref59","first-page":"1","article-title":"Unsupervised deep hashing for large-scale visual search","author":"xia","year":"2017","journal-title":"Proc Int Conf Image Process Theory Tools Appl"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7298654"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2017.2678163"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/429"},{"key":"ref55","first-page":"2475","article-title":"Deep hashing for compact binary codes learning","author":"liong","year":"2015","journal-title":"Proc IEEE Conf Comput Vis Pattern Recognit"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.133"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijar.2008.11.006"},{"key":"ref52","article-title":"A revisit on deep hashings for large-scale content based image retrieval","volume":"abs 1711 6016","author":"cai","year":"2017","journal-title":"CoRR"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.14778\/2850583.2850589"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2015.2487976"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2588565"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390169"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.14778\/2824032.2824059"},{"key":"ref14","article-title":"Benchmarking nearest neighbors","author":"bernhardsson","year":"2016"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/997817.997857"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2013.10.006"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.49"},{"key":"ref81","doi-asserted-by":"publisher","DOI":"10.1038\/35022643"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.76"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73951-7_4"},{"key":"ref84","first-page":"2487","article-title":"Hubs in space: Popular nearest neighbors in high-dimensional data","volume":"11","author":"radovanovic","year":"2010","journal-title":"J Mach Learn Res"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746553"},{"key":"ref83","article-title":"Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs","volume":"abs 1603 9320","author":"malkov","year":"2016","journal-title":"CoRR"},{"key":"ref80","article-title":"EFANNA: An extremely fast approximate nearest neighbor search algorithm based on KNN graph","volume":"abs 1609 7228","author":"fu","year":"2016","journal-title":"CoRR"},{"key":"ref89","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783284"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2014.2343223"},{"key":"ref3","article-title":"Annoy at github","author":"bernhardsson","year":"2005"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.240"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.57"},{"key":"ref8","article-title":"Kgraph","author":"dong","year":"2014"},{"key":"ref85","doi-asserted-by":"publisher","DOI":"10.1111\/j.1540-5915.1993.tb00509.x"},{"key":"ref86","article-title":"Nearest neighbor search benchmark","author":"sun","year":"2016"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.221"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.14778\/2735461.2735462"},{"key":"ref87","doi-asserted-by":"publisher","DOI":"10.14778\/2850469.2850470"},{"key":"ref88","first-page":"2248","article-title":"Scalable graph hashing with feature transformation","author":"jiang","year":"2015","journal-title":"Proc 24th Int Conf Artif Intell"},{"key":"ref9","first-page":"1","article-title":"Hashing with graphs","author":"liu","year":"2011","journal-title":"Proc Int Conf Int Conf Mach Learn"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.298"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.424"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2011.5946540"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2012.6248038"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/18.720541"},{"key":"ref41","article-title":"A survey on learning to hash","volume":"abs 1606 185","author":"wang","year":"2016","journal-title":"CoRR"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7299052"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.388"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/9134984\/08681160.pdf?arnumber=8681160","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T14:41:51Z","timestamp":1651070511000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8681160\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,1]]},"references-count":92,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2019.2909204","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,8,1]]}}}