{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T10:20:39Z","timestamp":1768645239582,"version":"3.49.0"},"reference-count":29,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2017,12,1]],"date-time":"2017-12-01T00:00:00Z","timestamp":1512086400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"publisher","award":["61772563"],"award-info":[{"award-number":["61772563"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"publisher","award":["61602186"],"award-info":[{"award-number":["61602186"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005950","name":"HKUST","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100005950","id-type":"DOI","asserted-by":"publisher"}]},{"name":"RGC","award":["T11-2"],"award-info":[{"award-number":["T11-2"]}]},{"name":"RGC","award":["T12-403"],"award-info":[{"award-number":["T12-403"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2017,12,1]]},"DOI":"10.1109\/tkde.2017.2752156","type":"journal-article","created":{"date-parts":[[2017,9,14]],"date-time":"2017-09-14T18:13:50Z","timestamp":1505412830000},"page":"2772-2785","source":"Crossref","is-referenced-by-count":17,"title":["Two Efficient Hashing Schemes for High-Dimensional Furthest Neighbor Search"],"prefix":"10.1109","volume":"29","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1120-4685","authenticated-orcid":false,"given":"Qiang","family":"Huang","sequence":"first","affiliation":[]},{"given":"Jianlin","family":"Feng","sequence":"additional","affiliation":[]},{"given":"Qiong","family":"Fang","sequence":"additional","affiliation":[]},{"given":"Wilfred","family":"Ng","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-77974-2","author":"de berg","year":"2008","journal-title":"Computational Geometry Algorithms and Applications"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.62"},{"key":"ref12","first-page":"1435","article-title":"Tree-independent dual-tree algorithms","author":"curtin","year":"2013","journal-title":"Proc 29th Int Conf Mach Learn"},{"key":"ref13","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":"ref14","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1515\/9780773591134-044","article-title":"Dynamic algorithms for approximate neighbor searching","author":"bespamyatnikh","year":"1996","journal-title":"Proc Can Conf Comput Geometry"},{"key":"ref15","first-page":"769","article-title":"Reductions among high dimensional proximity problems","volume":"1","author":"goel","year":"2001","journal-title":"Proc 12th Annu ACM-SIAM Symp Discrete Algorithms"},{"key":"ref16","first-page":"539","article-title":"Better algorithms for high-dimensional proximity problems via asymmetric embeddings","author":"indyk","year":"2003","journal-title":"Proc 12th Annu ACM-SIAM Symp Discrete Algorithms"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-25087-8_1"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46759-7_17"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/026\/737400"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/20.4.364"},{"key":"ref27","first-page":"801","article-title":"MLPACK: A scalable C++ machine learning library","volume":"14","author":"curtin","year":"2013","journal-title":"J Mach Learn Res"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/0925-7721(92)90001-9"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1128\/AEM.01541-09"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2016.07.006"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1128\/AEM.71.3.1501-1506.2005"},{"key":"ref8","article-title":"On geometric algorithms that use the furthest-point voronoi diagram","author":"toussaint","year":"1981"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/MLSP.2008.4685508"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2441776.2441933"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00431-0"},{"key":"ref1","article-title":"Increasing diversity through furthest neighbor-based recommendation","volume":"12","author":"said","year":"2012","journal-title":"Proceedings of the Workshop on Diversity in Document Retrieval WSDM'12"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/997817.997857"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559905"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.49"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.14778\/2850469.2850470"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213898"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1963.10500830"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2017.66"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/8097365\/08038075.pdf?arnumber=8038075","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,25]],"date-time":"2023-08-25T22:02:47Z","timestamp":1693000967000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8038075\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,1]]},"references-count":29,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2017.2752156","relation":{},"ISSN":["1041-4347"],"issn-type":[{"value":"1041-4347","type":"print"}],"subject":[],"published":{"date-parts":[[2017,12,1]]}}}