Budgeted influence and earned benefit maximization with tags in social networks

被引:2
|
作者
Banerjee, Suman [1 ]
Pal, Bithika [2 ]
机构
[1] Indian Inst Technol Jammu, Dept Comp Sci & Engn, Jammu, Jammu & Kashmir, India
[2] Indian Inst Technol, Dept Comp Sci & Engn, Kharagpur, W Bengal, India
关键词
Social network; Influence probability; Seed set; MIA model; PROFIT MAXIMIZATION;
D O I
10.1007/s13278-021-00850-z
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Influence Maximization Problem aims at identifying a limited number of highly influential users who will be working for diffusion agents to maximize the influence. In case of Budgeted Influence Maximization (BIM), the users of the network have a cost and influential user selection needs to be done within a given budget. In case of Earned Benefit Maximization (EBM) Problem, a set of target users along with their benefit value is given and the aim is to choose highly influential users within an allocated budget to maximize the earned benefit. In this paper, we study the BIM and EBM Problem under the tag-specific edge probability setting, which means instead of a single edge probability a set of probability values (each one for a specific context e.g., 'games,' academics; etc.) per edge is given. The aim is to identify the influential tags and users for maximizing the influence and earned benefit. Considering the realistic fact that different tags have a different impact on different communities of a social network, we propose two solution methodologies and one pruning technique. A detailed analysis of all the solution approaches has been done. An extensive set of experiments have been carried out with three benchmark datasets. From the experiments, we observe that the proposed solution approaches outperform baseline methods (e.g., random node-random tag, high-degree node-high-frequency tag, high-degree node-high-frequency tag with community). For the tag-based BIM Problem the improvement is upto 8% in terms of number of influenced nodes and for the tag-based EBM Problem the improvement is upto 15% in terms of earned benefit.
引用
收藏
页数:18
相关论文
共 50 条
  • [1] Budgeted influence and earned benefit maximization with tags in social networks
    Suman Banerjee
    Bithika Pal
    Social Network Analysis and Mining, 2022, 12
  • [2] Budgeted Influence Maximization with Tags in Social Networks
    Banerjee, Suman
    Pal, Bithika
    Jenamani, Mamata
    WEB INFORMATION SYSTEMS ENGINEERING, WISE 2020, PT I, 2020, 12342 : 141 - 152
  • [3] On Budgeted Influence Maximization in Social Networks
    Huy Nguyen
    Zheng, Rong
    IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2013, 31 (06) : 1084 - 1094
  • [4] Diversified Budgeted Influence Maximization in Dynamic Social Networks
    Meena, Sunil Kumar
    Singh, Shashank Sheshar
    Singh, Kuldeep
    IEEE TRANSACTIONS ON COMPUTATIONAL SOCIAL SYSTEMS, 2024,
  • [5] Earned benefit maximization in social networks under budget constraint
    Banerjee, Suman
    Jenamani, Mamata
    Pratihar, Dilip Kumar
    EXPERT SYSTEMS WITH APPLICATIONS, 2021, 169
  • [6] On the optimal solution of budgeted influence maximization problem in social networks
    Evren Güney
    Operational Research, 2019, 19 : 817 - 831
  • [7] 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
  • [8] On the optimal solution of budgeted influence maximization problem in social networks
    Guney, Evren
    OPERATIONAL RESEARCH, 2019, 19 (03) : 817 - 831
  • [9] A Local-Global Influence Indicator Based Constrained Evolutionary Algorithm for Budgeted Influence Maximization in Social Networks
    Zhang, Lei
    Liu, Yutong
    Cheng, Fan
    Qiu, Jianfeng
    Zhang, Xingyi
    IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING, 2021, 8 (02): : 1557 - 1570
  • [10] Finding Seeds and Relevant Tags Jointly: For Targeted Influence Maximization in Social Networks
    Ke, Xiangyu
    Khan, Arijit
    Cong, Gao
    SIGMOD'18: PROCEEDINGS OF THE 2018 INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA, 2018, : 1097 - 1111