{"id":"https://openalex.org/W983728296","doi":"https://doi.org/10.1177/0165551515594728","title":"A novel algorithm for scalable <i>k</i> -nearest neighbour graph construction","display_name":"A novel algorithm for scalable <i>k</i> -nearest neighbour graph construction","publication_year":2015,"publication_date":"2015-07-22","ids":{"openalex":"https://openalex.org/W983728296","doi":"https://doi.org/10.1177/0165551515594728","mag":"983728296"},"language":"en","primary_location":{"id":"doi:10.1177/0165551515594728","is_oa":false,"landing_page_url":"https://doi.org/10.1177/0165551515594728","pdf_url":null,"source":{"id":"https://openalex.org/S68913162","display_name":"Journal of Information Science","issn_l":"0165-5515","issn":["0165-5515","1741-6485"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320017","host_organization_name":"SAGE Publishing","host_organization_lineage":["https://openalex.org/P4310320017"],"host_organization_lineage_names":["SAGE Publishing"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Information Science","raw_type":"journal-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/A5101412143","display_name":"Youngki Park","orcid":"https://orcid.org/0000-0002-7006-1402"},"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":"Youngki Park","raw_affiliation_strings":["Seoul National University, Korea","Seoul National University (Korea)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Seoul National University, Korea","institution_ids":["https://openalex.org/I139264467"]},{"raw_affiliation_string":"Seoul National University (Korea)","institution_ids":["https://openalex.org/I139264467"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026280956","display_name":"Heasoo Hwang","orcid":"https://orcid.org/0000-0002-3397-2303"},"institutions":[{"id":"https://openalex.org/I124633538","display_name":"University of Seoul","ror":"https://ror.org/05en5nh73","country_code":"KR","type":"education","lineage":["https://openalex.org/I124633538"]},{"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":true,"raw_author_name":"Heasoo Hwang","raw_affiliation_strings":["University of Seoul, Korea","[University of Seoul, Korea]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Seoul, Korea","institution_ids":["https://openalex.org/I124633538"]},{"raw_affiliation_string":"[University of Seoul, Korea]","institution_ids":["https://openalex.org/I139264467"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102802605","display_name":"Sang\u2010goo Lee","orcid":"https://orcid.org/0000-0002-0063-0083"},"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":"Sang-goo Lee","raw_affiliation_strings":["Seoul National University, Korea","Seoul National University (Korea)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Seoul National University, Korea","institution_ids":["https://openalex.org/I139264467"]},{"raw_affiliation_string":"Seoul National University (Korea)","institution_ids":["https://openalex.org/I139264467"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5026280956"],"corresponding_institution_ids":["https://openalex.org/I124633538","https://openalex.org/I139264467"],"apc_list":null,"apc_paid":null,"fwci":1.4022,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.8288171,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"42","issue":"2","first_page":"274","last_page":"288"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.998199999332428,"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.998199999332428,"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/T10203","display_name":"Recommender Systems and Techniques","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T11719","display_name":"Data Quality and Management","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7636252641677856},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.735742449760437},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.6096190214157104},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5479899644851685},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5331387519836426},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.46779805421829224},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4543120861053467},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.44076332449913025},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3896717429161072},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.37446829676628113},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18005457520484924},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.07859921455383301}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7636252641677856},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.735742449760437},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6096190214157104},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5479899644851685},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5331387519836426},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.46779805421829224},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4543120861053467},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.44076332449913025},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3896717429161072},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.37446829676628113},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18005457520484924},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.07859921455383301},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1177/0165551515594728","is_oa":false,"landing_page_url":"https://doi.org/10.1177/0165551515594728","pdf_url":null,"source":{"id":"https://openalex.org/S68913162","display_name":"Journal of Information Science","issn_l":"0165-5515","issn":["0165-5515","1741-6485"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320017","host_organization_name":"SAGE Publishing","host_organization_lineage":["https://openalex.org/P4310320017"],"host_organization_lineage_names":["SAGE Publishing"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Information Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W112627137","https://openalex.org/W128638292","https://openalex.org/W1488303220","https://openalex.org/W1502916507","https://openalex.org/W1532325895","https://openalex.org/W1974386366","https://openalex.org/W1979666709","https://openalex.org/W1988833430","https://openalex.org/W2012833704","https://openalex.org/W2040367556","https://openalex.org/W2040559836","https://openalex.org/W2042281163","https://openalex.org/W2065259291","https://openalex.org/W2085937320","https://openalex.org/W2097776316","https://openalex.org/W2105436061","https://openalex.org/W2110026675","https://openalex.org/W2127041269","https://openalex.org/W2130502756","https://openalex.org/W2152565070","https://openalex.org/W2159094788","https://openalex.org/W2165159668","https://openalex.org/W2292992741","https://openalex.org/W2595959570","https://openalex.org/W2912901878","https://openalex.org/W2915063781","https://openalex.org/W4206277161","https://openalex.org/W4210535201","https://openalex.org/W4213009331","https://openalex.org/W4236965008","https://openalex.org/W4238844819","https://openalex.org/W4243760375","https://openalex.org/W4297794619","https://openalex.org/W4299445015"],"related_works":["https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W2948807893","https://openalex.org/W2778153218","https://openalex.org/W2758277628","https://openalex.org/W1531601525","https://openalex.org/W2049983311","https://openalex.org/W2088946561","https://openalex.org/W2170725231"],"abstract_inverted_index":{"Finding":[0],"the":[1,13,36,45,124],"k-nearest":[2,68],"neighbours":[3],"of":[4,12,39,47,76,116,149,185],"every":[5,81],"node":[6,82,86,125],"in":[7,21,106,147,167,182],"a":[8,31,73,113,144],"dataset":[9],"is":[10,34,135],"one":[11],"most":[14],"important":[15],"data":[16],"operations":[17],"with":[18,95],"wide":[19],"application":[20],"various":[22,183],"areas":[23],"such":[24],"as":[25,44,78],"recommendation":[26],"and":[27,61,163],"information":[28],"retrieval.":[29],"However,":[30],"major":[32],"challenge":[33],"that":[35,88,119,132,175],"execution":[37,108],"time":[38],"existing":[40],"approaches":[41],"grows":[42],"rapidly":[43],"number":[46,75],"nodes":[48,77,105],"or":[49],"dimensions":[50,94],"increases.":[51],"In":[52],"this":[53],"paper,":[54],"we":[55,130],"present":[56,112],"greedy":[57,117,133,176],"filtering,":[58],"an":[59,66],"efficient":[60],"scalable":[62],"algorithm":[63],"for":[64,80,137],"finding":[65],"approximate":[67],"neighbour":[69],"graph.":[70],"It":[71],"selects":[72],"fixed":[74],"candidates":[79],"by":[83],"filtering":[84,99,118,134,177],"out":[85],"pairs":[87],"do":[89],"not":[90],"have":[91,141],"any":[92],"matching":[93],"large":[96,150],"values.":[97],"Greedy":[98],"achieves":[100],"consistent":[101],"approximation":[102],"accuracy":[103],"across":[104],"linear":[107],"time.":[109],"We":[110,152],"also":[111,153],"faster":[114],"version":[115],"uses":[120],"inverted":[121],"indices":[122],"on":[123],"prefixes.":[126],"Through":[127],"theoretical":[128],"analysis,":[129],"show":[131,174],"effective":[136],"datasets":[138],"whose":[139],"features":[140],"Zipfian":[142],"distribution,":[143],"characteristic":[145],"observed":[146],"majority":[148],"datasets.":[151,187],"conduct":[154],"extensive":[155],"comparative":[156],"experiments":[157],"against":[158],"(a)":[159],"three":[160,165],"state-of-the-art":[161],"algorithms,":[162],"(b)":[164],"algorithms":[166,181],"related":[168],"research":[169],"domains.":[170],"Our":[171],"experimental":[172],"results":[173],"consistently":[178],"outperforms":[179],"other":[180],"types":[184],"high-dimensional":[186]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}