Identification of influential users by neighbors in online social networks

被引:52
作者
Sheikhahmadi, Amir [1 ]
Nematbakhsh, Mohammad Ali [2 ]
Zareie, Ahmad [3 ]
机构
[1] Islamic Azad Univ, Sanandaj Branch, Dept Comp Engn, Sanandaj, Iran
[2] Univ Isfahan, Dept Comp Engn, Esfahan, Iran
[3] Islamic Azad Univ, Kermanshah Branch, Dept Comp Engn, Kermanshah, Iran
关键词
Influential users; Users' interaction; SIR diffusion model; Social networks; Spreading process; COMPLEX NETWORKS; NODES; CENTRALITY; SPREADERS; DIFFUSION; RANKING;
D O I
10.1016/j.physa.2017.05.098
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
Identification and ranking of influential users in social networks for the sake of news spreading and advertising has recently become an attractive field of research. Given the large number of users in social networks and also the various relations that exist among them, providing an effective method to identify influential users has been gradually considered as an essential factor. In most of the already-provided methods, those users who are located in an appropriate structural position of the network are regarded as influential users. These methods do not usually pay attention to the interactions among users, and also consider those relations as being binary in nature. This paper, therefore, proposes a new method to identify influential users in a social network by considering those interactions that exist among the users. Since users tend to act within the frame of communities, the network is initially divided into different communities. Then the amount of interaction among users is used as a parameter to set the weight of relations existing within the network. Afterward, by determining the neighbors' role for each user, a two-level method is proposed for both detecting users' influence and also ranking them. Simulation and experimental results on twitter data shows that those users who are selected by the proposed method, comparing to other existing ones, are distributed in a more appropriate distance. Moreover, the proposed method outperforms the other ones in terms of both the influential speed and capacity of the users it selects. (C) 2017 Elsevier B.V. All rights reserved.
引用
收藏
页码:517 / 534
页数:18
相关论文
共 33 条
  • [1] Error and attack tolerance of complex networks
    Albert, R
    Jeong, H
    Barabási, AL
    [J]. NATURE, 2000, 406 (6794) : 378 - 382
  • [2] [Anonymous], J INF SCI
  • [3] [Anonymous], NAT COMMUN
  • [4] Identifying and ranking influential spreaders in complex networks by neighborhood coreness
    Bae, Joonhyun
    Kim, Sangwook
    [J]. PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2014, 395 : 549 - 559
  • [5] Detecting Influential Spreaders in Complex, Dynamic Networks
    Basaras, Pavlos
    Katsaros, Dimitrios
    Tassiulas, Leandros
    [J]. COMPUTER, 2013, 46 (04) : 24 - 29
  • [6] Fast unfolding of communities in large networks
    Blondel, Vincent D.
    Guillaume, Jean-Loup
    Lambiotte, Renaud
    Lefebvre, Etienne
    [J]. JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2008,
  • [7] Eigenvector-like measures of centrality for asymmetric relations
    Bonacich, P
    Lloyd, P
    [J]. SOCIAL NETWORKS, 2001, 23 (03) : 191 - 201
  • [8] The anatomy of a large-scale hypertextual web search engine (Reprint from COMPUTER NETWORKS AND ISDN SYSTEMS, vol 30, pg 107-117, 1998)
    Brin, Sergey
    Page, Lawrence
    [J]. COMPUTER NETWORKS, 2012, 56 (18) : 3825 - 3833
  • [9] Thresholds for Epidemic Spreading in Networks
    Castellano, Claudio
    Pastor-Satorras, Romualdo
    [J]. PHYSICAL REVIEW LETTERS, 2010, 105 (21)
  • [10] Path diversity improves the identification of influential spreaders
    Chen, Duan-Bing
    Xiao, Rui
    Zeng, An
    Zhang, Yi-Cheng
    [J]. EPL, 2013, 104 (06)