{"id":"https://openalex.org/W2112556110","doi":"https://doi.org/10.1145/2623330.2623626","title":"Almost linear-time algorithms for adaptive betweenness centrality using hypergraph sketches","display_name":"Almost linear-time algorithms for adaptive betweenness centrality using hypergraph sketches","publication_year":2014,"publication_date":"2014-08-22","ids":{"openalex":"https://openalex.org/W2112556110","doi":"https://doi.org/10.1145/2623330.2623626","mag":"2112556110"},"language":"en","primary_location":{"id":"doi:10.1145/2623330.2623626","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2623330.2623626","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining","raw_type":"proceedings-article"},"type":"conference-paper","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/A5038701345","display_name":"Yuichi Yoshida","orcid":"https://orcid.org/0000-0001-8919-8479"},"institutions":[{"id":"https://openalex.org/I184597095","display_name":"National Institute of Informatics","ror":"https://ror.org/04ksd4g47","country_code":"JP","type":"facility","lineage":["https://openalex.org/I1319490839","https://openalex.org/I184597095","https://openalex.org/I4210158934"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Yuichi Yoshida","raw_affiliation_strings":["Ntional Institute of Informatics, Tokyo, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ntional Institute of Informatics, Tokyo, Japan","institution_ids":["https://openalex.org/I184597095"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5038701345"],"corresponding_institution_ids":["https://openalex.org/I184597095"],"apc_list":null,"apc_paid":null,"fwci":5.5042,"has_fulltext":false,"cited_by_count":73,"citation_normalized_percentile":{"value":0.96416841,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"1416","last_page":"1425"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9997000098228455,"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.9997000098228455,"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":"Peer-to-Peer Network Technologies","score":0.9817000031471252,"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.9638000130653381,"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.9870578050613403},{"id":"https://openalex.org/keywords/centrality","display_name":"Centrality","score":0.8864513635635376},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.632587194442749},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6007735729217529},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5206955075263977},{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.5012032985687256},{"id":"https://openalex.org/keywords/network-science","display_name":"Network science","score":0.49651747941970825},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4717881381511688},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.4685479402542114},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.426922082901001},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29641175270080566},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2649223804473877},{"id":"https://openalex.org/keywords/complex-network","display_name":"Complex network","score":0.2605053782463074},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.22201678156852722},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.0627126693725586}],"concepts":[{"id":"https://openalex.org/C117045392","wikidata":"https://www.wikidata.org/wiki/Q4899215","display_name":"Betweenness centrality","level":3,"score":0.9870578050613403},{"id":"https://openalex.org/C53811970","wikidata":"https://www.wikidata.org/wiki/Q5062194","display_name":"Centrality","level":2,"score":0.8864513635635376},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.632587194442749},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6007735729217529},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5206955075263977},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.5012032985687256},{"id":"https://openalex.org/C137753397","wikidata":"https://www.wikidata.org/wiki/Q2434424","display_name":"Network science","level":3,"score":0.49651747941970825},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4717881381511688},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.4685479402542114},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.426922082901001},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29641175270080566},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2649223804473877},{"id":"https://openalex.org/C34947359","wikidata":"https://www.wikidata.org/wiki/Q665189","display_name":"Complex network","level":2,"score":0.2605053782463074},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.22201678156852722},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0627126693725586},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2623330.2623626","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2623330.2623626","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4017703114","display_name":null,"funder_award_id":"24106003","funder_id":"https://openalex.org/F4320320912","funder_display_name":"Ministry of Education, Culture, Sports, Science and Technology"},{"id":"https://openalex.org/G5730542316","display_name":"Research on Approximation Algorithms for Satisfiable Constraint Satisfaction Problems","funder_award_id":"26730009","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"}],"funders":[{"id":"https://openalex.org/F4320320912","display_name":"Ministry of Education, Culture, Sports, Science and Technology","ror":"https://ror.org/048rj2z13"},{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"},{"id":"https://openalex.org/F4320334789","display_name":"Japan Science and Technology Agency","ror":"https://ror.org/00097mb19"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W160678529","https://openalex.org/W902147100","https://openalex.org/W1527104720","https://openalex.org/W1680189815","https://openalex.org/W1903894141","https://openalex.org/W1967385589","https://openalex.org/W1971421925","https://openalex.org/W1971937094","https://openalex.org/W1996014455","https://openalex.org/W1997783781","https://openalex.org/W2005945380","https://openalex.org/W2018715584","https://openalex.org/W2026042206","https://openalex.org/W2036977244","https://openalex.org/W2066999271","https://openalex.org/W2095293504","https://openalex.org/W2099970772","https://openalex.org/W2127405101","https://openalex.org/W2128393152","https://openalex.org/W2130790725","https://openalex.org/W2131692673","https://openalex.org/W2171707538","https://openalex.org/W2257437291","https://openalex.org/W2963122331","https://openalex.org/W3122602071"],"related_works":["https://openalex.org/W1973509935","https://openalex.org/W4389076551","https://openalex.org/W2097992793","https://openalex.org/W2611574733","https://openalex.org/W1159540256","https://openalex.org/W2107855069","https://openalex.org/W2514739320","https://openalex.org/W2121500878","https://openalex.org/W4385357749","https://openalex.org/W3174053386"],"abstract_inverted_index":{"Betweenness":[0],"centrality":[1,54,78,139,152,193],"measures":[2],"the":[3,10,20,41,45,52,57,76,86,107,118,130,136,179,201],"importance":[4],"of":[5,12,19,120,171,181],"a":[6,17,80,102,126],"vertex":[7],"by":[8,66,140],"quantifying":[9],"number":[11],"times":[13],"it":[14,167],"acts":[15],"as":[16],"midpoint":[18],"shortest":[21,58],"paths":[22,59],"between":[23],"other":[24,151],"vertices.":[25,68],"This":[26],"measure":[27],"is":[28,51,160,168],"widely":[29],"used":[30],"in":[31,79,196,200],"network":[32,202],"analysis.":[33],"In":[34,97],"many":[35],"applications,":[36],"we":[37,89,100,184],"wish":[38],"to":[39,74,84,91,149],"choose":[40],"k":[42],"vertices":[43],"with":[44,109],"maximum":[46],"adaptive":[47,137,191],"betweenness":[48,53,77,131,138,192],"centrality,":[49,132],"which":[50],"without":[55],"considering":[56],"that":[60,104,128,157,166,187],"have":[61,90],"been":[62],"taken":[63],"into":[64],"account":[65],"already-chosen":[67],"All":[69],"previous":[70,175],"methods":[71,94],"are":[72,194],"designed":[73],"compute":[75],"fixed":[81],"graph.":[82,143],"Thus,":[83],"solve":[85],"above":[87],"task,":[88,108],"run":[92],"these":[93],"$k$":[95],"times.":[96],"this":[98,142],"paper,":[99],"present":[101],"method":[103,123,159],"directly":[105],"solves":[106],"an":[110],"almost":[111],"linear":[112],"runtime":[113],"no":[114],"matter":[115],"how":[116],"large":[117],"value":[119],"k.":[121],"Our":[122,144],"first":[124],"constructs":[125],"hypergraph":[127],"encodes":[129],"and":[133,163,204],"then":[134],"computes":[135],"examining":[141],"technique":[145],"can":[146],"be":[147],"utilized":[148],"handle":[150],"measures.":[153],"We":[154],"theoretically":[155],"prove":[156],"our":[158,182],"very":[161],"accurate,":[162],"experimentally":[164,185],"confirm":[165],"three":[169],"orders":[170],"magnitude":[172],"faster":[173],"than":[174],"methods.":[176],"Relying":[177],"on":[178,190],"scalability":[180],"method,":[183],"demonstrate":[186],"strategies":[188],"based":[189],"effective":[195],"important":[197],"applications":[198],"studied":[199],"science":[203],"database":[205],"communities.":[206]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":11},{"year":2018,"cited_by_count":14},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":9},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1}],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2025-10-10T00:00:00"}