{"id":"https://openalex.org/W2075261405","doi":"https://doi.org/10.1137/s0097539799366340","title":"Expected-Case Complexity of Approximate Nearest Neighbor Searching","display_name":"Expected-Case Complexity of Approximate Nearest Neighbor Searching","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W2075261405","doi":"https://doi.org/10.1137/s0097539799366340","mag":"2075261405"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539799366340","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_indexed_in_scopus":true,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"journal-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/A5022760571","display_name":"Sunil Arya","orcid":"https://orcid.org/0000-0003-0939-4192"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sunil Arya","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5075398364","display_name":"Ho-Yam Addy Fu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ho-Yam Addy Fu","raw_affiliation_strings":[],"affiliations":[]}],"institution_assertions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.263,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":8,"citation_normalized_percentile":{"value":0.703395,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":78,"max":79},"biblio":{"volume":"32","issue":"3","first_page":"793","last_page":"815"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9997,"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.9997,"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.9994,"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/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9991,"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/best-bin-first","display_name":"Best bin first","score":0.53118515},{"id":"https://openalex.org/keywords/cover-tree","display_name":"Cover tree","score":0.43415484},{"id":"https://openalex.org/keywords/nearest-neighbor-graph","display_name":"Nearest neighbor graph","score":0.42063633}],"concepts":[{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.64018077},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.62992156},{"id":"https://openalex.org/C161986146","wikidata":"https://www.wikidata.org/wiki/Q4896845","display_name":"Best bin first","level":3,"score":0.53118515},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.44552082},{"id":"https://openalex.org/C53661774","wikidata":"https://www.wikidata.org/wiki/Q13108095","display_name":"Cover tree","level":5,"score":0.43415484},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4312408},{"id":"https://openalex.org/C90988772","wikidata":"https://www.wikidata.org/wiki/Q2855103","display_name":"Nearest neighbor graph","level":3,"score":0.42063633},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4181599},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.40348607},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31891114},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.278059},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.10647112},{"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/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539799366340","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_indexed_in_scopus":true,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":11,"referenced_works":["https://openalex.org/W1972818834","https://openalex.org/W1995875735","https://openalex.org/W1998512964","https://openalex.org/W2024409132","https://openalex.org/W2024668293","https://openalex.org/W2144679084","https://openalex.org/W2147152072","https://openalex.org/W2151942047","https://openalex.org/W2427881153","https://openalex.org/W4210733153","https://openalex.org/W4244494905"],"related_works":["https://openalex.org/W4289129280","https://openalex.org/W4246757943","https://openalex.org/W3096071782","https://openalex.org/W2902799860","https://openalex.org/W2375128115","https://openalex.org/W2351157934","https://openalex.org/W2245581955","https://openalex.org/W2182477562","https://openalex.org/W1595303882","https://openalex.org/W1558159560"],"abstract_inverted_index":{"Most":[0],"research":[1],"in":[2,53,109,113,127,140,154],"algorithms":[3,30,134],"for":[4],"geometric":[5],"query":[6,19,60,107,125,152],"problems":[7],"has":[8],"focused":[9],"on":[10,17,79,135],"their":[11],"worst-case":[12],"performance.":[13],"However,":[14],"when":[15],"information":[16],"the":[18,23,32,42,59,71,80,83,95,110,115,128,146],"distribution":[20,81],"is":[21,99],"available,":[22],"alternative":[24],"paradigm":[25],"of":[26,34,82,158],"designing":[27],"and":[28,105,123,133],"analyzing":[29],"from":[31,47,65],"perspective":[33],"expected-case":[35],"performance":[36],"appears":[37],"more":[38,138],"attractive.":[39],"We":[40,86],"study":[41],"approximate":[43],"nearest":[44],"neighbor":[45],"problem":[46],"this":[48,54],"perspective.\r\nAs":[49],"a":[50,66,90,155],"first":[51],"step":[52],"direction,":[55],"we":[56,75,143],"assume":[57],"that":[58,68,88,145],"points":[61],"are":[62,131],"sampled":[63],"uniformly":[64],"hypercube":[67],"encloses":[69],"all":[70],"data":[72,84,116],"points;":[73],"however,":[74],"make":[76],"no":[77],"assumption":[78],"points.":[85],"show":[87],"with":[89],"simple":[91],"partition":[92],"tree,":[93,97],"called":[94],"sliding-midpoint":[96,147],"it":[98],"possible":[100],"to":[101,119],"achieve":[102,120],"linear":[103,121],"space":[104,122],"logarithmic":[106,124],"time":[108,126,153],"expected":[111,151],"case;":[112],"contrast,":[114],"structures":[117],"known":[118],"worst":[129],"case":[130],"complex,":[132],"them":[136],"run":[137],"slowly":[139],"practice.":[141],"Moreover,":[142],"prove":[144],"tree":[148],"achieves":[149],"optimal":[150],"certain":[156],"class":[157],"algorithms.":[159]},"abstract_inverted_index_v3":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2075261405","counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-03-15T18:38:45.044307","created_date":"2016-06-24"}