{"id":"https://openalex.org/W2988171316","doi":"https://doi.org/10.1145/3357384.3358064","title":"Adaptive Algorithms for Estimating Betweenness and k -path Centralities","display_name":"Adaptive Algorithms for Estimating Betweenness and k -path Centralities","publication_year":2019,"publication_date":"2019-11-03","ids":{"openalex":"https://openalex.org/W2988171316","doi":"https://doi.org/10.1145/3357384.3358064","mag":"2988171316"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1145/3357384.3358064","pdf_url":null,"source":null,"license":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-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/A5049221896","display_name":"Morteza Haghir Chehreghani","orcid":"https://orcid.org/0000-0003-3436-0541"},"institutions":[{"id":"https://openalex.org/I158248296","display_name":"Amirkabir University of Technology","ror":"https://ror.org/04gzbav43","country_code":"IR","type":"education","lineage":["https://openalex.org/I158248296"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Mostafa Haghir Chehreghani","raw_affiliation_string":"Amirkabir University of Technology (Tehran Polytechnic) & T\u00e9l\u00e9com-Paris, Institut Polytechnique de Paris (IP-Paris), Tehran, Iran","raw_affiliation_strings":["Amirkabir University of Technology (Tehran Polytechnic) & T\u00e9l\u00e9com-Paris, Institut Polytechnique de Paris (IP-Paris), Tehran, Iran"]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080970505","display_name":"Albert Bifet","orcid":"https://orcid.org/0000-0002-8339-7773"},"institutions":[{"id":"https://openalex.org/I12356871","display_name":"T\u00e9l\u00e9com Paris","ror":"https://ror.org/01naq7912","country_code":"FR","type":"education","lineage":["https://openalex.org/I12356871","https://openalex.org/I190752583"]},{"id":"https://openalex.org/I4210145102","display_name":"Institut Polytechnique de Paris","ror":"https://ror.org/042tfbd02","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210145102"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Albert Bifet","raw_affiliation_string":"T\u00e9l\u00e9com-Paris, IP-Paris, Paris, France","raw_affiliation_strings":["T\u00e9l\u00e9com-Paris, IP-Paris, Paris, France"]},{"author_position":"last","author":{"id":"https://openalex.org/A5035427105","display_name":"Talel Abdessalem","orcid":null},"institutions":[{"id":"https://openalex.org/I12356871","display_name":"T\u00e9l\u00e9com Paris","ror":"https://ror.org/01naq7912","country_code":"FR","type":"education","lineage":["https://openalex.org/I12356871","https://openalex.org/I190752583"]},{"id":"https://openalex.org/I4210145102","display_name":"Institut Polytechnique de Paris","ror":"https://ror.org/042tfbd02","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210145102"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Talel Abdessalem","raw_affiliation_string":"T\u00e9l\u00e9com-Paris, IP-Paris, Paris, France","raw_affiliation_strings":["T\u00e9l\u00e9com-Paris, IP-Paris, Paris, France"]}],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"has_fulltext":false,"cited_by_count":7,"cited_by_percentile_year":{"min":85,"max":86},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Statistical Mechanics of Complex Networks","score":0.9998,"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":"Statistical Mechanics of Complex Networks","score":0.9998,"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/T10742","display_name":"Scalable Peer-to-Peer Network Architectures","score":0.9217,"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/T11478","display_name":"Content-Centric Networking for Information Delivery","score":0.9134,"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"}}],"keywords":[{"keyword":"estimating betweenness","score":0.5851},{"keyword":"adaptive algorithms","score":0.489}],"concepts":[{"id":"https://openalex.org/C117045392","wikidata":"https://www.wikidata.org/wiki/Q4899215","display_name":"Betweenness centrality","level":3,"score":0.9348078},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.79778355},{"id":"https://openalex.org/C53811970","wikidata":"https://www.wikidata.org/wiki/Q5062194","display_name":"Centrality","level":2,"score":0.7832866},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.62432283},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5693383},{"id":"https://openalex.org/C198531522","wikidata":"https://www.wikidata.org/wiki/Q485146","display_name":"Sample (material)","level":2,"score":0.56540936},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.52347267},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4958571},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.44380805},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4160476},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.37995812},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3304324},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.07398996},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C43617362","wikidata":"https://www.wikidata.org/wiki/Q170050","display_name":"Chromatography","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1145/3357384.3358064","pdf_url":null,"source":null,"license":null,"version":null,"is_accepted":false,"is_published":false},{"is_oa":false,"landing_page_url":"https://hal.telecom-paris.fr/hal-02460402","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":true,"is_in_doaj":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"French National Centre for Scientific Research","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":["French National Centre for Scientific Research"],"type":"repository"},"license":null,"version":null,"is_accepted":false,"is_published":false},{"is_oa":false,"landing_page_url":"https://hal.telecom-paristech.fr/hal-02460402","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":true,"is_in_doaj":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"French National Centre for Scientific Research","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":["French National Centre for Scientific Research"],"type":"repository"},"license":null,"version":null,"is_accepted":false,"is_published":false},{"is_oa":false,"landing_page_url":"https://telecom-paris.hal.science/hal-02460402","pdf_url":null,"source":null,"license":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"referenced_works_count":17,"referenced_works":["https://openalex.org/W251931307","https://openalex.org/W367843706","https://openalex.org/W390736637","https://openalex.org/W1029409534","https://openalex.org/W1984341657","https://openalex.org/W2002240881","https://openalex.org/W2089370556","https://openalex.org/W2108341980","https://openalex.org/W2108614537","https://openalex.org/W2112556110","https://openalex.org/W2140653560","https://openalex.org/W2171707538","https://openalex.org/W2276989614","https://openalex.org/W2388242991","https://openalex.org/W2592818482","https://openalex.org/W2769133055","https://openalex.org/W4233413206"],"related_works":["https://openalex.org/W1973509935","https://openalex.org/W4389076551","https://openalex.org/W2097992793","https://openalex.org/W2107855069","https://openalex.org/W2611574733","https://openalex.org/W2140653560","https://openalex.org/W2348831795","https://openalex.org/W4312461432","https://openalex.org/W2241641394","https://openalex.org/W2514739320"],"ngrams_url":"https://api.openalex.org/works/W2988171316/ngrams","abstract_inverted_index":{"Betweenness":[0],"centrality":[1,4,137,235],"and":[2,17,30,62,73,86,89,110,150,208,219],"k-path":[3,136,192],"are":[5,10],"two":[6,51,146],"important":[7],"indices":[8],"that":[9,115,183,227],"widely":[11],"used":[12,231],"to":[13,117,186,232],"analyze":[14],"social,":[15],"technological":[16],"information":[18],"networks.":[19],"In":[20],"the":[21,54,67,71,74,77,103,118,157,161,165,171,175,179,191],"current":[22],"paper,":[23],"first":[24,49],"given":[25],"a":[26,31,37,125,131,188,238],"directed":[27],"network":[28],"G":[29],"vertex":[32,55],"$r\\in":[33],"V(G)$,":[34],"we":[35,129,213,225],"present":[36],"novel":[38,132],"adaptive":[39],"algorithm":[40,48,123,133,141,197],"for":[41,134],"estimating":[42,135],"betweenness":[43],"score":[44,193],"of":[45,53,57,70,76,138,160,164,174,178,190,194,237,240],"r.":[46,139],"Our":[47,140],"computes":[50],"subsets":[52],"set":[56,239],"G,":[58],"called":[59],"$\\mathcalRF":[60,84,148,154],"(r)$":[61,85,88,149,155,169],"$\\mathcalRT":[63,87],"(r)$.":[64,152],"They":[65],"define":[66],"sample":[68,158,172,206],"spaces":[69],"start-points":[72],"end-points":[75],"samples.":[78,201],"Then,":[79,128],"it":[80,203],"adaptively":[81],"samples":[82,104],"from":[83],"stops":[90],"as":[91,93],"soon":[92],"some":[94],"condition":[95,100],"is":[96,142],"satisfied.":[97],"The":[98],"stopping":[99],"depends":[101],"on":[102,144],"met":[105],"so":[106],"far,":[107],"$|\\mathcalRF":[108],"(r)|$":[109],"$|\\mathcalRT":[111],"(r)|$.":[112],"We":[113,181],"show":[114,182,220,226],"compared":[116],"well-known":[119],"existing":[120],"algorithms,":[121],"our":[122,196,216],"gives":[124],"better":[126],"$(\u0142ambda,\u03b4)$-approximation.":[127],"propose":[130],"based":[143],"computing":[145],"sets":[147],"$\\mathcalD":[151,168],"While":[153],"defines":[156,170],"space":[159,173],"source":[162],"vertices":[163,177],"sampled":[166],"paths,":[167],"other":[176],"paths.":[180],"in":[184],"order":[185],"give":[187],"$(\u0142ambda,\u03b4)$-approximation":[189],"r,":[195],"requires":[198],"considerably":[199],"less":[200,210],"Moreover,":[202],"processes":[204],"each":[205],"faster":[207],"with":[209],"memory.":[211],"Finally,":[212],"empirically":[214],"evaluate":[215],"proposed":[217],"algorithms":[218],"their":[221],"superior":[222],"performance.":[223],"Also,":[224],"they":[228],"can":[229],"be":[230],"efficiently":[233],"compute":[234],"scores":[236],"vertices.":[241]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2988171316","counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2}],"updated_date":"2024-03-21T16:44:58.680922","created_date":"2019-11-22"}