{"id":"https://openalex.org/W1685341657","doi":"https://doi.org/10.1007/978-3-540-79228-4_48","title":"Search Space Reductions for Nearest-Neighbor Queries","display_name":"Search Space Reductions for Nearest-Neighbor Queries","publication_year":2008,"publication_date":"2008-04-29","ids":{"openalex":"https://openalex.org/W1685341657","doi":"https://doi.org/10.1007/978-3-540-79228-4_48","mag":"1685341657"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-79228-4_48","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-79228-4_48","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","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/A5014172485","display_name":"Micah Adler","orcid":null},"institutions":[{"id":"https://openalex.org/I24603500","display_name":"University of Massachusetts Amherst","ror":"https://ror.org/0072zz521","country_code":"US","type":"education","lineage":["https://openalex.org/I24603500"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Micah Adler","raw_affiliation_strings":["Department of Computer Science, University of Massachusetts, Amherst, 140 Governors Drive Amherst, MA 01003,","Department of Computer Science, University of Massachusetts, Amherst, Amherst, MA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Massachusetts, Amherst, 140 Governors Drive Amherst, MA 01003,","institution_ids":["https://openalex.org/I24603500"]},{"raw_affiliation_string":"Department of Computer Science, University of Massachusetts, Amherst, Amherst, MA","institution_ids":["https://openalex.org/I24603500"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074092217","display_name":"Brent Heeringa","orcid":null},"institutions":[{"id":"https://openalex.org/I22675022","display_name":"Williams College","ror":"https://ror.org/04avkmd49","country_code":"US","type":"education","lineage":["https://openalex.org/I22675022"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Brent Heeringa","raw_affiliation_strings":["Department of Computer Science, Williams College, Williamstown, MA, 01267,","Dept. of Computer Science, Williams College, Williamstown, MA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Williams College, Williamstown, MA, 01267,","institution_ids":["https://openalex.org/I22675022"]},{"raw_affiliation_string":"Dept. of Computer Science, Williams College, Williamstown, MA#TAB#","institution_ids":["https://openalex.org/I22675022"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.9492,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.68890246,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"554","last_page":"567"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998999834060669,"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.9998999834060669,"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/T13282","display_name":"Automated Road and Building Extraction","score":0.9957000017166138,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean 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/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.987500011920929,"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/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.837213397026062},{"id":"https://openalex.org/keywords/best-bin-first","display_name":"Best bin first","score":0.8029645681381226},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.794303297996521},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.760858416557312},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.7037596702575684},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.6338452696800232},{"id":"https://openalex.org/keywords/nearest-neighbor-chain-algorithm","display_name":"Nearest-neighbor chain algorithm","score":0.5471254587173462},{"id":"https://openalex.org/keywords/cover-tree","display_name":"Cover tree","score":0.5399740934371948},{"id":"https://openalex.org/keywords/fixed-radius-near-neighbors","display_name":"Fixed-radius near neighbors","score":0.523301899433136},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.503839910030365},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.468961626291275},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.45428940653800964},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4306299090385437},{"id":"https://openalex.org/keywords/nearest-neighbor-graph","display_name":"Nearest neighbor graph","score":0.4275834560394287},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.41994065046310425},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3980522155761719},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.30380722880363464},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.2871191203594208},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.21806451678276062},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.13189047574996948}],"concepts":[{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.837213397026062},{"id":"https://openalex.org/C161986146","wikidata":"https://www.wikidata.org/wiki/Q4896845","display_name":"Best bin first","level":3,"score":0.8029645681381226},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.794303297996521},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.760858416557312},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.7037596702575684},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.6338452696800232},{"id":"https://openalex.org/C102164700","wikidata":"https://www.wikidata.org/wiki/Q17162702","display_name":"Nearest-neighbor chain algorithm","level":5,"score":0.5471254587173462},{"id":"https://openalex.org/C53661774","wikidata":"https://www.wikidata.org/wiki/Q13108095","display_name":"Cover tree","level":5,"score":0.5399740934371948},{"id":"https://openalex.org/C46264003","wikidata":"https://www.wikidata.org/wiki/Q5456333","display_name":"Fixed-radius near neighbors","level":5,"score":0.523301899433136},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.503839910030365},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.468961626291275},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.45428940653800964},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4306299090385437},{"id":"https://openalex.org/C90988772","wikidata":"https://www.wikidata.org/wiki/Q2855103","display_name":"Nearest neighbor graph","level":3,"score":0.4275834560394287},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.41994065046310425},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3980522155761719},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.30380722880363464},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.2871191203594208},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.21806451678276062},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.13189047574996948},{"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/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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":2,"locations":[{"id":"doi:10.1007/978-3-540-79228-4_48","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-79228-4_48","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.219.668","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.219.668","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.umass.edu/~heeringa/publications/heeringa-tamc.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W96629302","https://openalex.org/W1552694902","https://openalex.org/W1604713212","https://openalex.org/W1633222579","https://openalex.org/W1990111898","https://openalex.org/W2046144220","https://openalex.org/W2070074980","https://openalex.org/W2104128006","https://openalex.org/W2118269922","https://openalex.org/W2124222502","https://openalex.org/W2131620262","https://openalex.org/W2132082507","https://openalex.org/W2151135734","https://openalex.org/W2997027240","https://openalex.org/W4242599275"],"related_works":["https://openalex.org/W1558159560","https://openalex.org/W2182477562","https://openalex.org/W2375128115","https://openalex.org/W1595303882","https://openalex.org/W4246757943","https://openalex.org/W2245581955","https://openalex.org/W2351157934","https://openalex.org/W325985789","https://openalex.org/W2902799860","https://openalex.org/W4289129280"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-08-04T08:18:43.703281","created_date":"2025-10-10T00:00:00"}