{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T15:17:34Z","timestamp":1777735054018,"version":"3.51.4"},"reference-count":31,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1109\/bigdata.2018.8622133","type":"proceedings-article","created":{"date-parts":[[2019,1,25]],"date-time":"2019-01-25T03:07:18Z","timestamp":1548385638000},"page":"2104-2113","source":"Crossref","is-referenced-by-count":6,"title":["An In-depth Comparison of Group Betweenness Centrality Estimation Algorithms"],"prefix":"10.1109","author":[{"given":"Mostafa Haghir","family":"Chehreghani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Albert","family":"Bifet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Talel","family":"Abdessalem","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623626"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1137\/1116025"},{"key":"ref10","doi-asserted-by":"crossref","DOI":"10.1090\/cbms\/107","author":"chung","year":"2006","journal-title":"Complex Graphs and Networks (CBMS Regional Conference Series in Mathematics"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.1999.9990219"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/28869.28874"},{"key":"ref13","first-page":"35","article-title":"A set of measures of centrality based upon betweenness, sociometry","volume":"40","author":"c freeman","year":"1977","journal-title":"Social Networks"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(78)90021-7"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972887.9"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.14778\/2850578.2850580"},{"key":"ref17","doi-asserted-by":"crossref","DOI":"10.1145\/2939672","author":"krishnapuram","year":"2016","journal-title":"ACM SIGKDD International Conference on Knowledge Discovery and Data Mining"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772756"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1753326.1753532"},{"key":"ref28","first-page":"1145","author":"riondato","year":"0","journal-title":"ABRA approximating betweenness centrality in static and dynamic graphs with rademacher averages"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1142\/S0218127407018403"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-015-0423-0"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.2001.9990249"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2556195.2556263"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107298019"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2007.11.001"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2018.8622452"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxu003"},{"key":"ref2","first-page":"20:1","article-title":"KADABRA is an adaptive algorithm for betweenness via random approximation","author":"borassi","year":"2016","journal-title":"24th Annual European Symposium on Algorithms ESA 2016 August 22-24 2016 Aarhus Denmark volume 57 of LIPIcs"},{"key":"ref9","first-page":"752","article-title":"Efficient exact and approximate algorithms for computing betweenness centrality in directed graphs","author":"chehreghani","year":"2018","journal-title":"Advances in Knowledge Discovery and Data Mining - 22nd Pacific-Asia Conference PAKDD 2018 Melbourne VIC Australia June 3-6 2018 Proceedings Part III volume 10939 of Lecture Notes in Computer Science"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77004-6_10"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081893"},{"key":"ref22","first-page":"1765","author":"mahmoody","year":"0","journal-title":"Scalable betweenness centrality maximization via sampling"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1217299.1217301"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.76.056709"},{"key":"ref23","first-page":"127","article-title":"Bi-directional search","volume":"6","author":"pohl","year":"1971","journal-title":"Machine Intelligence"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1108\/10662240910927821","article-title":"Collaborative attack on internet users&#x2019; anonymity","volume":"19","author":"puzis","year":"2009","journal-title":"Internet Research"},{"key":"ref25","first-page":"287","article-title":"Finding the most prominent group in complex networks","volume":"20","author":"puzis","year":"2007","journal-title":"AI Commun"}],"event":{"name":"2018 IEEE International Conference on Big Data (Big Data)","location":"Seattle, WA, USA","start":{"date-parts":[[2018,12,10]]},"end":{"date-parts":[[2018,12,13]]}},"container-title":["2018 IEEE International Conference on Big Data (Big Data)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8610059\/8621858\/08622133.pdf?arnumber=8622133","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T22:42:08Z","timestamp":1643236928000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8622133\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/bigdata.2018.8622133","relation":{},"subject":[],"published":{"date-parts":[[2018,12]]}}}