{"id":"https://openalex.org/W2783905369","doi":"https://doi.org/10.1109/bigdata.2017.8258057","title":"Two-level clustering fast betweenness centrality computation for requirement-driven approximation","display_name":"Two-level clustering fast betweenness centrality computation for requirement-driven approximation","publication_year":2017,"publication_date":"2017-12-01","ids":{"openalex":"https://openalex.org/W2783905369","doi":"https://doi.org/10.1109/bigdata.2017.8258057","mag":"2783905369"},"language":"en","primary_location":{"id":"doi:10.1109/bigdata.2017.8258057","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bigdata.2017.8258057","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Conference on Big Data (Big Data)","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/A5017957509","display_name":"Angelo Furno","orcid":"https://orcid.org/0000-0001-9658-9179"},"institutions":[{"id":"https://openalex.org/I4210111949","display_name":"Laboratoire d'Ing\u00e9nierie Circulation Transports","ror":"https://ror.org/02ahzca76","country_code":"FR","type":"facility","lineage":["https://openalex.org/I4210111949","https://openalex.org/I4210154111","https://openalex.org/I4210166914"]},{"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"]},{"id":"https://openalex.org/I4210166914","display_name":"\u00c9cole Nationale des Travaux Publics de l'\u00c9tat","ror":"https://ror.org/05r0ccb59","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210166914"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Angelo Furno","raw_affiliation_strings":["Univ Lyon, ENTPE, IFSTTAR, LICIT UMR_T9401, Lyon, France"],"affiliations":[{"raw_affiliation_string":"Univ Lyon, ENTPE, IFSTTAR, LICIT UMR_T9401, Lyon, France","institution_ids":["https://openalex.org/I4210111949","https://openalex.org/I4210166914","https://openalex.org/I100532134"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033407100","display_name":"Nour\u2010Eddin El Faouzi","orcid":"https://orcid.org/0000-0002-6873-695X"},"institutions":[{"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"]},{"id":"https://openalex.org/I4210166914","display_name":"\u00c9cole Nationale des Travaux Publics de l'\u00c9tat","ror":"https://ror.org/05r0ccb59","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210166914"]},{"id":"https://openalex.org/I4210111949","display_name":"Laboratoire d'Ing\u00e9nierie Circulation Transports","ror":"https://ror.org/02ahzca76","country_code":"FR","type":"facility","lineage":["https://openalex.org/I4210111949","https://openalex.org/I4210154111","https://openalex.org/I4210166914"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"N. E. El Faouzi","raw_affiliation_strings":["Univ Lyon, ENTPE, IFSTTAR, LICIT UMR_T9401, Lyon, France"],"affiliations":[{"raw_affiliation_string":"Univ Lyon, ENTPE, IFSTTAR, LICIT UMR_T9401, Lyon, France","institution_ids":["https://openalex.org/I4210111949","https://openalex.org/I4210166914","https://openalex.org/I100532134"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011512226","display_name":"Rajesh Sharma","orcid":"https://orcid.org/0000-0003-3581-1332"},"institutions":[{"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"]},{"id":"https://openalex.org/I4210166914","display_name":"\u00c9cole Nationale des Travaux Publics de l'\u00c9tat","ror":"https://ror.org/05r0ccb59","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210166914"]},{"id":"https://openalex.org/I4210111949","display_name":"Laboratoire d'Ing\u00e9nierie Circulation Transports","ror":"https://ror.org/02ahzca76","country_code":"FR","type":"facility","lineage":["https://openalex.org/I4210111949","https://openalex.org/I4210154111","https://openalex.org/I4210166914"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Rajesh Sharma","raw_affiliation_strings":["Univ Lyon, ENTPE, IFSTTAR, LICIT UMR_T9401, Lyon, France"],"affiliations":[{"raw_affiliation_string":"Univ Lyon, ENTPE, IFSTTAR, LICIT UMR_T9401, Lyon, France","institution_ids":["https://openalex.org/I4210111949","https://openalex.org/I4210166914","https://openalex.org/I100532134"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5090058284","display_name":"Eugenio Zimeo","orcid":"https://orcid.org/0000-0003-4683-5487"},"institutions":[{"id":"https://openalex.org/I4210111949","display_name":"Laboratoire d'Ing\u00e9nierie Circulation Transports","ror":"https://ror.org/02ahzca76","country_code":"FR","type":"facility","lineage":["https://openalex.org/I4210111949","https://openalex.org/I4210154111","https://openalex.org/I4210166914"]},{"id":"https://openalex.org/I4210166914","display_name":"\u00c9cole Nationale des Travaux Publics de l'\u00c9tat","ror":"https://ror.org/05r0ccb59","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210166914"]},{"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":false,"raw_author_name":"Eugenio Zimeo","raw_affiliation_strings":["Univ Lyon, ENTPE, IFSTTAR, LICIT UMR_T9401, Lyon, France"],"affiliations":[{"raw_affiliation_string":"Univ Lyon, ENTPE, IFSTTAR, LICIT UMR_T9401, Lyon, France","institution_ids":["https://openalex.org/I4210111949","https://openalex.org/I4210166914","https://openalex.org/I100532134"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5017957509"],"corresponding_institution_ids":["https://openalex.org/I100532134","https://openalex.org/I4210111949","https://openalex.org/I4210166914"],"apc_list":null,"apc_paid":null,"fwci":1.2133,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.79435275,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"25","issue":null,"first_page":"1289","last_page":"1294"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9663000106811523,"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.9502999782562256,"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/betweenness-centrality","display_name":"Betweenness centrality","score":0.9697889089584351},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.705086886882782},{"id":"https://openalex.org/keywords/centrality","display_name":"Centrality","score":0.6211414933204651},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.6072627305984497},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5967136025428772},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5011477470397949},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.4966924786567688},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.49387675523757935},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.43149131536483765},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4209280014038086},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39605745673179626},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20440655946731567},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.19034016132354736},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.14267820119857788}],"concepts":[{"id":"https://openalex.org/C117045392","wikidata":"https://www.wikidata.org/wiki/Q4899215","display_name":"Betweenness centrality","level":3,"score":0.9697889089584351},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.705086886882782},{"id":"https://openalex.org/C53811970","wikidata":"https://www.wikidata.org/wiki/Q5062194","display_name":"Centrality","level":2,"score":0.6211414933204651},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.6072627305984497},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5967136025428772},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5011477470397949},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.4966924786567688},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.49387675523757935},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.43149131536483765},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4209280014038086},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39605745673179626},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20440655946731567},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.19034016132354736},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.14267820119857788},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/bigdata.2017.8258057","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bigdata.2017.8258057","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Conference on Big Data (Big Data)","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-01943221v1","is_oa":false,"landing_page_url":"https://hal.science/hal-01943221","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"BIGDATA 2017 IEEE International Conference on Big Data, Dec 2017, Boston, United States. pp.1289-1294, ⟨10.1109/BigData.2017.8258057⟩","raw_type":"Conference papers"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5299999713897705,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W118100147","https://openalex.org/W160678529","https://openalex.org/W198296044","https://openalex.org/W1539596358","https://openalex.org/W1883226873","https://openalex.org/W1967385589","https://openalex.org/W1971937094","https://openalex.org/W1978558026","https://openalex.org/W1978710835","https://openalex.org/W1983345514","https://openalex.org/W1996014455","https://openalex.org/W2028126649","https://openalex.org/W2029173860","https://openalex.org/W2060464767","https://openalex.org/W2069343813","https://openalex.org/W2071563060","https://openalex.org/W2147393894","https://openalex.org/W2151187166","https://openalex.org/W2171707538","https://openalex.org/W2256163264","https://openalex.org/W2521789615","https://openalex.org/W2570990685","https://openalex.org/W2592824913","https://openalex.org/W3104069389","https://openalex.org/W4211173878","https://openalex.org/W4233769451","https://openalex.org/W6607952639","https://openalex.org/W6643463851","https://openalex.org/W6691550387"],"related_works":["https://openalex.org/W1973509935","https://openalex.org/W4389076551","https://openalex.org/W2107855069","https://openalex.org/W2611574733","https://openalex.org/W2097992793","https://openalex.org/W2140653560","https://openalex.org/W2348831795","https://openalex.org/W4312461432","https://openalex.org/W2241641394","https://openalex.org/W2514739320"],"abstract_inverted_index":{"Betweenness":[0],"centrality":[1,58],"is":[2,23,36,43,135],"a":[3,108,123,144],"metric":[4],"widely":[5],"used":[6],"in":[7,65],"several":[8],"domains":[9],"(social,":[10],"biological,":[11],"transportation,":[12],"computer)":[13],"to":[14,53,74],"identify":[15],"critical":[16,63,162],"nodes":[17,40,64],"of":[18,39,46,56,62,96,107,118,130,143,173],"networks.":[19,68,175],"Its":[20],"exact":[21],"computation":[22,76],"very":[24,66],"demanding,":[25],"with":[26],"an":[27,51,90],"O(nm)":[28],"time":[29],"complexity":[30,49],"for":[31,59,92,100,169],"unweighted":[32],"graphs":[33,131],"(where":[34],"n":[35],"the":[37,44,54,105,116,139,153,160,166],"number":[38,45,117],"and":[41,132],"m":[42],"edges).":[47],"Such":[48],"becomes":[50],"obstacle":[52],"adoption":[55],"betweenness":[57,97],"continuous":[60],"monitoring":[61,172],"large":[67],"Several":[69],"solutions":[70],"have":[71],"been":[72],"proposed":[73],"reduce":[75],"time,":[77],"mainly":[78],"via":[79,122],"parallelism,":[80],"approximation":[81,154],"or":[82],"incremental":[83],"recalculation.":[84],"In":[85],"this":[86],"paper,":[87],"we":[88],"propose":[89],"algorithm":[91,112,167],"computing":[93],"approximated":[94],"values":[95],"that":[98,126,152],"allows":[99],"tuning":[101],"its":[102],"performance":[103],"on":[104],"basis":[106],"tolerable":[109],"error.":[110],"The":[111,149],"aims":[113],"at":[114],"reducing":[115],"single-source":[119],"shortest-paths":[120],"explorations":[121],"pivot-based":[124],"technique":[125],"exploits":[127],"topological":[128],"properties":[129],"clustering.":[133],"It":[134],"evaluated":[136],"by":[137],"identifying":[138],"vulnerabilities":[140],"(critical":[141],"nodes)":[142],"real-world,":[145],"very-large":[146],"road":[147,174],"network.":[148],"evaluation":[150],"shows":[151],"error":[155],"does":[156],"not":[157],"significantly":[158],"affect":[159],"most":[161],"nodes,":[163],"thus":[164],"making":[165],"well-suited":[168],"on-line":[170],"operational":[171]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":1}],"updated_date":"2026-04-07T14:57:38.498316","created_date":"2025-10-10T00:00:00"}