{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T14:46:56Z","timestamp":1770821216404,"version":"3.50.1"},"reference-count":47,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2020,2,1]],"date-time":"2020-02-01T00:00:00Z","timestamp":1580515200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["NRF-2016R1A2B2007153"],"award-info":[{"award-number":["NRF-2016R1A2B2007153"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Visual. Comput. Graphics"],"published-print":{"date-parts":[[2020,2,1]]},"DOI":"10.1109\/tvcg.2018.2869149","type":"journal-article","created":{"date-parts":[[2018,9,12]],"date-time":"2018-09-12T14:54:22Z","timestamp":1536764062000},"page":"1347-1360","source":"Crossref","is-referenced-by-count":27,"title":["PANENE: A Progressive Algorithm for Indexing and Querying Approximate <i>k<\/i>-Nearest Neighbors"],"prefix":"10.1109","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5207-6010","authenticated-orcid":false,"given":"Jaemin","family":"Jo","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7734-822X","authenticated-orcid":false,"given":"Jinwook","family":"Seo","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3770-8726","authenticated-orcid":false,"given":"Jean-Daniel","family":"Fekete","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","author":"borodin","year":"1998","journal-title":"Online Computation and Competitive Analysis"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/BF02187718"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775109"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.13205"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/2207676.2208294"},{"key":"ref30","author":"borodin","year":"1998","journal-title":"Online Computation and Competitive Analysis"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1002\/spe.2325"},{"key":"ref36","article-title":"FLANN - Fast library for approximate nearest neighbors","author":"muja","year":"2018"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2014.2346578"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2016.2598470"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2014.2321376"},{"key":"ref40","first-page":"50","article-title":"Towards a benchmark for interactive data exploration","volume":"39","author":"eichmann","year":"2016","journal-title":"IEEE Data Eng Bull"},{"key":"ref11","author":"nielsen","year":"1994","journal-title":"Usability Engineering"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/361002.361007"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/355744.355745"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2013.10.006"},{"key":"ref15","article-title":"The OpenCV library","author":"bradski","year":"2000","journal-title":"Dr Dobb's Journal of Software Tools"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.1997.609451"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587638"},{"key":"ref18","article-title":"Fast approximate nearest neighbors with automatic algorithm configuration","volume":"2","author":"muja","year":"2009","journal-title":"Proc Int Conf Comput Vis Theory Appl"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.49"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/1476589.1476628"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.csda.2005.10.001"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2016.2607714"},{"key":"ref3","first-page":"2579","article-title":"Visualizing data using t-SNE","volume":"9","author":"maaten","year":"2008","journal-title":"J Mach Learn Res"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2016.2570755"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/2514.2517"},{"key":"ref5","first-page":"2825","article-title":"Scikit-learn: Machine learning in Python","volume":"12","author":"pedregosa","year":"2011","journal-title":"J Mach Learn Res"},{"key":"ref8","article-title":"Benchmarking nearest neighbors","author":"bernhardsson","year":"2018"},{"key":"ref7","author":"fukunaga","year":"2013","journal-title":"Introduction to statistical pattern recognition"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2014.2346574"},{"key":"ref9","article-title":"Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs","volume":"abs 1603 9320","author":"malkov","year":"2016","journal-title":"CoRR"},{"key":"ref1","article-title":"Progressive analytics: A computation paradigm for exploratory data analysis","author":"fekete","year":"2016","journal-title":"ArXiv"},{"key":"ref46","article-title":"Barnes-Hut t-SNE","year":"2017"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1060745.1060840"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/5.726791"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2009.5459466"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/99.660313"},{"key":"ref21","first-page":"950","article-title":"Multi-probe LSH: Efficient indexing for high-dimensional similarity search","author":"lv","year":"2007","journal-title":"Proc Int Conf On Very Large Data Bases"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/37401.37422"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICPR.2002.1047852"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/D14-1162"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.5220\/0006692802140221"},{"key":"ref44","doi-asserted-by":"crossref","DOI":"10.1038\/324446a0","article-title":"A hierarchical $o(n \\,\\log {N})$o(nlogN) force-calculation algorithm","volume":"324","author":"barnes","year":"1986","journal-title":"Nature"},{"key":"ref26","article-title":"MRPT performance comparison","year":"2018"},{"key":"ref43","first-page":"3221","article-title":"Accelerating t-SNE using tree-based algorithms","volume":"15","author":"van der maaten","year":"2014","journal-title":"J Mach Learning Res"},{"key":"ref25","article-title":"Fast approximate nearest-neighbor search with k-nearest neighbor graph","author":"hajebi","year":"2011","journal-title":"Proc Int Joint Conf Artif Intell"}],"container-title":["IEEE Transactions on Visualization and Computer Graphics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/2945\/8946776\/08462793.pdf?arnumber=8462793","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:37:58Z","timestamp":1641987478000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8462793\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,1]]},"references-count":47,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tvcg.2018.2869149","relation":{},"ISSN":["1077-2626","1941-0506","2160-9306"],"issn-type":[{"value":"1077-2626","type":"print"},{"value":"1941-0506","type":"electronic"},{"value":"2160-9306","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2,1]]}}}