{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,13]],"date-time":"2025-11-13T07:11:29Z","timestamp":1763017889017,"version":"3.37.3"},"reference-count":50,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2019,2,1]]},"DOI":"10.1109\/tkde.2018.2828095","type":"journal-article","created":{"date-parts":[[2018,4,18]],"date-time":"2018-04-18T20:22:38Z","timestamp":1524082958000},"page":"329-342","source":"Crossref","is-referenced-by-count":13,"title":["Fast Cosine Similarity Search in Binary Space with Angular Multi-Index Hashing"],"prefix":"10.1109","volume":"31","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1704-6262","authenticated-orcid":false,"given":"Sepehr","family":"Eghbali","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ladan","family":"Tahvildari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2012.6248038"},{"key":"ref38","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1609\/aaai.v27i1.8582","article-title":"Reciprocal hash tables for nearest neighbor search","author":"liu","year":"2013","journal-title":"AAAI"},{"key":"ref33","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":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijar.2008.11.006"},{"key":"ref31","first-page":"194","article-title":"A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces","volume":"98","author":"weber","year":"1998","journal-title":"Proc Int Conf Very Large Data Bases"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/355744.355745"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/2348283.2348293"},{"key":"ref36","first-page":"2957","article-title":"Spherical hashing","author":"heo","year":"2012","journal-title":"Proc Int Conf Comput Vis Pattern Recognit"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2017.104"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7298654"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/361002.361007"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.231"},{"journal-title":"Foundations of Multidimensional and Metric Data Structures","year":"2006","author":"samet","key":"ref29"},{"key":"ref2","first-page":"778","article-title":"Brief: Binary robust independent elementary features","author":"calonder","year":"2000","journal-title":"Proc Eur Conf Comput Vis"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/CRV.2012.60"},{"key":"ref20","first-page":"1196","article-title":"Angular quantization-based binary codes for fast similarity search","author":"gong","year":"2012","journal-title":"Proc 25th Int Neural Inf Process Syst"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"ref21","first-page":"886","article-title":"In defense of minhash over simhash","author":"shrivastava","year":"2014","journal-title":"Proc Int Conf Artif Intell Statist"},{"key":"ref24","first-page":"1940","article-title":"PATable: Fast exact asymmetric distance neighbor search for product quantization using hash tables","author":"matusi","year":"2015","journal-title":"Proc Int Conf Comput Vis"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2012.6248043"},{"key":"ref26","first-page":"1624","article-title":"Two-dimensional pca hashing and its extension","author":"mao","year":"2016","journal-title":"Proc Int Conf Pattern Recognit"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365720"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.208"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2017.2699960"},{"key":"ref11","first-page":"1753","article-title":"Spectral hashing","author":"weiss","year":"2009","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref40","first-page":"3535","article-title":"What is the most efficientway to select nearest neighbor candidates for fast approximate nearest neighbor search?","author":"iwamura","year":"2003","journal-title":"Proc IEEE Int Conf Comput Vis"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2502081.2502091"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.165"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1835449.1835520"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.237"},{"key":"ref16","first-page":"2074","article-title":"Supervised hashing with kernels","author":"liu","year":"2012","journal-title":"Proc IEEE Conf Comput Vis Pattern Recognit"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2003.1238424"},{"key":"ref18","first-page":"2000","article-title":"Improved hamming distance search using variable length substrings","author":"ong","year":"2016","journal-title":"Proc IEEE Conf Comput Vis Pattern Recognit"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242591"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2011.6126544"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2011.6126542"},{"key":"ref6","first-page":"219","article-title":"Learning to hash with binary deep neural network","author":"do","year":"2016","journal-title":"Eur Conf Comput Vis"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2012.6247715"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.227"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.193"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.57"},{"key":"ref9","first-page":"353","article-title":"Minimal loss hashing for compact binary codes","author":"norouzi","year":"2011","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref46","first-page":"950","article-title":"Multi-probe lsh: Efficient indexing for high-dimensional similarity search","author":"lv","year":"2007","journal-title":"Proc Int Conf Very Large Data Bases"},{"key":"ref45","first-page":"1225","article-title":"Practical and optimal lsh for angular distance","author":"andoni","year":"2015","journal-title":"Adv Neural Inf Process Syst"},{"key":"ref48","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1007\/978-3-319-68474-1_3","article-title":"Ann-benchmarks: A benchmarking tool for approximate nearest neighbor algorithms","author":"aum\u00fcller","year":"2017","journal-title":"Proc Int Conf Similarity Search Appl"},{"article-title":"Fast lookups of cosine and other nearest neighbors github.com\/falconn-lib\/falconn.","year":"0","author":"razenshteyn","key":"ref47"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2010.04.004"},{"journal-title":"Parameterized Complexity Theory","year":"2006","author":"flum","key":"ref41"},{"article-title":"Annoy github.com\/spotify\/annoy.","year":"0","author":"bernhardsson","key":"ref44"},{"article-title":"Kgraph github.com\/aaalgo\/kgraph.","year":"0","author":"dong","key":"ref43"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/8606809\/08340865.pdf?arnumber=8340865","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,20]],"date-time":"2022-08-20T04:48:56Z","timestamp":1660970936000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8340865\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,1]]},"references-count":50,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2018.2828095","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"type":"print","value":"1041-4347"},{"type":"electronic","value":"1558-2191"},{"type":"electronic","value":"2326-3865"}],"subject":[],"published":{"date-parts":[[2019,2,1]]}}}