The temporal aspects of the evidence-based influence maximization on social networks

被引:6
|
作者
Samadi, Mohammadreza [1 ]
Nikolaev, Alexander [1 ]
Nagi, Rakesh [2 ]
机构
[1] SUNY Buffalo, Dept Ind & Syst Engn, Buffalo, NY 14260 USA
[2] Univ Illinois, Dept Ind & Enterprise Syst Engn, Urbana, IL 61801 USA
基金
芬兰科学院;
关键词
influence maximization; social networks; time horizon; stable cascade; seed selection; optimization; 91D30; 90C11; 97M70; WORD-OF-MOUTH; BRAND AWARENESS; TIME; MODEL;
D O I
10.1080/10556788.2016.1214957
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
The influence maximization problem selects a set of seeds to initiate an optimal cascade of decisions. This paper uses parallel cascade evidence-based diffusion modelling, which views influence as a consequence of the evidence exchange between the connected actors, to investigate the temporal aspects of the social cascade propagation and effective time horizon for long-term campaign planning. Mixed-integer programming is used to explore the optimal timing of evidence injection and the ensuing network behaviour. The paper defines the notion of mid-term and long-term cascade stability and analyses the dynamics of social cascades for varied evidence discount factor values. This exploration reveals that the time horizon setting affects the optimal placement of seeds in a given problem and, hence, has to be set in a way to reflect the decision-maker's short-term or long-term goals. A Cplex-based heuristic algorithm is developed to iteratively find such a preferable cascade stability time horizon. Moreover, a conducted fractional factorial experiment reveals that the forgetfulness effect and the presence of competition significantly affect the cascade persistence. Somewhat counter-intuitively, it is discovered that a strong positive evidence can become more persistent (long-lasting) in the presence of weak opposing evidence.
引用
收藏
页码:290 / 311
页数:22
相关论文
共 50 条
  • [41] Mixed heuristic and greedy strategies based algorithm for influence maximization in social networks
    Cao J.
    Min H.
    Xu S.
    Liu B.
    Dongnan Daxue Xuebao (Ziran Kexue Ban)/Journal of Southeast University (Natural Science Edition), 2016, 46 (05): : 950 - 956
  • [42] Influence maximization in social networks under an independent cascade-based model
    Wang, Qiyao
    Jin, Yuehui
    Lin, Zhen
    Cheng, Shiduan
    Yang, Tan
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2016, 444 : 20 - 34
  • [43] An efficient and effective hop-based approach for influence maximization in social networks
    Tang, Jing
    Tang, Xueyan
    Yuan, Junsong
    SOCIAL NETWORK ANALYSIS AND MINING, 2018, 8 (01) : 1 - 19
  • [44] Influence Maximization Based on Adaptive Graph Convolution Neural Network in Social Networks
    Liu, Wei
    Wang, Saiwei
    Ding, Jiayi
    ELECTRONICS, 2024, 13 (16)
  • [45] Influence Maximization in Social Networks Based on Non-backtracking Random Walk
    Pan, Jingzhi
    Jiang, Fei
    Xu, Jin
    2016 IEEE FIRST INTERNATIONAL CONFERENCE ON DATA SCIENCE IN CYBERSPACE (DSC 2016), 2016, : 260 - 267
  • [46] A Novel Triangle Count-Based Influence Maximization Method on Social Networks
    Chandran, Jyothimon
    Viswanatham, Madhu V.
    INTERNATIONAL JOURNAL OF KNOWLEDGE AND SYSTEMS SCIENCE, 2021, 12 (04)
  • [47] A Fast Approximation for Influence Maximization in Large Social Networks
    Lee, Jong-Ryul
    Chung, Chin-Wan
    WWW'14 COMPANION: PROCEEDINGS OF THE 23RD INTERNATIONAL CONFERENCE ON WORLD WIDE WEB, 2014, : 1157 - 1162
  • [48] Community-diversified influence maximization in social networks
    Li, Jianxin
    Cai, Taotao
    Deng, Ke
    Wang, Xinjue
    Sellis, Timos
    Xia, Feng
    INFORMATION SYSTEMS, 2020, 92
  • [49] A holistic approach to influence maximization in social networks: STORIE
    Sumith, N.
    Annappa, B.
    Bhattacharya, Swapan
    APPLIED SOFT COMPUTING, 2018, 66 : 533 - 547
  • [50] Layer-Prioritized Influence Maximization in Social Networks
    Zhang, Qianwen
    Wu, Yuzhu
    Xie, Jinkui
    NEURAL INFORMATION PROCESSING, ICONIP 2017, PT V, 2017, 10638 : 631 - 638