{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T14:52:45Z","timestamp":1777733565748,"version":"3.51.4"},"reference-count":42,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T00:00:00Z","timestamp":1622505600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T00:00:00Z","timestamp":1622505600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T00:00:00Z","timestamp":1622505600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2018AAA0101400"],"award-info":[{"award-number":["2018AAA0101400"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61936006"],"award-info":[{"award-number":["61936006"]}],"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":[[2021,6,1]]},"DOI":"10.1109\/tkde.2019.2953897","type":"journal-article","created":{"date-parts":[[2019,11,25]],"date-time":"2019-11-25T18:34:51Z","timestamp":1574706891000},"page":"2337-2348","source":"Crossref","is-referenced-by-count":30,"title":["A Revisit of Hashing Algorithms for Approximate Nearest Neighbor Search"],"prefix":"10.1109","volume":"33","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9817-4065","authenticated-orcid":false,"given":"Deng","family":"Cai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","first-page":"1753","article-title":"Spectral hashing","author":"weiss","year":"2008","journal-title":"Proc 21st Int Conf Neural Inf Process Syst"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33715-4_25"},{"key":"ref33","first-page":"353","article-title":"Minimal loss hashing for compact binary codes","author":"norouzi","year":"2011","journal-title":"Proc 28th Int Conf Mach Learn"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2014.2321376"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2018.2889473"},{"key":"ref30","first-page":"249","article-title":"Performance measures for information extraction","author":"makhoul","year":"2000","journal-title":"Proc DARPA Broadcast News Workshop"},{"key":"ref37","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":"ref36","author":"warren","year":"2012","journal-title":"Hacker's Delight Chapter 5"},{"key":"ref35","first-page":"1127","article-title":"Sequential projection learning for hashing with compact codes","author":"wang","year":"2010","journal-title":"Proc 27th Int Conf Mach Learn"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587638"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995432"},{"key":"ref40","first-page":"1820","article-title":"Harmonious hashing","author":"xu","year":"2013","journal-title":"Proc 23rd Int Joint Conf Artif Intell"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835946"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.378"},{"key":"ref13","first-page":"2957","article-title":"Spherical hashing","author":"heo","year":"2012","journal-title":"Proc IEEE Conf Comput Vis Pattern Recognit"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.57"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.39"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2013.2283497"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2014.2302018"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995709"},{"key":"ref28","first-page":"2074","article-title":"Supervised hashing with kernels","author":"liu","year":"2012","journal-title":"Proc IEEE Conf Comput Vis Pattern Recognit"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/361002.361007"},{"key":"ref27","first-page":"3419","article-title":"Discrete graph hashing","volume":"2","author":"liu","year":"2014","journal-title":"Proc 27th Int Conf Neural Inf Process Syst"},{"key":"ref3","first-page":"5713","article-title":"FANNG: Fast approximate nearest neighbour graphs","author":"ben","year":"2016","journal-title":"Proc IEEE Conf Comput Vis Pattern Recognit"},{"key":"ref6","first-page":"313","article-title":"Large scale spectral clustering with landmark-based representation","author":"chen","year":"2011","journal-title":"Proc 25th AAAI Conf Artif Intell"},{"key":"ref29","first-page":"2074","article-title":"Hashing with graphs","author":"liu","year":"2011","journal-title":"Proc 28th Int Conf Mach Learn"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/509961.509965"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1975.224297"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.14778\/3303753.3303754"},{"key":"ref2","first-page":"585","article-title":"Laplacian Eigenmaps and spectral techniques for embedding and clustering","author":"belkin","year":"2001","journal-title":"Proc 14th Int Conf Neural Inf Process Syst Natural Synthetic"},{"key":"ref9","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":"ref1","first-page":"271","article-title":"Approximate nearest neighbor queries in fixed dimensions","author":"arya","year":"1993","journal-title":"Proc 4th Annu ACM\/SIGACT-SIAM Symp Discrete Algorithms"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258653"},{"key":"ref22","first-page":"1042","article-title":"Learning to hash with binary reconstructive embeddings","author":"kulis","year":"2009","journal-title":"Proc 22nd Int Conf Neural Inf Process Syst"},{"key":"ref21","first-page":"1646","article-title":"Isotropic hashing","volume":"1","author":"kong","year":"2012","journal-title":"Proc 25th Int Conf Neural Inf Process Syst"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/1835449.1835455"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2909204"},{"key":"ref41","first-page":"1631","article-title":"Complementary hashing for approximate nearest neighbor search","author":"xu","year":"2011","journal-title":"Proc IEEE Int Conf Comput Vis"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2009.5459466"},{"key":"ref26","article-title":"Large graph construction for scalable semi-supervised learning","author":"liu","year":"2010","journal-title":"Proc 27th Int Conf Mach Learn"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.64"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/9427778\/08903238.pdf?arnumber=8903238","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:50:53Z","timestamp":1652194253000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8903238\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,1]]},"references-count":42,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2019.2953897","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":[[2021,6,1]]}}}