{"id":"https://openalex.org/W1517388762","doi":"https://doi.org/10.1007/11687238_15","title":"Approximation Techniques to Enable Dimensionality Reduction for Voronoi-Based Nearest Neighbor Search","display_name":"Approximation Techniques to Enable Dimensionality Reduction for Voronoi-Based Nearest Neighbor Search","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W1517388762","doi":"https://doi.org/10.1007/11687238_15","mag":"1517388762"},"language":"en","primary_location":{"id":"doi:10.1007/11687238_15","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11687238_15","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":"book-chapter","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/A5034568688","display_name":"Christoph Brochhaus","orcid":null},"institutions":[{"id":"https://openalex.org/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Christoph Brochhaus","raw_affiliation_strings":["Data Management and Exploration Group, RWTH Aachen University, Germany"],"affiliations":[{"raw_affiliation_string":"Data Management and Exploration Group, RWTH Aachen University, Germany","institution_ids":["https://openalex.org/I887968799"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024318819","display_name":"Marc Wichterich","orcid":null},"institutions":[{"id":"https://openalex.org/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Marc Wichterich","raw_affiliation_strings":["Data Management and Exploration Group, RWTH Aachen University, Germany"],"affiliations":[{"raw_affiliation_string":"Data Management and Exploration Group, RWTH Aachen University, Germany","institution_ids":["https://openalex.org/I887968799"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003335849","display_name":"Thomas Seidl","orcid":"https://orcid.org/0000-0002-4861-1412"},"institutions":[{"id":"https://openalex.org/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Thomas Seidl","raw_affiliation_strings":["Data Management and Exploration Group, RWTH Aachen University, Germany"],"affiliations":[{"raw_affiliation_string":"Data Management and Exploration Group, RWTH Aachen University, Germany","institution_ids":["https://openalex.org/I887968799"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5034568688"],"corresponding_institution_ids":["https://openalex.org/I887968799"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.1013715,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"204","last_page":"221"},"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/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9976000189781189,"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/T13282","display_name":"Automated Road and Building Extraction","score":0.98580002784729,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/voronoi-diagram","display_name":"Voronoi diagram","score":0.9217211008071899},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8005266189575195},{"id":"https://openalex.org/keywords/search-engine-indexing","display_name":"Search engine indexing","score":0.7945541143417358},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.7847766876220703},{"id":"https://openalex.org/keywords/dimensionality-reduction","display_name":"Dimensionality reduction","score":0.6963591575622559},{"id":"https://openalex.org/keywords/curse-of-dimensionality","display_name":"Curse of dimensionality","score":0.6962199807167053},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.6798146367073059},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.6179128289222717},{"id":"https://openalex.org/keywords/cover-tree","display_name":"Cover tree","score":0.5862429738044739},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.5078678727149963},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.49851560592651367},{"id":"https://openalex.org/keywords/space-partitioning","display_name":"Space partitioning","score":0.4894010126590729},{"id":"https://openalex.org/keywords/best-bin-first","display_name":"Best bin first","score":0.44857558608055115},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.4251786470413208},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33792394399642944},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.214086651802063},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.14148181676864624},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1366422176361084},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.07558080554008484}],"concepts":[{"id":"https://openalex.org/C24881265","wikidata":"https://www.wikidata.org/wiki/Q757267","display_name":"Voronoi diagram","level":2,"score":0.9217211008071899},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8005266189575195},{"id":"https://openalex.org/C75165309","wikidata":"https://www.wikidata.org/wiki/Q2258979","display_name":"Search engine indexing","level":2,"score":0.7945541143417358},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.7847766876220703},{"id":"https://openalex.org/C70518039","wikidata":"https://www.wikidata.org/wiki/Q16000077","display_name":"Dimensionality reduction","level":2,"score":0.6963591575622559},{"id":"https://openalex.org/C111030470","wikidata":"https://www.wikidata.org/wiki/Q1430460","display_name":"Curse of dimensionality","level":2,"score":0.6962199807167053},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.6798146367073059},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.6179128289222717},{"id":"https://openalex.org/C53661774","wikidata":"https://www.wikidata.org/wiki/Q13108095","display_name":"Cover tree","level":5,"score":0.5862429738044739},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.5078678727149963},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.49851560592651367},{"id":"https://openalex.org/C13670688","wikidata":"https://www.wikidata.org/wiki/Q3500548","display_name":"Space partitioning","level":2,"score":0.4894010126590729},{"id":"https://openalex.org/C161986146","wikidata":"https://www.wikidata.org/wiki/Q4896845","display_name":"Best bin first","level":3,"score":0.44857558608055115},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.4251786470413208},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33792394399642944},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.214086651802063},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.14148181676864624},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1366422176361084},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.07558080554008484},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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":1,"locations":[{"id":"doi:10.1007/11687238_15","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11687238_15","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W1520127302","https://openalex.org/W1538023239","https://openalex.org/W1540737951","https://openalex.org/W1541459201","https://openalex.org/W1555471913","https://openalex.org/W1723433588","https://openalex.org/W1994085050","https://openalex.org/W2015463411","https://openalex.org/W2022266599","https://openalex.org/W2041059091","https://openalex.org/W2046144220","https://openalex.org/W2067994867","https://openalex.org/W2109424811","https://openalex.org/W2118269922","https://openalex.org/W2118783153","https://openalex.org/W2129925734","https://openalex.org/W2135508918","https://openalex.org/W2151135734","https://openalex.org/W2153504150","https://openalex.org/W2155354516","https://openalex.org/W2160404300","https://openalex.org/W2238624099","https://openalex.org/W2332151900","https://openalex.org/W2432517183","https://openalex.org/W2493051178","https://openalex.org/W2981264952","https://openalex.org/W2997027240","https://openalex.org/W3213397929","https://openalex.org/W4300640952"],"related_works":["https://openalex.org/W4246757943","https://openalex.org/W1558159560","https://openalex.org/W2902799860","https://openalex.org/W2245581955","https://openalex.org/W3096071782","https://openalex.org/W4289129280","https://openalex.org/W1595303882","https://openalex.org/W2487311615","https://openalex.org/W2038472035","https://openalex.org/W2405216906"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}