An efficient algorithm for approximate betweenness centrality computation

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2013, Pages 1489-1492

  Chehreghani, Mostafa Haghir ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

Approximate algorithms; Betweenness centrality; Centrality; Social network analysis

Indexed keywords

APPROXIMATE ALGORITHMS; APPROXIMATION ERRORS; BETWEENNESS CENTRALITY; CENTRALITY; CENTRALITY MEASURES; DIVERSE METHODS; SAMPLING METHOD; SAMPLING TECHNIQUE;

ALGORITHMS; KNOWLEDGE MANAGEMENT;

SOCIAL NETWORKING (ONLINE);

EID: 84889588516     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2505515.2507826     Document Type: Conference Paper

References (12)

1. D. A. Bader, S. Kintali, K. Madduri and M. Mihail, Approximating Betweenness Centrality, WAW, 124-137, 2007.
2. M. Berlingerio, F. Bonchi, B. Bringmann and A. Gionis, Mining Graph Evolution Rules, ECML/PKDD (1), 115-130, 2009.
3. U. Brandes. A Faster Algorithm for Betweenness Centrality. Journal of Mathematical Sociology, 25(2), 163-177, 2001.
4. U. Brandes, C. Pich, Centrality estimation in large networks, Intl. Journal of Bifurcation and Chaos, 17(7), 303-2318, 2007.
5. M. L. Fredman and R. E. Tarjan, Fibonacci heaps and their uses in improved network optimization algorithms, Journal of the Association for Computing Machinery, 34(3), 596-615, 1987.
6. L. C. Freeman, A set of measures of centrality based upon betweenness, Sociometry, 40, 35-41, 1977.
7. R. Geisberger, P. Sanders, D. Schultes, Better Approximation of Betweenness Centrality, ALENEX, 90-100, 2008.
8. M. Girvan and M. E. J. Newman, Community structure in social and biological networks, Proc. Natl. Acad. Sci. USA 99, 7821-7826, 2002.
9. J. Leskovec, D. Huttenlocher, J. Kleinberg, Signed Networks in Social Media, CHI 2010.
10. J. Leskovec, K. Lang, A. Dasgupta, M. Mahoney, Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters, Internet Mathematics, 6(1), 29-123, 2009.
11. J. Leskovec, J. Kleinberg, C. Faloutsos, Graph Evolution: Densification and Shrinking Diameters. ACM Transactions on Knowledge Discovery from Data (ACM TKDD), 1(1), 2007.
12. Y. Wang, Z. Di, Y. Fan, Identifying and Characterizing Nodes Important to Community Structure Using the Spectrum of the Graph, PLoS ONE 6(11), e27418, 2011.