{"id":"https://openalex.org/W2950563475","doi":"https://doi.org/10.1145/2463664.2465219","title":"Nearest neighbor searching under uncertainty II","display_name":"Nearest neighbor searching under uncertainty II","publication_year":2013,"publication_date":"2013-06-22","ids":{"openalex":"https://openalex.org/W2950563475","doi":"https://doi.org/10.1145/2463664.2465219","mag":"2950563475"},"language":"en","primary_location":{"id":"doi:10.1145/2463664.2465219","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2463664.2465219","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGAI symposium on Principles of database systems","raw_type":"proceedings-article"},"type":"preprint","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/A5058649592","display_name":"Pankaj K. Agarwal","orcid":"https://orcid.org/0000-0002-9439-181X"},"institutions":[{"id":"https://openalex.org/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Pankaj K. Agarwal","raw_affiliation_strings":["Duke University, Durham, NC, USA"],"affiliations":[{"raw_affiliation_string":"Duke University, Durham, NC, USA","institution_ids":["https://openalex.org/I170897317"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042232059","display_name":"Boris Aronov","orcid":"https://orcid.org/0000-0003-3110-4702"},"institutions":[{"id":"https://openalex.org/I90965887","display_name":"SUNY Polytechnic Institute","ror":"https://ror.org/000fxgx19","country_code":"US","type":"education","lineage":["https://openalex.org/I90965887"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Boris Aronov","raw_affiliation_strings":["Polytechnic Institute of NYU, Brooklyn, New York, USA"],"affiliations":[{"raw_affiliation_string":"Polytechnic Institute of NYU, Brooklyn, New York, USA","institution_ids":["https://openalex.org/I90965887"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5040577923","display_name":"Sariel Har-Peled","orcid":"https://orcid.org/0000-0003-2638-9635"},"institutions":[{"id":"https://openalex.org/I2801919071","display_name":"University of Illinois System","ror":"https://ror.org/05e94g991","country_code":"US","type":"education","lineage":["https://openalex.org/I2801919071"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sariel Har-Peled","raw_affiliation_strings":["University of Illinois, Urbana, IL , USA"],"affiliations":[{"raw_affiliation_string":"University of Illinois, Urbana, IL , USA","institution_ids":["https://openalex.org/I2801919071"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5017619650","display_name":"Jeff M. Phillips","orcid":"https://orcid.org/0000-0003-1169-2965"},"institutions":[{"id":"https://openalex.org/I223532165","display_name":"University of Utah","ror":"https://ror.org/03r0ha626","country_code":"US","type":"education","lineage":["https://openalex.org/I223532165"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jeff M. Phillips","raw_affiliation_strings":["University of Utah, Salt Lake City, UT, USA"],"affiliations":[{"raw_affiliation_string":"University of Utah, Salt Lake City, UT, USA","institution_ids":["https://openalex.org/I223532165"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5009196125","display_name":"Ke Yi","orcid":"https://orcid.org/0000-0002-2178-3716"},"institutions":[{"id":"https://openalex.org/I889458895","display_name":"University of Hong Kong","ror":"https://ror.org/02zhqgq86","country_code":"HK","type":"education","lineage":["https://openalex.org/I889458895"]},{"id":"https://openalex.org/I200769079","display_name":"Hong Kong University of Science and Technology","ror":"https://ror.org/00q4vv597","country_code":"HK","type":"education","lineage":["https://openalex.org/I200769079"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Ke Yi","raw_affiliation_strings":["Hong Kong University of Science and Technology, Hong Kong, China, China"],"affiliations":[{"raw_affiliation_string":"Hong Kong University of Science and Technology, Hong Kong, China, China","institution_ids":["https://openalex.org/I200769079","https://openalex.org/I889458895"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061287304","display_name":"Wuzhou Zhang","orcid":"https://orcid.org/0000-0002-1270-5222"},"institutions":[{"id":"https://openalex.org/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Wuzhou Zhang","raw_affiliation_strings":["Duke University, Durham, NC, USA"],"affiliations":[{"raw_affiliation_string":"Duke University, Durham, NC, USA","institution_ids":["https://openalex.org/I170897317"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5058649592"],"corresponding_institution_ids":["https://openalex.org/I170897317"],"apc_list":null,"apc_paid":null,"fwci":3.5469177,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.94241908,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"115","last_page":"126"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.9961000084877014,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.8544418215751648},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.7484503388404846},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6319468021392822},{"id":"https://openalex.org/keywords/fixed-radius-near-neighbors","display_name":"Fixed-radius near neighbors","score":0.5936769247055054},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5803536772727966},{"id":"https://openalex.org/keywords/large-margin-nearest-neighbor","display_name":"Large margin nearest neighbor","score":0.5691182613372803},{"id":"https://openalex.org/keywords/best-bin-first","display_name":"Best bin first","score":0.553961992263794},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.5340994596481323},{"id":"https://openalex.org/keywords/nearest-neighbor-graph","display_name":"Nearest neighbor graph","score":0.5238654017448425},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5108429789543152},{"id":"https://openalex.org/keywords/probability-distribution","display_name":"Probability distribution","score":0.4907580316066742},{"id":"https://openalex.org/keywords/nearest-neighbor-chain-algorithm","display_name":"Nearest-neighbor chain algorithm","score":0.45749932527542114},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.4531259536743164},{"id":"https://openalex.org/keywords/cover-tree","display_name":"Cover tree","score":0.4463660418987274},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.42863136529922485},{"id":"https://openalex.org/keywords/range-query","display_name":"Range query (database)","score":0.42227381467819214},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40813854336738586},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.35111790895462036},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2655014395713806},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.13456648588180542},{"id":"https://openalex.org/keywords/search-engine","display_name":"Search engine","score":0.09128400683403015},{"id":"https://openalex.org/keywords/web-query-classification","display_name":"Web query classification","score":0.08694928884506226},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.07187414169311523}],"concepts":[{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.8544418215751648},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.7484503388404846},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6319468021392822},{"id":"https://openalex.org/C46264003","wikidata":"https://www.wikidata.org/wiki/Q5456333","display_name":"Fixed-radius near neighbors","level":5,"score":0.5936769247055054},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5803536772727966},{"id":"https://openalex.org/C94475309","wikidata":"https://www.wikidata.org/wiki/Q6489154","display_name":"Large margin nearest neighbor","level":3,"score":0.5691182613372803},{"id":"https://openalex.org/C161986146","wikidata":"https://www.wikidata.org/wiki/Q4896845","display_name":"Best bin first","level":3,"score":0.553961992263794},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.5340994596481323},{"id":"https://openalex.org/C90988772","wikidata":"https://www.wikidata.org/wiki/Q2855103","display_name":"Nearest neighbor graph","level":3,"score":0.5238654017448425},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5108429789543152},{"id":"https://openalex.org/C149441793","wikidata":"https://www.wikidata.org/wiki/Q200726","display_name":"Probability distribution","level":2,"score":0.4907580316066742},{"id":"https://openalex.org/C102164700","wikidata":"https://www.wikidata.org/wiki/Q17162702","display_name":"Nearest-neighbor chain algorithm","level":5,"score":0.45749932527542114},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.4531259536743164},{"id":"https://openalex.org/C53661774","wikidata":"https://www.wikidata.org/wiki/Q13108095","display_name":"Cover tree","level":5,"score":0.4463660418987274},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.42863136529922485},{"id":"https://openalex.org/C136736807","wikidata":"https://www.wikidata.org/wiki/Q818943","display_name":"Range query (database)","level":5,"score":0.42227381467819214},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40813854336738586},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.35111790895462036},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2655014395713806},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.13456648588180542},{"id":"https://openalex.org/C97854310","wikidata":"https://www.wikidata.org/wiki/Q19541","display_name":"Search engine","level":2,"score":0.09128400683403015},{"id":"https://openalex.org/C118689300","wikidata":"https://www.wikidata.org/wiki/Q7978614","display_name":"Web query classification","level":4,"score":0.08694928884506226},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.07187414169311523},{"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/C164120249","wikidata":"https://www.wikidata.org/wiki/Q995982","display_name":"Web search query","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},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2463664.2465219","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2463664.2465219","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGAI symposium on Principles of database systems","raw_type":"proceedings-article"},{"id":"pmh:oai:repository.hkust.edu.hk:1783.1-57959","is_oa":false,"landing_page_url":"http://repository.hkust.edu.hk/ir/Record/1783.1-57959","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Conference paper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W166438205","https://openalex.org/W1490591387","https://openalex.org/W1491547607","https://openalex.org/W1547671143","https://openalex.org/W1584486777","https://openalex.org/W1990724681","https://openalex.org/W1991417304","https://openalex.org/W2002558490","https://openalex.org/W2013333366","https://openalex.org/W2022501110","https://openalex.org/W2027277859","https://openalex.org/W2027387410","https://openalex.org/W2028747718","https://openalex.org/W2029538739","https://openalex.org/W2034518740","https://openalex.org/W2048729985","https://openalex.org/W2074907599","https://openalex.org/W2093149131","https://openalex.org/W2099700811","https://openalex.org/W2103895255","https://openalex.org/W2107475398","https://openalex.org/W2119493805","https://openalex.org/W2121161268","https://openalex.org/W2133246278","https://openalex.org/W2142947709","https://openalex.org/W2161871333","https://openalex.org/W2167140130","https://openalex.org/W2168638620","https://openalex.org/W2295428206","https://openalex.org/W2913207943","https://openalex.org/W3102176745","https://openalex.org/W4206206918","https://openalex.org/W4213048098","https://openalex.org/W4238284510"],"related_works":["https://openalex.org/W4246757943","https://openalex.org/W2182477562","https://openalex.org/W1595303882","https://openalex.org/W1558159560","https://openalex.org/W2375128115","https://openalex.org/W2351157934","https://openalex.org/W325985789","https://openalex.org/W2795392346","https://openalex.org/W2245581955","https://openalex.org/W2526367648"],"abstract_inverted_index":{"Nearest-neighbor":[0],"(NN)":[1],"search,":[2],"which":[3,66],"returns":[4],"the":[5,49,67,107,113,125,129,132,137,147,157],"nearest":[6,58,91,114,133],"neighbor":[7,59,115],"of":[8,15,32,36,51,69,93,109,116,159],"a":[9,13,62,76,94,103,110,117],"query":[10,95,118],"point":[11,72,96,111,126],"in":[12,24,61,65],"set":[14],"points,":[16],"is":[17,53,73],"an":[18],"important":[19],"and":[20,27,46],"widely":[21],"studied":[22],"problem":[23],"many":[25,35],"fields,":[26],"it":[28,122],"has":[29],"wide":[30],"range":[31],"applications.":[33],"In":[34],"them,":[37],"such":[38],"as":[39,75],"sensor":[40],"databases,":[41],"location-based":[42],"services,":[43],"face":[44],"recognition,":[45],"mobile":[47],"data,":[48],"location":[50,68],"data":[52],"imprecise.":[54],"We":[55,80,149],"therefore":[56],"study":[57],"queries":[60],"probabilistic":[63],"framework":[64],"each":[70],"input":[71],"specified":[74,104],"probability":[77,108,130],"distribution":[78],"function.":[79],"present":[81,151],"efficient":[82],"algorithms":[83],"for":[84],"(i)":[85],"computing":[86],"all":[87,136],"points":[88,138],"that":[89,127],"are":[90],"neighbors":[92],"with":[97,139],"nonzero":[98],"probability;":[99],"(ii)":[100],"estimating,":[101],"within":[102],"additive":[105],"error,":[106],"being":[112,131],"point;":[119],"(iii)":[120],"using":[121],"to":[123,145,155],"return":[124],"maximizes":[128],"neighbor,":[134],"or":[135],"probabilities":[140],"greater":[141],"than":[142],"some":[143,152],"threshold":[144],"be":[146],"NN.":[148],"also":[150],"experimental":[153],"results":[154],"demonstrate":[156],"effectiveness":[158],"our":[160],"approach.":[161]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}