{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,25]],"date-time":"2026-09-25T11:09:20Z","timestamp":1790334560765,"version":"4.1.0"},"reference-count":27,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1109\/bigdata.2016.7840682","type":"proceedings-article","created":{"date-parts":[[2017,2,7]],"date-time":"2017-02-07T21:46:59Z","timestamp":1486504019000},"page":"881-888","source":"Crossref","is-referenced-by-count":29,"title":["Fast nearest neighbor search through sparse random projections and voting"],"prefix":"10.1109","author":[{"given":"Ville","family":"Hyvonen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Teemu","family":"Pitkanen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sotiris","family":"Tasoulis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Elias","family":"Jaasaari","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Risto","family":"Tuomainen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Liang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jukka","family":"Corander","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Teemu","family":"Roos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","first-page":"950","article-title":"Multi-probe 1sh: efficient indexing for high-dimensional similarity search","author":"lv","year":"2007","journal-title":"Proceedings of the 33rd International Conference on Very Large Data Bases"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1458082.1458172"},{"key":"ref12","first-page":"1225","article-title":"Practical and optimal Ish for angular distance","author":"andoni","year":"2015","journal-title":"Advances in Neural IInformation Processing Systems"},{"key":"ref13","first-page":"1312","article-title":"Fast approximate nearest-neighbor search with k-nearest neighbor graph","volume":"22","author":"hajebi","year":"2011","journal-title":"IJCAI Proceedings-International Joint Conference on Artificial Intelligence"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963487"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2012.6247790"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/361002.361007"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293348"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1975.224297"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143857"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1997.9.7.1545"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150436"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1023\/B:VISI.0000029664.99615.94"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2016.2557348"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1145\/1276377.1276382","article-title":"Scene completion using millions of photographs","volume":"26","author":"hays","year":"2007","journal-title":"ACM Transactions on Graphics (TOG)"},{"key":"ref8","first-page":"518","article-title":"Similarity search in high dimensions via hashing","volume":"99","author":"gionis","year":"1999","journal-title":"VLDB"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2006.264"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1109\/FOCS.2006.49","article-title":"Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions","author":"andoni","year":"2006","journal-title":"2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06) FOCS"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2014.2321376"},{"key":"ref20","first-page":"311","article-title":"Data structures and algorithms for nearest neighbor search in general metric spaces","volume":"93","author":"yianilos","year":"1993","journal-title":"SODA"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587638"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.5244\/C.20.81"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2021326"},{"key":"ref23","first-page":"331","article-title":"Fast approximate nearest neighbors with automatic algorithm configuration","volume":"2","author":"muja","year":"2009","journal-title":"VISAPP"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/375551.375608"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-014-9885-5"}],"event":{"name":"2016 IEEE International Conference on Big Data (Big Data)","location":"Washington DC,USA","start":{"date-parts":[[2016,12,5]]},"end":{"date-parts":[[2016,12,8]]}},"container-title":["2016 IEEE International Conference on Big Data (Big Data)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7818133\/7840573\/07840682.pdf?arnumber=7840682","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T11:17:46Z","timestamp":1568805466000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7840682\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/bigdata.2016.7840682","relation":{},"subject":[],"published":{"date-parts":[[2016,12]]}}}