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 条
  • [31] Profit Maximization problem with Coupons in social networks
    Liu, Bin
    Li, Xiao
    Wang, Huijuan
    Fang, Qizhi
    Dong, Junyu
    Wu, Weili
    THEORETICAL COMPUTER SCIENCE, 2020, 803 (22-35) : 22 - 35
  • [32] Research on influence maximization problem in dynamic networks
    Wang, Xue-Guang
    INFORMATION SCIENCE AND MANAGEMENT ENGINEERING, VOLS 1-3, 2014, 46 : 1145 - 1152
  • [33] Opinion influence maximization problem in online social networks based on group polarization effect
    Dai, Jialing
    Zhu, Jianming
    Wang, Guoqing
    INFORMATION SCIENCES, 2022, 609 : 195 - 214
  • [34] Near-Optimal Convergent Approach for Composed Influence Maximization Problem in Social Networks
    Zhu, Jianming
    Ghosh, Smita
    Zhu, Junlei
    Wu, Weili
    IEEE ACCESS, 2019, 7 : 142488 - 142497
  • [35] Research on the Influence Maximization Problem in Social Networks Based on the Multi-Functional Complex Networks Model
    Bin, Sheng
    Sun, Gengxin
    JOURNAL OF ORGANIZATIONAL AND END USER COMPUTING, 2022, 34 (03)
  • [36] 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
  • [37] Collective Influence Maximization in Mobile Social Networks
    Wu, Xudong
    Fu, Luoyi
    Wang, Shuaiqi
    Jiang, Bo
    Wang, Xinbing
    Chen, Guihai
    IEEE TRANSACTIONS ON MOBILE COMPUTING, 2023, 22 (02) : 797 - 812
  • [38] Influence Maximization with Priority in Online Social Networks
    Pham, Canh V.
    Ha, Dung K. T.
    Vu, Quang C.
    Su, Anh N.
    Hoang, Huan X.
    ALGORITHMS, 2020, 13 (08)
  • [39] Influence maximization in social networks based on TOPSIS
    Zareie, Ahmad
    Sheikhahmadi, Amir
    Khamforoosh, Keyhan
    EXPERT SYSTEMS WITH APPLICATIONS, 2018, 108 : 96 - 107
  • [40] Influence maximization of informed agents in social networks
    AskariSichani, Omid
    Jalili, Mahdi
    APPLIED MATHEMATICS AND COMPUTATION, 2015, 254 : 229 - 239