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 条
  • [1] Influence Maximization Problem in Social Networks: An Overview
    Jaouadi, Myriam
    Ben Romdhane, Lotfi
    2019 IEEE/ACS 16TH INTERNATIONAL CONFERENCE ON COMPUTER SYSTEMS AND APPLICATIONS (AICCSA 2019), 2019,
  • [2] Group Influence Maximization Problem in Social Networks
    Zhu, Jianming
    Ghosh, Smita
    Wu, Weili
    IEEE TRANSACTIONS ON COMPUTATIONAL SOCIAL SYSTEMS, 2019, 6 (06): : 1156 - 1164
  • [3] Influence Maximization Problem for Unknown Social Networks
    Mihara, Shodai
    Tsugawa, Sho
    Ohsaki, Hiroyuki
    PROCEEDINGS OF THE 2015 IEEE/ACM INTERNATIONAL CONFERENCE ON ADVANCES IN SOCIAL NETWORKS ANALYSIS AND MINING (ASONAM 2015), 2015, : 1539 - 1546
  • [4] On the optimal solution of budgeted influence maximization problem in social networks
    Evren Güney
    Operational Research, 2019, 19 : 817 - 831
  • [5] On the optimal solution of budgeted influence maximization problem in social networks
    Guney, Evren
    OPERATIONAL RESEARCH, 2019, 19 (03) : 817 - 831
  • [6] Rapid Influence Maximization on Social Networks: The Positive Influence Dominating Set Problem
    Raghavan, S.
    Zhang, Rui
    INFORMS JOURNAL ON COMPUTING, 2022, 34 (03) : 1345 - 1365
  • [7] A hybrid dynamic memetic algorithm for the influence maximization problem in social networks
    Tang, Jianxin
    Li, Yihui
    INTERNATIONAL JOURNAL OF MODERN PHYSICS C, 2025, 36 (03):
  • [8] An Effective Simulated Annealing for Influence Maximization Problem of Online Social Networks
    Liu, Shi-Jui
    Chen, Chi-Yuan
    Tsai, Chun-Wei
    8TH INTERNATIONAL CONFERENCE ON EMERGING UBIQUITOUS SYSTEMS AND PERVASIVE NETWORKS (EUSPN 2017) / 7TH INTERNATIONAL CONFERENCE ON CURRENT AND FUTURE TRENDS OF INFORMATION AND COMMUNICATION TECHNOLOGIES IN HEALTHCARE (ICTH-2017) / AFFILIATED WORKSHOPS, 2017, 113 : 478 - 483
  • [9] Learning Automata based Approach for Influence Maximization Problem on Social Networks
    Ge, Hao
    Huang, Jinchao
    Di, Chong
    Li, Jianhua
    Li, Shenghong
    2017 IEEE SECOND INTERNATIONAL CONFERENCE ON DATA SCIENCE IN CYBERSPACE (DSC), 2017, : 108 - 117
  • [10] Influence Maximization for Effective Advertisement in Social Networks: Problem, Solution, and Evaluation
    Hong, Suk-Jin
    Ko, Yun-Yong
    Joe, Moonjeung
    Kim, Sang-Wook
    SAC '19: PROCEEDINGS OF THE 34TH ACM/SIGAPP SYMPOSIUM ON APPLIED COMPUTING, 2019, : 1314 - 1321