{"id":"https://openalex.org/W2571415506","doi":"https://doi.org/10.1137/110852711","title":"Approximate Nearest Neighbor Search for Low-Dimensional Queries","display_name":"Approximate Nearest Neighbor Search for Low-Dimensional Queries","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W2571415506","doi":"https://doi.org/10.1137/110852711","mag":"2571415506"},"language":"en","primary_location":{"id":"doi:10.1137/110852711","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110852711","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/A5040577923","display_name":"Sariel Har-Peled","orcid":"https://orcid.org/0000-0003-2638-9635"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Sariel Har-Peled","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5074936673","display_name":"Nirman Kumar","orcid":"https://orcid.org/0000-0001-6601-2790"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nirman Kumar","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5040577923"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.2768,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.82019445,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"42","issue":"1","first_page":"138","last_page":"159"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9994000196456909,"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.9994000196456909,"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/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9991999864578247,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9987999796867371,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.8882722854614258},{"id":"https://openalex.org/keywords/cover-tree","display_name":"Cover tree","score":0.7890819907188416},{"id":"https://openalex.org/keywords/best-bin-first","display_name":"Best bin first","score":0.7601189613342285},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.7567766904830933},{"id":"https://openalex.org/keywords/curse-of-dimensionality","display_name":"Curse of dimensionality","score":0.7546805739402771},{"id":"https://openalex.org/keywords/nearest-neighbor-graph","display_name":"Nearest neighbor graph","score":0.7435474991798401},{"id":"https://openalex.org/keywords/large-margin-nearest-neighbor","display_name":"Large margin nearest neighbor","score":0.7366299033164978},{"id":"https://openalex.org/keywords/subspace-topology","display_name":"Subspace topology","score":0.7331730127334595},{"id":"https://openalex.org/keywords/fixed-radius-near-neighbors","display_name":"Fixed-radius near neighbors","score":0.6933196783065796},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.6513559222221375},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.6456847190856934},{"id":"https://openalex.org/keywords/intrinsic-dimension","display_name":"Intrinsic dimension","score":0.5993912220001221},{"id":"https://openalex.org/keywords/metric-space","display_name":"Metric space","score":0.499053955078125},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4447687268257141},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.44084253907203674},{"id":"https://openalex.org/keywords/nearest-neighbor-chain-algorithm","display_name":"Nearest-neighbor chain algorithm","score":0.42849379777908325},{"id":"https://openalex.org/keywords/dimensionality-reduction","display_name":"Dimensionality reduction","score":0.4174205958843231},{"id":"https://openalex.org/keywords/data-point","display_name":"Data point","score":0.4163917303085327},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3338322937488556},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.30189865827560425},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.24050483107566833},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2099924087524414},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.1863689422607422}],"concepts":[{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.8882722854614258},{"id":"https://openalex.org/C53661774","wikidata":"https://www.wikidata.org/wiki/Q13108095","display_name":"Cover tree","level":5,"score":0.7890819907188416},{"id":"https://openalex.org/C161986146","wikidata":"https://www.wikidata.org/wiki/Q4896845","display_name":"Best bin first","level":3,"score":0.7601189613342285},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.7567766904830933},{"id":"https://openalex.org/C111030470","wikidata":"https://www.wikidata.org/wiki/Q1430460","display_name":"Curse of dimensionality","level":2,"score":0.7546805739402771},{"id":"https://openalex.org/C90988772","wikidata":"https://www.wikidata.org/wiki/Q2855103","display_name":"Nearest neighbor graph","level":3,"score":0.7435474991798401},{"id":"https://openalex.org/C94475309","wikidata":"https://www.wikidata.org/wiki/Q6489154","display_name":"Large margin nearest neighbor","level":3,"score":0.7366299033164978},{"id":"https://openalex.org/C32834561","wikidata":"https://www.wikidata.org/wiki/Q660730","display_name":"Subspace topology","level":2,"score":0.7331730127334595},{"id":"https://openalex.org/C46264003","wikidata":"https://www.wikidata.org/wiki/Q5456333","display_name":"Fixed-radius near neighbors","level":5,"score":0.6933196783065796},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.6513559222221375},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.6456847190856934},{"id":"https://openalex.org/C30732413","wikidata":"https://www.wikidata.org/wiki/Q17092636","display_name":"Intrinsic dimension","level":3,"score":0.5993912220001221},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.499053955078125},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4447687268257141},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44084253907203674},{"id":"https://openalex.org/C102164700","wikidata":"https://www.wikidata.org/wiki/Q17162702","display_name":"Nearest-neighbor chain algorithm","level":5,"score":0.42849379777908325},{"id":"https://openalex.org/C70518039","wikidata":"https://www.wikidata.org/wiki/Q16000077","display_name":"Dimensionality reduction","level":2,"score":0.4174205958843231},{"id":"https://openalex.org/C21080849","wikidata":"https://www.wikidata.org/wiki/Q13611879","display_name":"Data point","level":2,"score":0.4163917303085327},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3338322937488556},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.30189865827560425},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.24050483107566833},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2099924087524414},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.1863689422607422},{"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/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","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/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/110852711","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110852711","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1997744504","https://openalex.org/W2007273639","https://openalex.org/W2016400774","https://openalex.org/W2024930473","https://openalex.org/W2038276547","https://openalex.org/W2045134120","https://openalex.org/W2054011861","https://openalex.org/W2061845601","https://openalex.org/W2088101210","https://openalex.org/W2397770138","https://openalex.org/W2427881153","https://openalex.org/W2583644876","https://openalex.org/W2979473749"],"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":{"We":[0,31],"study":[1],"the":[2,11,26,41,45],"approximate":[3],"nearest":[4],"neighbor":[5],"problem":[6,35],"for":[7],"metric":[8],"spaces":[9],"where":[10],"query":[12],"points":[13],"are":[14],"constrained":[15],"to":[16],"lie":[17],"on":[18],"a":[19],"subspace":[20],"of":[21,44],"low":[22],"doubling":[23],"dimension,":[24],"while":[25],"data":[27],"is":[28],"high":[29,42],"dimensional.":[30],"show":[32],"that":[33],"this":[34],"can":[36],"be":[37],"solved":[38],"efficiently":[39],"despite":[40],"dimensionality":[43],"data.":[46]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}