{"id":"https://openalex.org/W2228830251","doi":"https://doi.org/10.1109/icde.2016.7498244","title":"Being prepared in a sparse world: The case of KNN graph construction","display_name":"Being prepared in a sparse world: The case of KNN graph construction","publication_year":2016,"publication_date":"2016-05-01","ids":{"openalex":"https://openalex.org/W2228830251","doi":"https://doi.org/10.1109/icde.2016.7498244","mag":"2228830251"},"language":"en","primary_location":{"id":"doi:10.1109/icde.2016.7498244","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icde.2016.7498244","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE 32nd International Conference on Data Engineering (ICDE)","raw_type":"proceedings-article"},"type":"preprint","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/A5108082107","display_name":"Antoine Boutet","orcid":null},"institutions":[{"id":"https://openalex.org/I4210155607","display_name":"Laboratoire d'Informatique en Images et Syst\u00e8mes d'Information","ror":"https://ror.org/04dv4he91","country_code":"FR","type":"facility","lineage":["https://openalex.org/I100532134","https://openalex.org/I112936343","https://openalex.org/I1294671590","https://openalex.org/I188626449","https://openalex.org/I203339264","https://openalex.org/I203339264","https://openalex.org/I203339264","https://openalex.org/I203339264","https://openalex.org/I4210155607","https://openalex.org/I48430043"]},{"id":"https://openalex.org/I100532134","display_name":"Universit\u00e9 Claude Bernard Lyon 1","ror":"https://ror.org/029brtt94","country_code":"FR","type":"education","lineage":["https://openalex.org/I100532134","https://openalex.org/I203339264"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Antoine Boutet","raw_affiliation_strings":["LIRIS, University of Lyon, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LIRIS, University of Lyon, France","institution_ids":["https://openalex.org/I4210155607","https://openalex.org/I100532134"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5031849486","display_name":"Anne-Marie Kermarrec","orcid":"https://orcid.org/0000-0001-8187-724X"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]},{"id":"https://openalex.org/I4210133778","display_name":"Centre Inria de l'Universit\u00e9 de Rennes","ror":"https://ror.org/04040yw90","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1326498283","https://openalex.org/I4210133778"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Anne-Marie Kermarrec","raw_affiliation_strings":["INRIA Rennes, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"INRIA Rennes, France","institution_ids":["https://openalex.org/I4210133778","https://openalex.org/I1326498283"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102869635","display_name":"Nupur Mittal","orcid":"https://orcid.org/0000-0002-3765-8813"},"institutions":[{"id":"https://openalex.org/I4210133778","display_name":"Centre Inria de l'Universit\u00e9 de Rennes","ror":"https://ror.org/04040yw90","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1326498283","https://openalex.org/I4210133778"]},{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Nupur Mittal","raw_affiliation_strings":["INRIA Rennes, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"INRIA Rennes, France","institution_ids":["https://openalex.org/I4210133778","https://openalex.org/I1326498283"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061628886","display_name":"Fran\u00e7ois Ta\u0131\u0308ani","orcid":"https://orcid.org/0000-0002-9692-5678"},"institutions":[{"id":"https://openalex.org/I56067802","display_name":"Universit\u00e9 de Rennes","ror":"https://ror.org/015m7wh34","country_code":"FR","type":"education","lineage":["https://openalex.org/I56067802"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Francois Taiani","raw_affiliation_strings":["University of Rennes 1, Rennes, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Rennes 1, Rennes, France","institution_ids":["https://openalex.org/I56067802"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5108082107"],"corresponding_institution_ids":["https://openalex.org/I100532134","https://openalex.org/I4210155607"],"apc_list":null,"apc_paid":null,"fwci":1.7865,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.85338963,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"10","issue":null,"first_page":"241","last_page":"252"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9987000226974487,"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.9987000226974487,"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/T11980","display_name":"Human Mobility and Location-Based Analysis","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.996399998664856,"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/computer-science","display_name":"Computer science","score":0.7713964581489563},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.725129246711731},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6820484399795532},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.6142939329147339},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.5473721623420715},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.5406439304351807},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.4981648921966553},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.48851263523101807},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.4613940715789795},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.45336443185806274},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3918481171131134},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.38214775919914246},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.36434677243232727},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32608258724212646},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32575780153274536},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11914011836051941},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.11850878596305847},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.0795581042766571}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7713964581489563},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.725129246711731},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6820484399795532},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.6142939329147339},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.5473721623420715},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.5406439304351807},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.4981648921966553},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.48851263523101807},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.4613940715789795},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.45336443185806274},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3918481171131134},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.38214775919914246},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.36434677243232727},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32608258724212646},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32575780153274536},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11914011836051941},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.11850878596305847},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0795581042766571},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icde.2016.7498244","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icde.2016.7498244","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE 32nd International Conference on Data Engineering (ICDE)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.47999998927116394},{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.4399999976158142}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":44,"referenced_works":["https://openalex.org/W87002066","https://openalex.org/W281665770","https://openalex.org/W1502916507","https://openalex.org/W1562654179","https://openalex.org/W1566022212","https://openalex.org/W1770242755","https://openalex.org/W1814023381","https://openalex.org/W1964869462","https://openalex.org/W1987389174","https://openalex.org/W2006759076","https://openalex.org/W2014820355","https://openalex.org/W2015195166","https://openalex.org/W2016362819","https://openalex.org/W2022012334","https://openalex.org/W2054560962","https://openalex.org/W2086179657","https://openalex.org/W2086504823","https://openalex.org/W2089497633","https://openalex.org/W2097673300","https://openalex.org/W2106309168","https://openalex.org/W2108614537","https://openalex.org/W2110026675","https://openalex.org/W2110953678","https://openalex.org/W2114304925","https://openalex.org/W2115022330","https://openalex.org/W2122196799","https://openalex.org/W2124509324","https://openalex.org/W2130502756","https://openalex.org/W2133576408","https://openalex.org/W2142140138","https://openalex.org/W2142517301","https://openalex.org/W2159094788","https://openalex.org/W2161854574","https://openalex.org/W2166227910","https://openalex.org/W2170037597","https://openalex.org/W2755088640","https://openalex.org/W2962712507","https://openalex.org/W4253848051","https://openalex.org/W4300492315","https://openalex.org/W6629956336","https://openalex.org/W6633912359","https://openalex.org/W6679446029","https://openalex.org/W6685012337","https://openalex.org/W6744271739"],"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-Neighbor":[0],"(KNN)":[1],"graphs":[2],"have":[3],"emerged":[4],"as":[5],"a":[6,21,29,51,60,110,121],"fundamental":[7],"building":[8],"block":[9],"of":[10,75,113,124,135],"many":[11],"on-line":[12],"services":[13],"providing":[14],"recommendation,":[15],"similarity":[16],"search":[17],"and":[18,25,39,63],"classification.":[19],"Constructing":[20],"KNN":[22,52,65,80,101,137],"graph":[23,66],"rapidly":[24,96],"accurately":[26],"is,":[27],"however,":[28],"computationally":[30],"intensive":[31],"task.":[32],"As":[33],"data":[34],"volumes":[35],"keep":[36],"growing,":[37],"speed":[38],"the":[40,72,91,133,136],"ability":[41],"to":[42,78,95,98],"scale":[43],"out":[44],"are":[45,82],"becoming":[46],"critical":[47],"factors":[48],"when":[49],"deploying":[50],"algorithm.":[53,68],"In":[54],"this":[55],"work,":[56],"we":[57],"present":[58],"KIFF,":[59],"generic,":[61],"fast":[62],"scalable":[64],"construction":[67],"KIFF":[69,117],"directly":[70],"exploits":[71],"bipartite":[73],"nature":[74],"most":[76],"datasets":[77,114],"which":[79],"algorithms":[81],"applied.":[83],"This":[84],"simple":[85],"but":[86],"powerful":[87],"strategy":[88],"drastically":[89],"limits":[90],"computational":[92],"cost":[93],"required":[94],"converge":[97],"an":[99],"accurate":[100],"solution,":[102],"especially":[103],"for":[104],"sparse":[105],"datasets.":[106],"Our":[107],"evaluation":[108],"on":[109,119],"representative":[111],"range":[112],"show":[115],"that":[116],"provides,":[118],"average,":[120],"speed-up":[122],"factor":[123],"14":[125],"against":[126],"recent":[127],"state-of-the":[128],"art":[129],"solutions":[130],"while":[131],"improving":[132],"quality":[134],"approximation":[138],"by":[139],"18%.":[140]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2}],"updated_date":"2026-05-06T08:25:59.206177","created_date":"2025-10-10T00:00:00"}