{"id":"https://openalex.org/W2953247561","doi":"https://doi.org/10.1145/3292500.3330875","title":"Revisiting kd-tree for Nearest Neighbor Search","display_name":"Revisiting kd-tree for Nearest Neighbor Search","publication_year":2019,"publication_date":"2019-07-25","ids":{"openalex":"https://openalex.org/W2953247561","doi":"https://doi.org/10.1145/3292500.3330875","mag":"2953247561"},"language":"en","primary_location":{"id":"doi:10.1145/3292500.3330875","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3292500.3330875","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5089095944","display_name":"Parikshit Ram","orcid":"https://orcid.org/0000-0002-9456-029X"},"institutions":[{"id":"https://openalex.org/I1341412227","display_name":"IBM (United States)","ror":"https://ror.org/05hh8d621","country_code":"US","type":"company","lineage":["https://openalex.org/I1341412227"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Parikshit Ram","raw_affiliation_strings":["IBM Research AI, Atlanta, GA, USA"],"affiliations":[{"raw_affiliation_string":"IBM Research AI, Atlanta, GA, USA","institution_ids":["https://openalex.org/I1341412227"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103257165","display_name":"K. P. Sinha","orcid":"https://orcid.org/0000-0002-0025-5754"},"institutions":[{"id":"https://openalex.org/I39587148","display_name":"Wichita State University","ror":"https://ror.org/00c4e7y75","country_code":"US","type":"education","lineage":["https://openalex.org/I39587148"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kaushik Sinha","raw_affiliation_strings":["Wichita State University, Wichita, KS, USA"],"affiliations":[{"raw_affiliation_string":"Wichita State University, Wichita, KS, USA","institution_ids":["https://openalex.org/I39587148"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5089095944"],"corresponding_institution_ids":["https://openalex.org/I1341412227"],"apc_list":null,"apc_paid":null,"fwci":3.0713,"has_fulltext":false,"cited_by_count":133,"citation_normalized_percentile":{"value":0.93425889,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"1378","last_page":"1388"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10036","display_name":"Advanced Neural Network Applications","score":0.9904999732971191,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.7997316122055054},{"id":"https://openalex.org/keywords/best-bin-first","display_name":"Best bin first","score":0.6521077156066895},{"id":"https://openalex.org/keywords/cover-tree","display_name":"Cover tree","score":0.6445828080177307},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.6266928315162659},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5809007883071899},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.5710927844047546},{"id":"https://openalex.org/keywords/scaling","display_name":"Scaling","score":0.5620802640914917},{"id":"https://openalex.org/keywords/large-margin-nearest-neighbor","display_name":"Large margin nearest neighbor","score":0.48820358514785767},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.46813592314720154},{"id":"https://openalex.org/keywords/nearest-neighbor-graph","display_name":"Nearest neighbor graph","score":0.45481857657432556},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.42642635107040405},{"id":"https://openalex.org/keywords/k-d-tree","display_name":"k-d tree","score":0.41409850120544434},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3965345323085785},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.37162643671035767},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.290383517742157},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2132827639579773},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.1827443242073059},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.1601560413837433},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.11762598156929016},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.06633979082107544}],"concepts":[{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.7997316122055054},{"id":"https://openalex.org/C161986146","wikidata":"https://www.wikidata.org/wiki/Q4896845","display_name":"Best bin first","level":3,"score":0.6521077156066895},{"id":"https://openalex.org/C53661774","wikidata":"https://www.wikidata.org/wiki/Q13108095","display_name":"Cover tree","level":5,"score":0.6445828080177307},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.6266928315162659},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5809007883071899},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5710927844047546},{"id":"https://openalex.org/C99844830","wikidata":"https://www.wikidata.org/wiki/Q102441924","display_name":"Scaling","level":2,"score":0.5620802640914917},{"id":"https://openalex.org/C94475309","wikidata":"https://www.wikidata.org/wiki/Q6489154","display_name":"Large margin nearest neighbor","level":3,"score":0.48820358514785767},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.46813592314720154},{"id":"https://openalex.org/C90988772","wikidata":"https://www.wikidata.org/wiki/Q2855103","display_name":"Nearest neighbor graph","level":3,"score":0.45481857657432556},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.42642635107040405},{"id":"https://openalex.org/C33721204","wikidata":"https://www.wikidata.org/wiki/Q309949","display_name":"k-d tree","level":3,"score":0.41409850120544434},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3965345323085785},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.37162643671035767},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.290383517742157},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2132827639579773},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.1827443242073059},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.1601560413837433},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.11762598156929016},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.06633979082107544},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C104047586","wikidata":"https://www.wikidata.org/wiki/Q5033439","display_name":"Canopy clustering algorithm","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3292500.3330875","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3292500.3330875","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":48,"referenced_works":["https://openalex.org/W17346433","https://openalex.org/W138476454","https://openalex.org/W1502916507","https://openalex.org/W1974647172","https://openalex.org/W1978030011","https://openalex.org/W2012833704","https://openalex.org/W2024668293","https://openalex.org/W2039742379","https://openalex.org/W2045263322","https://openalex.org/W2067702454","https://openalex.org/W2069421480","https://openalex.org/W2077815765","https://openalex.org/W2086179657","https://openalex.org/W2088171019","https://openalex.org/W2093813380","https://openalex.org/W2111284499","https://openalex.org/W2112979232","https://openalex.org/W2118123209","https://openalex.org/W2118323718","https://openalex.org/W2118563516","https://openalex.org/W2124509324","https://openalex.org/W2128017662","https://openalex.org/W2132105090","https://openalex.org/W2133296809","https://openalex.org/W2138064700","https://openalex.org/W2145607950","https://openalex.org/W2147717514","https://openalex.org/W2162006472","https://openalex.org/W2169351022","https://openalex.org/W2170037597","https://openalex.org/W2170605888","https://openalex.org/W2183176930","https://openalex.org/W2397548117","https://openalex.org/W2411707397","https://openalex.org/W2541102286","https://openalex.org/W2552431851","https://openalex.org/W2625521539","https://openalex.org/W2735058673","https://openalex.org/W2757662681","https://openalex.org/W2801922433","https://openalex.org/W2804874434","https://openalex.org/W2888282535","https://openalex.org/W2952486042","https://openalex.org/W2963213486","https://openalex.org/W3101568187","https://openalex.org/W3120740533","https://openalex.org/W4206196235","https://openalex.org/W6629956336"],"related_works":["https://openalex.org/W4246757943","https://openalex.org/W2085998272","https://openalex.org/W2182477562","https://openalex.org/W1595303882","https://openalex.org/W2375128115","https://openalex.org/W2351157934","https://openalex.org/W2571415506","https://openalex.org/W1558159560","https://openalex.org/W2902799860","https://openalex.org/W4289129280"],"abstract_inverted_index":{"\\kdtree":[0,23,38,64],"\\citefriedman1976algorithm":[1],"has":[2,39],"long":[3],"been":[4,40],"deemed":[5],"unsuitable":[6],"for":[7,45,78,115],"exact":[8],"nearest-neighbor":[9,31],"search":[10,32,47,67,93,99],"in":[11,33,84],"high":[12,36],"dimensional":[13],"data.":[14],"The":[15],"theoretical":[16,51,89],"guarantees":[17,90,105],"and":[18,87,101],"the":[19,54,92,98,102,111],"empirical":[20],"performance":[21],"of":[22,106,118],"do":[24],"not":[25],"show":[26],"significant":[27],"improvements":[28],"over":[29],"brute-force":[30],"moderate":[34],"to":[35,62],"dimensions.":[37],"used":[41],"relatively":[42],"more":[43],"successfully":[44],"approximate":[46,66],"\\citemuja2009flann":[48],"but":[49],"lack":[50],"guarantees.":[52],"In":[53],"article,":[55],"we":[56],"build":[57],"upon":[58],"randomized-partition":[59],"trees":[60],"\\citedasgupta2013randomized":[61],"propose":[63],"based":[65],"schemes":[68],"with":[69,81],"$O(d":[70],"\u0142og":[71,74],"d":[72,85],"+":[73],"n)$":[75],"query":[76,103],"time":[77,104],"data":[79],"sets":[80],"n":[82],"points":[83],"dimensions":[86],"rigorous":[88],"on":[91],"accuracy.":[94,119],"We":[95],"empirically":[96],"validate":[97],"accuracy":[100],"our":[107],"proposed":[108],"schemes,":[109],"demonstrating":[110],"significantly":[112],"improved":[113],"scaling":[114],"same":[116],"level":[117]},"counts_by_year":[{"year":2026,"cited_by_count":14},{"year":2025,"cited_by_count":35},{"year":2024,"cited_by_count":31},{"year":2023,"cited_by_count":23},{"year":2022,"cited_by_count":12},{"year":2021,"cited_by_count":10},{"year":2020,"cited_by_count":8}],"updated_date":"2026-04-03T22:45:19.894376","created_date":"2025-10-10T00:00:00"}