A Methodology for Evaluating Algorithms That Calculate Social Influence in Complex Social Networks

被引:0
|
作者
Smailovic, Vanja [1 ,2 ]
Podobnik, Vedran [2 ,3 ]
Lovrek, Ignac [2 ,3 ]
机构
[1] Sandv Machining Solut AB, Stockholm, Sweden
[2] Univ Zagreb, Social Networking & Comp Lab socialLAB, Fac Elect Engn & Comp, Zagreb, Croatia
[3] Univ Zagreb, Fac Elect Engn & Comp, Dept Telecommun, Zagreb, Croatia
关键词
CENTRALITY;
D O I
10.1155/2018/1084795
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Online social networks are complex systems often involving millions or even billions of users. Understanding the dynamics of a social network requires analysing characteristics of the network (in its entirety) and the users (as individuals). This paper focuses on calculating user's social influence, which depends on (i) the user's positioning in the social network and (ii) interactions between the user and all other users in the social network. Given that data on all users in the social network is required to calculate social influence, something not applicable for today's social networks, alternative approaches relying on a limited set of data on users are necessary. However, these approaches introduce uncertainty in calculating (i.e., predicting) the value of social influence. Hence, a methodology is proposed for evaluating algorithms that calculate social influence in complex social networks; this is done by identifying the most accurate and precise algorithm. The proposed methodology extends the traditional ground truth approach, often used in descriptive statistics and machine learning. Use of the proposed methodology is demonstrated using a case study incorporating four algorithms for calculating a user's social influence.
引用
收藏
页数:20
相关论文
共 50 条
  • [1] Efficient algorithms for influence maximization in social networks
    Yi-Cheng Chen
    Wen-Chih Peng
    Suh-Yin Lee
    Knowledge and Information Systems, 2012, 33 : 577 - 601
  • [2] Efficient algorithms for influence maximization in social networks
    Chen, Yi-Cheng
    Peng, Wen-Chih
    Lee, Suh-Yin
    KNOWLEDGE AND INFORMATION SYSTEMS, 2012, 33 (03) : 577 - 601
  • [3] Influence Maximization in Social Networks with Genetic Algorithms
    Bucur, Doina
    Iacca, Giovanni
    APPLICATIONS OF EVOLUTIONARY COMPUTATION, EVOAPPLICATIONS 2016, PT I, 2016, 9597 : 379 - 392
  • [4] Evaluating Secure Methodology for Photo Sharing in Online Social Networks
    Alwabel, Athar A.
    Alsuhibany, Suliman A.
    APPLIED SCIENCES-BASEL, 2022, 12 (23):
  • [5] Efficient Algorithms for Maximizing Group Influence in Social Networks
    Peihuang Huang
    Longkun Guo
    Yuting Zhong
    TsinghuaScienceandTechnology, 2022, 27 (05) : 832 - 842
  • [6] Efficient Greedy Algorithms for Influence Maximization in Social Networks
    Lv, Jiaguo
    Guo, Jingfeng
    Ren, Huixiao
    JOURNAL OF INFORMATION PROCESSING SYSTEMS, 2014, 10 (03): : 471 - 482
  • [7] Efficient Algorithms for Maximizing Group Influence in Social Networks
    Huang, Peihuang
    Guo, Longkun
    Zhong, Yuting
    TSINGHUA SCIENCE AND TECHNOLOGY, 2022, 27 (05) : 832 - 842
  • [8] Efficient Algorithms for Budgeted Influence Maximization on Massive Social Networks
    Bian, Song
    Guo, Qintian
    Wang, Sibo
    Yu, Jeffrey Xu
    PROCEEDINGS OF THE VLDB ENDOWMENT, 2020, 13 (09): : 1498 - 1510
  • [9] Better approximation algorithms for influence maximization in online social networks
    Zhu, Yuqing
    Wu, Weili
    Bi, Yuanjun
    Wu, Lidong
    Jiang, Yiwei
    Xu, Wen
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2015, 30 (01) : 97 - 108
  • [10] Minimizing Influence of Rumors by Blockers on Social Networks: Algorithms and Analysis
    Yan, Ruidong
    Li, Deying
    Wu, Weili
    Du, Ding-Zhu
    Wang, Yongcai
    IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING, 2020, 7 (03): : 1067 - 1078