Measuring Betweenness Centrality in Social Internetworking Scenarios

被引:0
|
作者
Buccafurri, Francesco [1 ]
Lax, Gianluca [1 ]
Nicolazzo, Serena [1 ]
Nocera, Antonino [1 ]
Ursino, Domenico [1 ]
机构
[1] Univ Mediterranea Reggio Calabria, DIIES, Reggio Di Calabria, Italy
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The importance of the betweenness centrality measure in (on-line) social networks is well known, as well as its possible applications to various domains. However, the classical notion of betweenness centrality is not able to capture the centrality of nodes w.r.t. paths crossing different social networks. In other words, it is not able to detect those nodes of a multi-social-network scenario (called Social Internetworking Scenario) which play a central role in inter-social-network information flows. In this paper, we propose a new measure of betweenness centrality suitable for Social Internetworking Scenarios, also applicable to the case of different communities of the same social network. The new measure has been tested in a number of synthetic networks, highlighting the significance and effectiveness of our proposal.
引用
收藏
页码:666 / 673
页数:8
相关论文
共 50 条
  • [1] Degree Centrality, Betweenness Centrality, and Closeness Centrality in Social Network
    Zhang, Junlong
    Luo, Yu
    PROCEEDINGS OF THE 2017 2ND INTERNATIONAL CONFERENCE ON MODELLING, SIMULATION AND APPLIED MATHEMATICS (MSAM2017), 2017, 132 : 300 - 303
  • [2] Betweenness centrality of teams in social networks
    Lee, Jongshin
    Lee, Yongsun
    Oh, Soo Min
    Kahng, B.
    CHAOS, 2021, 31 (06)
  • [3] Betweenness centrality correlation in social networks
    Goh, KI
    Oh, E
    Kahng, B
    Kim, D
    PHYSICAL REVIEW E, 2003, 67 (01)
  • [4] An Approximation of Betweenness Centrality for Social Networks
    Ostrowski, David Alfred
    2015 IEEE 9TH INTERNATIONAL CONFERENCE ON SEMANTIC COMPUTING (ICSC), 2015, : 489 - 492
  • [5] Fast exact computation of betweenness centrality in social networks
    Baglioni, Miriam
    Geraci, Filippo
    Pellegrini, Marco
    Lastres, Ernesto
    2012 IEEE/ACM INTERNATIONAL CONFERENCE ON ADVANCES IN SOCIAL NETWORKS ANALYSIS AND MINING (ASONAM), 2012, : 450 - 456
  • [6] Approximating betweenness centrality
    Bader, David A.
    Kintali, Shiva
    Madduri, Kamesh
    Mihail, Milena
    ALGORITHMS AND MODELS FOR THE WEB-GRAPH, 2007, 4863 : 124 - +
  • [7] Routing Betweenness Centrality
    Dolev, Shlomi
    Elovici, Yuval
    Puzis, Rami
    JOURNAL OF THE ACM, 2010, 57 (04)
  • [8] An incremental algorithm for updating betweenness centrality and k-betweenness centrality and its performance on realistic dynamic social network data
    Kas, Miray
    Carley, Kathleen M.
    Carley, L. Richard
    SOCIAL NETWORK ANALYSIS AND MINING, 2014, 4 (01) : 1 - 23
  • [9] A Clustered Approach for Fast Computation of Betweenness Centrality in Social Networks
    Suppa, Paolo
    Zimeo, Eugenio
    2015 IEEE INTERNATIONAL CONGRESS ON BIG DATA - BIGDATA CONGRESS 2015, 2015, : 47 - 54
  • [10] Identifying high betweenness centrality nodes in large social networks
    Kourtellis, Nicolas
    Alahakoon, Tharaka
    Simha, Ramanuja
    Iamnitchi, Adriana
    Tripathi, Rahul
    SOCIAL NETWORK ANALYSIS AND MINING, 2013, 3 (04) : 899 - 914