{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T18:01:19Z","timestamp":1787508079699,"version":"build-2736575974"},"reference-count":48,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T00:00:00Z","timestamp":1614556800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T00:00:00Z","timestamp":1614556800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T00:00:00Z","timestamp":1614556800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Big Data"],"published-print":{"date-parts":[[2021,3,1]]},"DOI":"10.1109\/tbdata.2019.2908178","type":"journal-article","created":{"date-parts":[[2019,3,29]],"date-time":"2019-03-29T14:48:13Z","timestamp":1553870893000},"page":"147-157","source":"Crossref","is-referenced-by-count":30,"title":["K-Nearest Neighbor Search by Random Projection Forests"],"prefix":"10.1109","volume":"7","author":[{"given":"Donghui","family":"Yan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yingjie","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Honggang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhenpeng","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335437"},{"key":"ref38","first-page":"189","article-title":"Laws of large numbers and nearest neighbor distances","author":"penrose","year":"2010","journal-title":"Proc Advances Directional Linear Statist"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/0047-259X(79)90065-4"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33260-9_22"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177700079"},{"key":"ref30","first-page":"825","article-title":"An investigation of practical approximate nearest neighbor algorithms","volume":"19","author":"liu","year":"2004","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref37","author":"papadopoulos","year":"2005","journal-title":"Nearest Neighbor Search A Database Perspective"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2017.2679100"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.5121\/ijdms.2013.5108"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2014.2321376"},{"key":"ref10","author":"breiman","year":"1984","journal-title":"Classification and Regression Trees"},{"key":"ref40","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4175.001.0001","author":"sch\u00f6lkopf","year":"2001","journal-title":"Learning With Kernels Support Vector Machines Regularization Optimization and Beyond"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1111\/rssb.12228"},{"key":"ref12","article-title":"Anomaly detection: A survey","author":"chandola","year":"2007"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374452"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-014-9885-5"},{"key":"ref15","first-page":"496","article-title":"Random projection trees revisited","author":"dhesi","year":"2010","journal-title":"Proc Advances Neural Inf Process Syst"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963487"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1214\/11-STS368"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1111\/j.1469-1809.1936.tb02137.x"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.1262185"},{"key":"ref28","first-page":"777","article-title":"Maximum likelihood estimation of intrinsic dimension","author":"levina","year":"2005","journal-title":"Proc Advances Neural Inf Process Syst"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/361002.361007"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.5244\/C.20.81"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293348"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176993668"},{"key":"ref29","author":"lichman","year":"2013"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143857"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/BF00058655"},{"key":"ref7","first-page":"1","article-title":"Sparsity and the possibility of inference","volume":"70","author":"bickel","year":"2008","journal-title":"Sankhya The Indian J Statist Ser A"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45681-3_2"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010933404324"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327494"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.4310\/SII.2019.v12.n2.a9"},{"key":"ref20","first-page":"148","article-title":"Experiments with a new boosting algorithm","author":"freund","year":"1996","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557118"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/1457515.1409079"},{"key":"ref22","first-page":"1","article-title":"Optimised kd-trees for fast image descriptor matching","author":"hartley","year":"2008","journal-title":"Proc IEEE Conf Comput Vis Pattern Recognit"},{"key":"ref47","first-page":"311","article-title":"Data structures and algorithms for nearest neighbor search in general metric spaces","author":"yianilos","year":"1993","journal-title":"Proc ACM-SIAM Symp Discrete Algorithms"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/355744.355745"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-21706-2"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2016.7840682"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ICMLA.2014.13"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/RT.2006.280218"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.4236\/ojs.2018.84045"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.227"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/j.csda.2013.04.010"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2015.7139608"}],"container-title":["IEEE Transactions on Big Data"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6687317\/9366322\/08676336.pdf?arnumber=8676336","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,16]],"date-time":"2024-07-16T07:02:38Z","timestamp":1721113358000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8676336\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,1]]},"references-count":48,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tbdata.2019.2908178","relation":{},"ISSN":["2332-7790","2372-2096"],"issn-type":[{"value":"2332-7790","type":"electronic"},{"value":"2372-2096","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,3,1]]}}}