{"id":"https://openalex.org/W1559170227","doi":"https://doi.org/10.1007/3-540-47749-7_35","title":"An Algorithm for Incremental Nearest Neighbor Search in High-Dimensional Data Spaces","display_name":"An Algorithm for Incremental Nearest Neighbor Search in High-Dimensional Data Spaces","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W1559170227","doi":"https://doi.org/10.1007/3-540-47749-7_35","mag":"1559170227"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-47749-7_35","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-47749-7_35","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/A5100609743","display_name":"Dongho Lee","orcid":"https://orcid.org/0000-0002-6801-9061"},"institutions":[{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Dong-Ho Lee","raw_affiliation_strings":["Department of Computer Science, KAIST, 373-1Yusung-Ku, Taejon, 305-701, Korea"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, KAIST, 373-1Yusung-Ku, Taejon, 305-701, Korea","institution_ids":["https://openalex.org/I157485424"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024186132","display_name":"Hyungdong Lee","orcid":"https://orcid.org/0000-0002-9819-1196"},"institutions":[{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Hyung-Dong Lee","raw_affiliation_strings":["Department of Computer Science, KAIST, 373-1Yusung-Ku, Taejon, 305-701, Korea"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, KAIST, 373-1Yusung-Ku, Taejon, 305-701, Korea","institution_ids":["https://openalex.org/I157485424"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090106846","display_name":"Il-Hwan Choi","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Il-Hwan Choi","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5102980943","display_name":"Hyoung-Joo Kim","orcid":"https://orcid.org/0000-0003-2574-720X"},"institutions":[{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Hyoung-Joo Kim","raw_affiliation_strings":["OOPSLA Laboratory School of Computer Science and Engineering, Seoul National University, Shilim-Dong Gwanak-Gu, Seoul, 151-742, KOREA"],"affiliations":[{"raw_affiliation_string":"OOPSLA Laboratory School of Computer Science and Engineering, Seoul National University, Shilim-Dong Gwanak-Gu, Seoul, 151-742, KOREA","institution_ids":["https://openalex.org/I139264467"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5100609743"],"corresponding_institution_ids":["https://openalex.org/I157485424"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.13128039,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"436","last_page":"453"},"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.9959999918937683,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9951000213623047,"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/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.8826906085014343},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.8041490316390991},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.7923859357833862},{"id":"https://openalex.org/keywords/best-bin-first","display_name":"Best bin first","score":0.7623896598815918},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7474019527435303},{"id":"https://openalex.org/keywords/search-engine-indexing","display_name":"Search engine indexing","score":0.7004331350326538},{"id":"https://openalex.org/keywords/large-margin-nearest-neighbor","display_name":"Large margin nearest neighbor","score":0.6049699783325195},{"id":"https://openalex.org/keywords/cover-tree","display_name":"Cover tree","score":0.5910823345184326},{"id":"https://openalex.org/keywords/pyramid","display_name":"Pyramid (geometry)","score":0.5759022235870361},{"id":"https://openalex.org/keywords/nearest-neighbor-graph","display_name":"Nearest neighbor graph","score":0.557715892791748},{"id":"https://openalex.org/keywords/nearest-neighbor-chain-algorithm","display_name":"Nearest-neighbor chain algorithm","score":0.5180866122245789},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.500298261642456},{"id":"https://openalex.org/keywords/metric-space","display_name":"Metric space","score":0.4741232693195343},{"id":"https://openalex.org/keywords/range-query","display_name":"Range query (database)","score":0.4577961564064026},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.45524993538856506},{"id":"https://openalex.org/keywords/k-d-tree","display_name":"k-d tree","score":0.41058894991874695},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.39605584740638733},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.3571113348007202},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2319331169128418},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.18508118391036987},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15865975618362427},{"id":"https://openalex.org/keywords/search-engine","display_name":"Search engine","score":0.09696626663208008}],"concepts":[{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.8826906085014343},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.8041490316390991},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.7923859357833862},{"id":"https://openalex.org/C161986146","wikidata":"https://www.wikidata.org/wiki/Q4896845","display_name":"Best bin first","level":3,"score":0.7623896598815918},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7474019527435303},{"id":"https://openalex.org/C75165309","wikidata":"https://www.wikidata.org/wiki/Q2258979","display_name":"Search engine indexing","level":2,"score":0.7004331350326538},{"id":"https://openalex.org/C94475309","wikidata":"https://www.wikidata.org/wiki/Q6489154","display_name":"Large margin nearest neighbor","level":3,"score":0.6049699783325195},{"id":"https://openalex.org/C53661774","wikidata":"https://www.wikidata.org/wiki/Q13108095","display_name":"Cover tree","level":5,"score":0.5910823345184326},{"id":"https://openalex.org/C142575187","wikidata":"https://www.wikidata.org/wiki/Q3358290","display_name":"Pyramid (geometry)","level":2,"score":0.5759022235870361},{"id":"https://openalex.org/C90988772","wikidata":"https://www.wikidata.org/wiki/Q2855103","display_name":"Nearest neighbor graph","level":3,"score":0.557715892791748},{"id":"https://openalex.org/C102164700","wikidata":"https://www.wikidata.org/wiki/Q17162702","display_name":"Nearest-neighbor chain algorithm","level":5,"score":0.5180866122245789},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.500298261642456},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.4741232693195343},{"id":"https://openalex.org/C136736807","wikidata":"https://www.wikidata.org/wiki/Q818943","display_name":"Range query (database)","level":5,"score":0.4577961564064026},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.45524993538856506},{"id":"https://openalex.org/C33721204","wikidata":"https://www.wikidata.org/wiki/Q309949","display_name":"k-d tree","level":3,"score":0.41058894991874695},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.39605584740638733},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.3571113348007202},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2319331169128418},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.18508118391036987},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15865975618362427},{"id":"https://openalex.org/C97854310","wikidata":"https://www.wikidata.org/wiki/Q19541","display_name":"Search engine","level":2,"score":0.09696626663208008},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.0},{"id":"https://openalex.org/C164120249","wikidata":"https://www.wikidata.org/wiki/Q995982","display_name":"Web search query","level":3,"score":0.0},{"id":"https://openalex.org/C192939062","wikidata":"https://www.wikidata.org/wiki/Q104840822","display_name":"Sargable","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/3-540-47749-7_35","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-47749-7_35","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":24,"referenced_works":["https://openalex.org/W29246612","https://openalex.org/W1529267782","https://openalex.org/W1672197616","https://openalex.org/W1770616178","https://openalex.org/W1972635511","https://openalex.org/W1975830550","https://openalex.org/W1977944418","https://openalex.org/W1990111898","https://openalex.org/W2000830496","https://openalex.org/W2020876977","https://openalex.org/W2046144220","https://openalex.org/W2066799613","https://openalex.org/W2068272887","https://openalex.org/W2068520194","https://openalex.org/W2091503252","https://openalex.org/W2104128006","https://openalex.org/W2108908993","https://openalex.org/W2118269922","https://openalex.org/W2133542527","https://openalex.org/W2145725688","https://openalex.org/W2155776210","https://openalex.org/W2164213684","https://openalex.org/W2165558283","https://openalex.org/W2238624099"],"related_works":["https://openalex.org/W2182477562","https://openalex.org/W2375128115","https://openalex.org/W2351157934","https://openalex.org/W4246757943","https://openalex.org/W2085998272","https://openalex.org/W1595303882","https://openalex.org/W1558159560","https://openalex.org/W2902799860","https://openalex.org/W4289129280","https://openalex.org/W3096071782"],"abstract_inverted_index":null,"counts_by_year":[{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}