{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T06:03:01Z","timestamp":1783576981673,"version":"3.55.0"},"reference-count":32,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1109\/dsia.2017.8339084","type":"proceedings-article","created":{"date-parts":[[2018,4,19]],"date-time":"2018-04-19T16:15:28Z","timestamp":1524154528000},"page":"1-5","source":"Crossref","is-referenced-by-count":14,"title":["A progressive k-d tree for approximate k-nearest neighbors"],"prefix":"10.1109","author":[{"given":"Jaemin","family":"Jo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jinwook","family":"Seo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jean-Daniel","family":"Fekete","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2012.6247790"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.csda.2005.10.001"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2014.2346574"},{"key":"ref10","author":"fukunaga","year":"2013","journal-title":"Introduction to statistical pattern recognition"},{"key":"ref11","first-page":"1312","article-title":"Fast approximate nearest-neighbor search with k-nearest neighbor graph","author":"hajebi","year":"2011","journal-title":"IJCAI Proceedings-International Joint Conference on Artificial Intelligence"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5540006"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2009.5459466"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.5244\/C.20.81"},{"key":"ref15","first-page":"950","article-title":"Multi-probe lsh: 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":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2013.10.006"},{"key":"ref17","article-title":"Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs","author":"malkov","year":"2016","journal-title":"arXiv preprint arXiv 1603 09320"},{"key":"ref18","year":"2017","journal-title":"Mrpt performance comparison"},{"key":"ref19","author":"muja","year":"2017","journal-title":"FLANN - Fast Library for Approximate Nearest Neighbors"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587638"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.1997.609451"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICPR.2002.1047852"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1060745.1060840"},{"key":"ref6","author":"bernhardsson","year":"2017","journal-title":"Annoy"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/BF01759061"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/361002.361007"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374452"},{"key":"ref7","author":"bernhardsson","year":"2017","journal-title":"Benchmarking nearest neighbors"},{"key":"ref2","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":"Foundations of Computer Science 2006 FOCS'06 47th Annual IEEE Symposium on"},{"key":"ref9","article-title":"Progressive analytics: A computation paradigm for exploratory data analysis","author":"fekete","year":"2016","journal-title":"ArXiv e-prints"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-003-0436-0"},{"key":"ref20","first-page":"2","article-title":"Fast approximate nearest neighbors with automatic algorithm configuration","volume":"2","author":"muja","year":"2009","journal-title":"VISAPP"},{"key":"ref22","author":"nielsen","year":"1994","journal-title":"Usability Engineering"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2014.2321376"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/D14-1162"},{"key":"ref23","first-page":"2825","article-title":"Scikit-Iearn: Machine learning in Python","volume":"12","author":"pedregosa","year":"2011","journal-title":"Journal of Machine Learning Research"},{"key":"ref26","year":"2017","journal-title":"rpforest"},{"key":"ref25","article-title":"Approximated and user steerable tsne for progressive visual analytics","author":"pezzotti","year":"2015","journal-title":"CoRR abs\/1512 01655"}],"event":{"name":"2017 IEEE Workshop on Data Systems for Interactive Analysis (DSIA)","location":"Phoenix, AZ","start":{"date-parts":[[2017,10,1]]},"end":{"date-parts":[[2017,10,2]]}},"container-title":["2017 IEEE Workshop on Data Systems for Interactive Analysis (DSIA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8334703\/8339083\/08339084.pdf?arnumber=8339084","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,4]],"date-time":"2020-02-04T12:58:01Z","timestamp":1580821081000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8339084\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/dsia.2017.8339084","relation":{},"subject":[],"published":{"date-parts":[[2017,10]]}}}