Supplementary Influence Maximization Problem in Social Networks

被引:4
|
作者
Zhang, Yapu [1 ]
Guo, Jianxiong [2 ]
Yang, Wenguo [3 ]
Wu, Weili [4 ]
机构
[1] Beijing Univ Technol, Inst Operat Res & Informat Engn, Beijing, Peoples R China
[2] Beijing Normal Univ, Adv Inst Nat Sci, Zhuhai, Peoples R China
[3] Univ Chinese Acad Sci, Sch Math Sci, Beijing, Peoples R China
[4] Univ Texas Dallas, Dept Comp Sci, Richardson, TX USA
基金
美国国家科学基金会; 中国国家自然科学基金;
关键词
Integrated circuit modeling; Social networking (online); Heuristic algorithms; Approximation algorithms; Linear programming; Monte Carlo methods; Companies; Reverse influence sampling (RIS); sandwich approximation (SA); social networks; supplementary influence maximization (SIM); RUMOR BLOCKING; ALGORITHMS; DIFFUSION;
D O I
10.1109/TCSS.2023.3234437
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Due to important applications in viral marketing, influence maximization (IM) has become a well-studied problem. It aims at finding a small subset of initial users so that they can deliver information to the largest amount of users through the word-of-mouth effect. The original IM only considers a singleton item. And the majority of extensions ignore the relationships among different items or only consider their competitive interactions. In reality, the diffusion probability of one item will increase when users adopted supplementary products in advance. Motivated by this scenario, we propose a supplementary independent cascade (IC) and discuss the supplementary IM problem. Our problem is NP-hard, and the computation of the objective function is #P-hard. We notice that the diffusion probability will change when considering the impact of its supplementary product. Therefore, the efficient reverse influence sampling (RIS) techniques cannot be applied to our problem directly even though the objective function is submodular. To address this issue, we utilize the sandwich approximation (SA) strategy to obtain a data-dependent approximate solution. Furthermore, we define the supplementary-based reverse reachable (SRR) sets and then propose a heuristic algorithm. Finally, the experimental results on three real datasets support the efficiency and superiority of our methods.
引用
收藏
页码:986 / 996
页数:11
相关论文
共 50 条
  • [21] Efficient Influence Maximization in Social Networks
    Chen, Wei
    Wang, Yajun
    Yang, Siyu
    KDD-09: 15TH ACM SIGKDD CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2009, : 199 - 207
  • [22] Targeted Influence Maximization in Social Networks
    Song, Chonggang
    Hsu, Wynne
    Lee, Mong Li
    CIKM'16: PROCEEDINGS OF THE 2016 ACM CONFERENCE ON INFORMATION AND KNOWLEDGE MANAGEMENT, 2016, : 1683 - 1692
  • [23] Influence maximization with deactivation in social networks
    Taninmis, Kubra
    Aras, Necati
    Altinel, I. K.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 278 (01) : 105 - 119
  • [24] Matching influence maximization in social networks
    Rao, Guoyao
    Wang, Yongcai
    Chen, Wenping
    Li, Deying
    Wu, Weili
    THEORETICAL COMPUTER SCIENCE, 2021, 857 : 71 - 86
  • [25] Influence maximization for large social networks
    Yue, Feifei
    Tu, Zhibing
    Feng, Shengzhong
    INFORMATION SCIENCE AND MANAGEMENT ENGINEERING, VOLS 1-3, 2014, 46 : 1823 - 1830
  • [26] A survey on meta-heuristic algorithms for the influence maximization problem in the social networks
    Zahra Aghaee
    Mohammad Mahdi Ghasemi
    Hamid Ahmadi Beni
    Asgarali Bouyer
    Afsaneh Fatemi
    Computing, 2021, 103 : 2437 - 2477
  • [27] A fast module identification and filtering approach for influence maximization problem in social networks
    Beni, Hamid Ahmadi
    Bouyer, Asgarali
    Azimi, Sevda
    Rouhi, Alireza
    Arasteh, Bahman
    INFORMATION SCIENCES, 2023, 640
  • [28] An efficient linear programming based method for the influence maximization problem in social networks
    Guney, Evren
    INFORMATION SCIENCES, 2019, 503 : 589 - 605
  • [29] A survey on meta-heuristic algorithms for the influence maximization problem in the social networks
    Aghaee, Zahra
    Ghasemi, Mohammad Mahdi
    Beni, Hamid Ahmadi
    Bouyer, Asgarali
    Fatemi, Afsaneh
    COMPUTING, 2021, 103 (11) : 2437 - 2477
  • [30] Rumor correction maximization problem in social networks
    Zhang, Yapu
    Yang, Wenguo
    Du, Ding-Zhu
    THEORETICAL COMPUTER SCIENCE, 2021, 861 : 102 - 116