{"id":"https://openalex.org/W4385567668","doi":"https://doi.org/10.1145/3580305.3599327","title":"Efficient Distributed Approximate k-Nearest Neighbor Graph Construction by Multiway Random Division Forest","display_name":"Efficient Distributed Approximate k-Nearest Neighbor Graph Construction by Multiway Random Division Forest","publication_year":2023,"publication_date":"2023-08-04","ids":{"openalex":"https://openalex.org/W4385567668","doi":"https://doi.org/10.1145/3580305.3599327"},"language":"en","primary_location":{"id":"doi:10.1145/3580305.3599327","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3580305.3599327","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","raw_type":"proceedings-article"},"type":"article","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/A5000401924","display_name":"Sang-Hong Kim","orcid":"https://orcid.org/0009-0006-0159-6215"},"institutions":[{"id":"https://openalex.org/I110273157","display_name":"Kookmin University","ror":"https://ror.org/0049erg63","country_code":"KR","type":"education","lineage":["https://openalex.org/I110273157"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Sang-Hong Kim","raw_affiliation_strings":["Kookmin University, Seoul, Republic of Korea"],"affiliations":[{"raw_affiliation_string":"Kookmin University, Seoul, Republic of Korea","institution_ids":["https://openalex.org/I110273157"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5075939069","display_name":"Ha-Myung Park","orcid":"https://orcid.org/0000-0002-6421-8880"},"institutions":[{"id":"https://openalex.org/I110273157","display_name":"Kookmin University","ror":"https://ror.org/0049erg63","country_code":"KR","type":"education","lineage":["https://openalex.org/I110273157"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Ha-Myung Park","raw_affiliation_strings":["Kookmin University, Seoul, Republic of Korea"],"affiliations":[{"raw_affiliation_string":"Kookmin University, Seoul, Republic of Korea","institution_ids":["https://openalex.org/I110273157"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5000401924"],"corresponding_institution_ids":["https://openalex.org/I110273157"],"apc_list":null,"apc_paid":null,"fwci":0.807,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.73539561,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1097","last_page":"1106"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11478","display_name":"Caching and Content Delivery","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9980000257492065,"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/T11106","display_name":"Data Management and Algorithms","score":0.9911999702453613,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8051954507827759},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6913563013076782},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.4942333996295929},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4836021959781647},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.4742647409439087},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.45992928743362427},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.4018106758594513},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33708077669143677},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.23644688725471497},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.11579358577728271}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8051954507827759},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6913563013076782},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.4942333996295929},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4836021959781647},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.4742647409439087},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.45992928743362427},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.4018106758594513},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33708077669143677},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.23644688725471497},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.11579358577728271}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3580305.3599327","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3580305.3599327","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Life in Land","id":"https://metadata.un.org/sdg/15","score":0.44999998807907104}],"awards":[{"id":"https://openalex.org/G2989752301","display_name":null,"funder_award_id":"KMA2021-00123","funder_id":"https://openalex.org/F4320322036","funder_display_name":"Korea Meteorological Administration"}],"funders":[{"id":"https://openalex.org/F4320322036","display_name":"Korea Meteorological Administration","ror":"https://ror.org/04nrmrg07"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W63626803","https://openalex.org/W206566442","https://openalex.org/W1978112828","https://openalex.org/W1993216012","https://openalex.org/W2022012334","https://openalex.org/W2033000863","https://openalex.org/W2044936152","https://openalex.org/W2054283387","https://openalex.org/W2119885577","https://openalex.org/W2124509324","https://openalex.org/W2125621954","https://openalex.org/W2161008043","https://openalex.org/W2756637424","https://openalex.org/W3005838368","https://openalex.org/W3012786227","https://openalex.org/W3083531817","https://openalex.org/W3091805362","https://openalex.org/W3181646358","https://openalex.org/W3192113933","https://openalex.org/W4256177618","https://openalex.org/W4290960530","https://openalex.org/W4295736907"],"related_works":["https://openalex.org/W2148008870","https://openalex.org/W2381195555","https://openalex.org/W2368606575","https://openalex.org/W4246757943","https://openalex.org/W2132753198","https://openalex.org/W2369874856","https://openalex.org/W2182477562","https://openalex.org/W2792185758","https://openalex.org/W2787484455","https://openalex.org/W2119808169"],"abstract_inverted_index":{"k-nearest":[0],"neighbor":[1],"graphs,":[2,5],"shortly":[3],"k-NN":[4,22,107],"are":[6],"widely":[7],"used":[8],"in":[9],"many":[10],"data":[11,60,87],"mining":[12],"applications":[13],"like":[14],"recommendation,":[15],"information":[16],"retrieval,":[17],"and":[18,32,42,85,153],"similarity":[19],"search.":[20],"Approximate":[21],"graph":[23,83,108],"construction":[24],"has":[25],"been":[26],"getting":[27],"a":[28,45,99],"lot":[29],"of":[30,59,82],"attention,":[31],"most":[33],"researches":[34],"focus":[35],"on":[36,44,129,135],"developing":[37],"algorithms":[38,54,73,122,145],"that":[39,61,70,103,118,139],"operate":[40],"efficiently":[41],"quickly":[43],"single":[46],"machine.":[47],"A":[48],"few":[49],"pioneering":[50],"studies":[51],"propose":[52,93],"distributed":[53,72,101,121,144],"to":[55,65,79,148,155],"increase":[56],"the":[57,71,80,116,119,142,160],"size":[58],"can":[62],"be":[63],"processed":[64],"billions.":[66],"However,":[67],"we":[68,92],"notice":[69],"don't":[74],"perform":[75],"well":[76],"enough":[77],"due":[78],"problems":[81,117],"fragmentation":[84],"massive":[86],"exchange.":[88],"In":[89],"this":[90],"paper,":[91],"MRDF":[94,114,140],"(Multiway":[95],"Random":[96],"Division":[97],"Forest),":[98],"scalable":[100],"algorithm":[102],"constructs":[104],"highly":[105],"accurate":[106],"from":[109],"numerous":[110],"high-dimensional":[111],"vectors":[112],"quickly.":[113],"resolves":[115],"existing":[120],"suffer":[123],"from,":[124],"through":[125],"coarse-grained":[126],"partitioning":[127],"based":[128],"tree":[130],"path":[131],"annotation.":[132],"Experimental":[133],"results":[134],"real-world":[136],"datasets":[137],"show":[138],"outperforms":[141],"state-of-the-art":[143],"with":[146],"up":[147,154],"7.6":[149],"times":[150],"faster":[151],"speed":[152],"56%p":[156],"better":[157],"accuracy":[158],"than":[159],"second":[161],"best":[162],"results.":[163]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}