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
相关论文
共 50 条
  • [31] Identification of influential users by neighbors in online social networks
    Sheikhahmadi, Amir
    Nematbakhsh, Mohammad Ali
    Zareie, Ahmad
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2017, 486 : 517 - 534
  • [32] A Study on Influential User Identification in Online Social Networks
    Wang Nan
    Sun Qindong
    Zhou Yadong
    Shen Si
    CHINESE JOURNAL OF ELECTRONICS, 2016, 25 (03) : 467 - 473
  • [33] Hazardous Influential Node Identification in Online Social Networks
    Nedunchezhian, Poornima
    Karunanithy, Kalaivanan
    Bhuvaneswari, M.
    Mahalingam, Murugan
    Rashid, Tarik A.
    IETE JOURNAL OF RESEARCH, 2024, 70 (05) : 4940 - 4949
  • [34] Identifying Key Classes Based on Weighted k-Core Analysis of Software Networks
    Pan W.-F.
    Song B.-B.
    Hu B.
    Li B.
    Jiang B.
    2018, Chinese Institute of Electronics (46): : 1071 - 1077
  • [35] Identifying the Top-k Influential Spreaders in Social Networks: a Survey and Experimental Evaluation
    Taha, Kamal
    IEEE ACCESS, 2022, 10 : 107809 - 107845
  • [36] New Link Attack Strategies of Complex Networks Based on k-Core Decomposition
    Sun, Shiwen
    Liu, Xiaoxiao
    Wang, Li
    Xia, Chengyi
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 2020, 67 (12) : 3157 - 3161
  • [37] Identifying influential spreaders in complex networks based on improved k-shell method
    Wang, Min
    Li, Wanchun
    Guo, Yuning
    Peng, Xiaoyan
    Li, Yingxiang
    Physica A: Statistical Mechanics and its Applications, 2021, 554
  • [38] Identifying influential spreaders in complex networks based on improved k-shell method
    Wang, Min
    Li, Wanchun
    Guo, Yuning
    Peng, Xiaoyan
    Li, Yingxiang
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2020, 554
  • [39] Influential spreaders identification in complex networks with potential edge weight based k-shell degree neighborhood method
    Maji, Giridhar
    JOURNAL OF COMPUTATIONAL SCIENCE, 2020, 39
  • [40] An improved Nystrom spectral graph clustering using k-core decomposition as a sampling strategy for large networks
    Tu, Jingzhi
    Mei, Gang
    Piccialli, Francesco
    JOURNAL OF KING SAUD UNIVERSITY-COMPUTER AND INFORMATION SCIENCES, 2022, 34 (06) : 3673 - 3684