{"id":"https://openalex.org/W2892992647","doi":"https://doi.org/10.1007/978-3-030-04651-4_31","title":"An Algorithm for Reducing Approximate Nearest Neighbor to Approximate Near Neighbor with $$O(\\log {n})$$ Query Time","display_name":"An Algorithm for Reducing Approximate Nearest Neighbor to Approximate Near Neighbor with $$O(\\log {n})$$ Query Time","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2892992647","doi":"https://doi.org/10.1007/978-3-030-04651-4_31","mag":"2892992647"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-030-04651-4_31","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-04651-4_31","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/A5002039681","display_name":"Hengzhao Ma","orcid":"https://orcid.org/0000-0002-2769-6138"},"institutions":[{"id":"https://openalex.org/I204983213","display_name":"Harbin Institute of Technology","ror":"https://ror.org/01yqg2h08","country_code":"CN","type":"education","lineage":["https://openalex.org/I204983213"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Hengzhao Ma","raw_affiliation_strings":["Harbin Institute of Technology, Harbin, 150001, Heilongjiang, China"],"affiliations":[{"raw_affiliation_string":"Harbin Institute of Technology, Harbin, 150001, Heilongjiang, China","institution_ids":["https://openalex.org/I204983213"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100387065","display_name":"Jianzhong Li","orcid":"https://orcid.org/0000-0002-4119-0571"},"institutions":[{"id":"https://openalex.org/I204983213","display_name":"Harbin Institute of Technology","ror":"https://ror.org/01yqg2h08","country_code":"CN","type":"education","lineage":["https://openalex.org/I204983213"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jianzhong Li","raw_affiliation_strings":["Harbin Institute of Technology, Harbin, 150001, Heilongjiang, China"],"affiliations":[{"raw_affiliation_string":"Harbin Institute of Technology, Harbin, 150001, Heilongjiang, China","institution_ids":["https://openalex.org/I204983213"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5002039681"],"corresponding_institution_ids":["https://openalex.org/I204983213"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.2722,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.73209833,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"465","last_page":"479"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9994000196456909,"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"}},"topics":[{"id":"https://openalex.org/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9994000196456909,"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.9973000288009644,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9957000017166138,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.7434725761413574},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6966835260391235},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.6012145280838013},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5619140267372131},{"id":"https://openalex.org/keywords/best-bin-first","display_name":"Best bin first","score":0.5606064796447754},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5264580845832825},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5141084790229797},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.50677090883255},{"id":"https://openalex.org/keywords/query-optimization","display_name":"Query optimization","score":0.4906415045261383},{"id":"https://openalex.org/keywords/nearest-neighbor-chain-algorithm","display_name":"Nearest-neighbor chain algorithm","score":0.453495591878891},{"id":"https://openalex.org/keywords/fixed-radius-near-neighbors","display_name":"Fixed-radius near neighbors","score":0.4470847249031067},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4409981667995453},{"id":"https://openalex.org/keywords/nearest-neighbor-graph","display_name":"Nearest neighbor graph","score":0.4192933440208435},{"id":"https://openalex.org/keywords/database-query","display_name":"Database query","score":0.41035541892051697},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.26659664511680603},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2193182408809662},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.14501163363456726},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.061108678579330444}],"concepts":[{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.7434725761413574},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6966835260391235},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.6012145280838013},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5619140267372131},{"id":"https://openalex.org/C161986146","wikidata":"https://www.wikidata.org/wiki/Q4896845","display_name":"Best bin first","level":3,"score":0.5606064796447754},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5264580845832825},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5141084790229797},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.50677090883255},{"id":"https://openalex.org/C157692150","wikidata":"https://www.wikidata.org/wiki/Q2919848","display_name":"Query optimization","level":2,"score":0.4906415045261383},{"id":"https://openalex.org/C102164700","wikidata":"https://www.wikidata.org/wiki/Q17162702","display_name":"Nearest-neighbor chain algorithm","level":5,"score":0.453495591878891},{"id":"https://openalex.org/C46264003","wikidata":"https://www.wikidata.org/wiki/Q5456333","display_name":"Fixed-radius near neighbors","level":5,"score":0.4470847249031067},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4409981667995453},{"id":"https://openalex.org/C90988772","wikidata":"https://www.wikidata.org/wiki/Q2855103","display_name":"Nearest neighbor graph","level":3,"score":0.4192933440208435},{"id":"https://openalex.org/C2989070954","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database query","level":2,"score":0.41035541892051697},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.26659664511680603},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2193182408809662},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.14501163363456726},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.061108678579330444},{"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},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-030-04651-4_31","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-04651-4_31","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1971238646","https://openalex.org/W1998512964","https://openalex.org/W2011415853","https://openalex.org/W2017851434","https://openalex.org/W2027673602","https://openalex.org/W2034188144","https://openalex.org/W2054011861","https://openalex.org/W2055051624","https://openalex.org/W2071572981","https://openalex.org/W2088101210","https://openalex.org/W2104232723","https://openalex.org/W2133311553","https://openalex.org/W2145065594","https://openalex.org/W2147717514","https://openalex.org/W2162006472","https://openalex.org/W2397770138","https://openalex.org/W2427881153","https://openalex.org/W2892992647","https://openalex.org/W2952258978","https://openalex.org/W2953019775"],"related_works":["https://openalex.org/W2182477562","https://openalex.org/W2375128115","https://openalex.org/W1558159560","https://openalex.org/W1595303882","https://openalex.org/W2351157934","https://openalex.org/W2969538544","https://openalex.org/W2795392346","https://openalex.org/W4246757943","https://openalex.org/W2085998272","https://openalex.org/W2389800992"],"abstract_inverted_index":null,"counts_by_year":[{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}