{"id":"https://openalex.org/W4410582391","doi":"https://doi.org/10.23919/date64628.2025.10992903","title":"Efficient Approximate Nearest Neighbor Search via Data-Adaptive Parameter Adjustment in Hierarchical Navigable Small Graphs","display_name":"Efficient Approximate Nearest Neighbor Search via Data-Adaptive Parameter Adjustment in Hierarchical Navigable Small Graphs","publication_year":2025,"publication_date":"2025-03-31","ids":{"openalex":"https://openalex.org/W4410582391","doi":"https://doi.org/10.23919/date64628.2025.10992903"},"language":"en","primary_location":{"id":"doi:10.23919/date64628.2025.10992903","is_oa":false,"landing_page_url":"https://doi.org/10.23919/date64628.2025.10992903","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 Design, Automation &amp;amp; Test in Europe Conference (DATE)","raw_type":"proceedings-article"},"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/A5109587242","display_name":"Huijun Jin","orcid":"https://orcid.org/0000-0002-8402-7897"},"institutions":[{"id":"https://openalex.org/I193775966","display_name":"Yonsei University","ror":"https://ror.org/01wjejq96","country_code":"KR","type":"education","lineage":["https://openalex.org/I193775966"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Huijun Jin","raw_affiliation_strings":["Computer Science, Yonsei University,Seoul,Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science, Yonsei University,Seoul,Korea","institution_ids":["https://openalex.org/I193775966"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100351760","display_name":"Jieun Lee","orcid":"https://orcid.org/0000-0003-0609-4370"},"institutions":[{"id":"https://openalex.org/I193775966","display_name":"Yonsei University","ror":"https://ror.org/01wjejq96","country_code":"KR","type":"education","lineage":["https://openalex.org/I193775966"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Jieun Lee","raw_affiliation_strings":["Computer Science, Yonsei University,Seoul,Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science, Yonsei University,Seoul,Korea","institution_ids":["https://openalex.org/I193775966"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014258113","display_name":"Shengmin \u200dPiao","orcid":"https://orcid.org/0000-0003-2358-9797"},"institutions":[{"id":"https://openalex.org/I193775966","display_name":"Yonsei University","ror":"https://ror.org/01wjejq96","country_code":"KR","type":"education","lineage":["https://openalex.org/I193775966"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Shengmin Piao","raw_affiliation_strings":["Artificial Intelligence, Yonsei University,Seoul,Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Artificial Intelligence, Yonsei University,Seoul,Korea","institution_ids":["https://openalex.org/I193775966"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102777941","display_name":"Sangmin Seo","orcid":"https://orcid.org/0000-0003-4883-3987"},"institutions":[{"id":"https://openalex.org/I193775966","display_name":"Yonsei University","ror":"https://ror.org/01wjejq96","country_code":"KR","type":"education","lineage":["https://openalex.org/I193775966"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Sangmin Seo","raw_affiliation_strings":["Computer Science, Yonsei University,Seoul,Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science, Yonsei University,Seoul,Korea","institution_ids":["https://openalex.org/I193775966"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Sein Kwon","orcid":null},"institutions":[{"id":"https://openalex.org/I193775966","display_name":"Yonsei University","ror":"https://ror.org/01wjejq96","country_code":"KR","type":"education","lineage":["https://openalex.org/I193775966"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Sein Kwon","raw_affiliation_strings":["Computer Science, Yonsei University,Seoul,Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science, Yonsei University,Seoul,Korea","institution_ids":["https://openalex.org/I193775966"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089591876","display_name":"Sang-Hyun Park","orcid":"https://orcid.org/0000-0003-2119-7845"},"institutions":[{"id":"https://openalex.org/I193775966","display_name":"Yonsei University","ror":"https://ror.org/01wjejq96","country_code":"KR","type":"education","lineage":["https://openalex.org/I193775966"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Sanghyun Park","raw_affiliation_strings":["Computer Science, Yonsei University,Seoul,Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science, Yonsei University,Seoul,Korea","institution_ids":["https://openalex.org/I193775966"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I193775966"],"apc_list":null,"apc_paid":null,"fwci":3.0156,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.90042927,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"7"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9994999766349792,"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.9994999766349792,"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.9929999709129333,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9804999828338623,"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.6786481142044067},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.6567997336387634},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6518234014511108},{"id":"https://openalex.org/keywords/nearest-neighbor-graph","display_name":"Nearest neighbor graph","score":0.46349239349365234},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.437305748462677},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.38899174332618713},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3816137909889221},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.3363253176212311}],"concepts":[{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.6786481142044067},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.6567997336387634},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6518234014511108},{"id":"https://openalex.org/C90988772","wikidata":"https://www.wikidata.org/wiki/Q2855103","display_name":"Nearest neighbor graph","level":3,"score":0.46349239349365234},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.437305748462677},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.38899174332618713},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3816137909889221},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.3363253176212311}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.23919/date64628.2025.10992903","is_oa":false,"landing_page_url":"https://doi.org/10.23919/date64628.2025.10992903","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 Design, Automation &amp;amp; Test in Europe Conference (DATE)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1566135517","https://openalex.org/W2037757210","https://openalex.org/W2088658556","https://openalex.org/W2090836891","https://openalex.org/W2110026675","https://openalex.org/W2112796928","https://openalex.org/W2118123209","https://openalex.org/W2122111042","https://openalex.org/W2124509324","https://openalex.org/W2130395434","https://openalex.org/W2144892774","https://openalex.org/W2145065594","https://openalex.org/W2250539671","https://openalex.org/W2526367648","https://openalex.org/W2757662681","https://openalex.org/W2962771342","https://openalex.org/W2963284996","https://openalex.org/W2963469388","https://openalex.org/W2979473749","https://openalex.org/W4213187929","https://openalex.org/W4237171445","https://openalex.org/W4284965069","https://openalex.org/W4388200511","https://openalex.org/W4393405285","https://openalex.org/W6633386732","https://openalex.org/W6634781086","https://openalex.org/W6734897383"],"related_works":["https://openalex.org/W2795392346","https://openalex.org/W2969538544","https://openalex.org/W2182477562","https://openalex.org/W4246757943","https://openalex.org/W2085998272","https://openalex.org/W2148008870","https://openalex.org/W1595303882","https://openalex.org/W2351157934","https://openalex.org/W2132753198","https://openalex.org/W1558159560"],"abstract_inverted_index":{"Hierarchical":[0],"Navigable":[1],"Small":[2],"World":[3],"(HNSW)":[4],"graphs":[5],"are":[6],"a":[7],"state-of-the-art":[8],"solution":[9],"for":[10,48],"approximate":[11],"nearest":[12],"neighbor":[13],"search,":[14],"widely":[15],"applied":[16],"in":[17,50,145],"areas":[18],"like":[19],"recommendation":[20],"systems,":[21],"computer":[22],"vision,":[23],"and":[24,53,79,90,100,129,148],"natural":[25],"language":[26],"processing.":[27],"However,":[28],"the":[29,32,93,103,142],"effectiveness":[30],"of":[31,75,92],"HNSW":[33,119,144],"algorithm":[34],"is":[35],"constrained":[36],"by":[37,125,132],"its":[38],"reliance":[39],"on":[40,85],"static":[41],"parameter":[42],"settings,":[43],"which":[44],"do":[45],"not":[46],"account":[47],"variations":[49],"data":[51,88,109],"density":[52,89],"dimensionality":[54,91],"across":[55,113],"different":[56],"datasets.":[57],"This":[58],"paper":[59],"introduces":[60],"Dynamic":[61,118],"HNSW,":[62],"an":[63],"adaptive":[64],"method":[65],"that":[66,117],"dynamically":[67],"adjusts":[68],"key":[69],"parameters":[70],"-":[71,83],"such":[72],"as":[73],"the$M$(number":[74],"connections":[76],"per":[77],"node)":[78],"ef":[80],"(search":[81],"depth)":[82],"based":[84],"both":[86,146],"local":[87],"dataset.":[94],"The":[95],"proposed":[96],"approach":[97],"improves":[98],"flexibility":[99],"efficiency,":[101],"allowing":[102],"graph":[104,122],"to":[105,107,127,134],"adapt":[106],"diverse":[108],"characteristics.":[110],"Experimental":[111],"results":[112],"multiple":[114],"datasets":[115],"demonstrate":[116],"significantly":[120],"reduces":[121],"build":[123],"time":[124],"up":[126,133],"33.11%":[128],"memory":[130],"usage":[131],"32.44%,":[135],"while":[136],"maintaining":[137],"comparable":[138],"recall,":[139],"thereby":[140],"outperforming":[141],"conventional":[143],"scalability":[147],"efficiency.":[149]},"counts_by_year":[{"year":2025,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}
