Identification of influential spreaders in online social networks using interaction weighted K-core decomposition method

被引:81
作者
Al-garadi, Mohammed Ali [1 ]
Varathan, Kasturi Dewi [1 ]
Ravana, Devi [1 ]
机构
[1] Univ Malaya, Fac Comp Sci & Informat Technol, Dept Informat Syst, Kuala Lumpur 50603, Malaysia
关键词
Online social networks; Complex networks; Influential spreaders; K-shell decomposition; Social media; Twitter; COMPLEX; RANKING; NODES; MODEL;
D O I
10.1016/j.physa.2016.11.002
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
Online social networks (OSNs) have become a vital part of everyday living. OSNs provide researchers and scientists with unique prospects to comprehend individuals on a scale and to analyze human behavioral patterns. Influential spreaders identification is an important subject in understanding the dynamics of information diffusion in OSNs. Targeting these influential spreaders is significant in planning the techniques for accelerating the propagation of information that is useful for various applications, such as viral marketing applications or blocking the diffusion of annoying information (spreading of viruses, rumors, online negative behaviors, and cyberbullying). Existing K-core decomposition methods consider links equally when calculating the influential spreaders for unweighted networks. Alternatively, the proposed link weights are based only on the degree of nodes. Thus, if a node is linked to high-degree nodes, then this node will receive high weight and is treated as an important node. Conversely, the degree of nodes in OSN context does not always provide accurate influence of users. In the present study, we improve the K-core method for OSNs by proposing a novel link-weighting method based on the interaction among users. The proposed method is based on the observation that the interaction of users is a significant factor in quantifying the spreading capability of user in OSNs. The tracking of diffusion links in the real spreading dynamics of information verifies the effectiveness of our proposed method for identifying influential spreaders in OSNs as compared with degree centrality, PageRank, and original K-core. (C) 2016 Elsevier B.V. All rights reserved.
引用
收藏
页码:278 / 288
页数:11
相关论文
共 46 条
  • [1] [Anonymous], 2011, ICWSM
  • [2] [Anonymous], 2010, ICWSM
  • [3] [Anonymous], 2010, P INT AAAI C WEB SOC, DOI DOI 10.1609/ICWSM.V4I1.14033
  • [4] [Anonymous], P 13 ACM C EL COMM
  • [5] Backstrom Lars., 2011, ICWSM, V11, P23
  • [6] Batagelj V., 2003, O M ALGORITHM CORES
  • [7] Absence of influential spreaders in rumor dynamics
    Borge-Holthoefer, Javier
    Moreno, Yamir
    [J]. PHYSICAL REVIEW E, 2012, 85 (02)
  • [8] A faster algorithm for betweenness centrality
    Brandes, U
    [J]. JOURNAL OF MATHEMATICAL SOCIOLOGY, 2001, 25 (02) : 163 - 177
  • [9] Catanese S., 2012, COMPUTATIONAL SOCIAL, P291, DOI DOI 10.1007/978-1-4471-4054-2_12
  • [10] Complex contagions and the weakness of long ties
    Centola, Damon
    Macy, Michael
    [J]. AMERICAN JOURNAL OF SOCIOLOGY, 2007, 113 (03) : 702 - 734