{"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":{"id":"doi:10.1137/s0097539799366340","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_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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-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/A5022760571","display_name":"Sunil Arya","orcid":"https://orcid.org/0000-0003-0939-4192"},"institutions":[],"countries":[],"is_corresponding":true,"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":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5022760571"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2928,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.56724585,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"32","issue":"3","first_page":"793","last_page":"815"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9997000098228455,"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.9997000098228455,"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.9994000196456909,"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.9991000294685364,"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.640180766582489},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.629921555519104},{"id":"https://openalex.org/keywords/best-bin-first","display_name":"Best bin first","score":0.5311851501464844},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.44552081823349},{"id":"https://openalex.org/keywords/cover-tree","display_name":"Cover tree","score":0.43415483832359314},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4312407970428467},{"id":"https://openalex.org/keywords/nearest-neighbor-graph","display_name":"Nearest neighbor graph","score":0.4206363260746002},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4181599020957947},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.40348607301712036},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3189111351966858},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2780590057373047},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.10647112131118774}],"concepts":[{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.640180766582489},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.629921555519104},{"id":"https://openalex.org/C161986146","wikidata":"https://www.wikidata.org/wiki/Q4896845","display_name":"Best bin first","level":3,"score":0.5311851501464844},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.44552081823349},{"id":"https://openalex.org/C53661774","wikidata":"https://www.wikidata.org/wiki/Q13108095","display_name":"Cover tree","level":5,"score":0.43415483832359314},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4312407970428467},{"id":"https://openalex.org/C90988772","wikidata":"https://www.wikidata.org/wiki/Q2855103","display_name":"Nearest neighbor graph","level":3,"score":0.4206363260746002},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4181599020957947},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.40348607301712036},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3189111351966858},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2780590057373047},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.10647112131118774},{"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/C104047586","wikidata":"https://www.wikidata.org/wiki/Q5033439","display_name":"Canopy clustering algorithm","level":4,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/s0097539799366340","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_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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:repository.hkust.edu.hk:1783.1-30202","is_oa":false,"landing_page_url":"http://repository.hkust.edu.hk/ir/Record/1783.1-30202","pdf_url":null,"source":{"id":"https://openalex.org/S4306401796","display_name":"Rare & Special e-Zone (The Hong Kong University of Science and Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I200769079","host_organization_name":"Hong Kong University of Science and Technology","host_organization_lineage":["https://openalex.org/I200769079"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"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/W4246757943","https://openalex.org/W1558159560","https://openalex.org/W2182477562","https://openalex.org/W1595303882","https://openalex.org/W2245581955","https://openalex.org/W2375128115","https://openalex.org/W2351157934","https://openalex.org/W2902799860","https://openalex.org/W3096071782","https://openalex.org/W4289129280"],"abstract_inverted_index":{"Most":[0],"research":[1],"in":[2,54,110,114,128,141,155],"algorithms":[3,30,135],"for":[4],"geometric":[5],"query":[6,19,61,108,126,153],"problems":[7],"has":[8],"focused":[9],"on":[10,17,80,136],"their":[11],"worst-case":[12],"performance.":[13],"However,":[14],"when":[15],"information":[16],"the":[18,23,32,42,60,72,81,84,96,111,116,129,147],"distribution":[20,82],"is":[21,100],"available,":[22],"alternative":[24],"paradigm":[25],"of":[26,34,83,159],"designing":[27],"and":[28,106,124,134],"analyzing":[29],"from":[31,47,66],"perspective":[33],"expected-case":[35],"performance":[36],"appears":[37],"more":[38,139],"attractive.":[39],"We":[40,87],"study":[41],"approximate":[43],"nearest":[44],"neighbor":[45],"problem":[46],"this":[48,55],"perspective.":[49],"As":[50],"a":[51,67,91,156],"first":[52],"step":[53],"direction,":[56],"we":[57,76,144],"assume":[58],"that":[59,69,89,146],"points":[62],"are":[63,132],"sampled":[64],"uniformly":[65],"hypercube":[68],"encloses":[70],"all":[71],"data":[73,85,117],"points;":[74],"however,":[75],"make":[77],"no":[78],"assumption":[79],"points.":[86],"show":[88],"with":[90],"simple":[92],"partition":[93],"tree,":[94,98],"called":[95],"sliding-midpoint":[97,148],"it":[99],"possible":[101],"to":[102,120],"achieve":[103,121],"linear":[104,122],"space":[105,123],"logarithmic":[107,125],"time":[109,127,154],"expected":[112,152],"case;":[113],"contrast,":[115],"structures":[118],"known":[119],"worst":[130],"case":[131],"complex,":[133],"them":[137],"run":[138],"slowly":[140],"practice.":[142],"Moreover,":[143],"prove":[145],"tree":[149],"achieves":[150],"optimal":[151],"certain":[157],"class":[158],"algorithms.":[160]},"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-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}