A Cost Optimized Reverse Influence Maximization in Social Networks

被引:0
|
作者
Talukder, Ashis [1 ]
Alam, Md. Golam Rabiul [1 ]
Tran, Nguyen H. [1 ]
Hong, Choong Seon [1 ]
机构
[1] Kyung Hee Univ, Dept Comp Engn, Seoul, South Korea
来源
NOMS 2018 - 2018 IEEE/IFIP NETWORK OPERATIONS AND MANAGEMENT SYMPOSIUM | 2018年
关键词
reverse influence maximization; opportunity cost; RIM; viral marketing; influence maximization; linear threshold model; social network;
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
In recent years, Influence Maximization (IM) has gained great research interest in the field of social network research. The IM is a viral marketing based approach to find the influential users on the social networks. It determines a small seed set that can activate a maximum number of nodes in the network under some diffusion models such as Linear Threshold model or Independent Cascade model. However, previous works have not focused on the opportunity cost defined by the minimum number of nodes that must be motivated in order to activate the initial seed nodes. In this work, we have introduced a Reverse Influence Maximization (RIM) problem to estimate the opportunity cost. The RIM, working in opposite manner to IM, calculates the opportunity cost for viral marketing in the social networks. We have proposed the Extended Randomized Linear Threshold RIM (ERLT-RIM) model to solve the RIM problem. The ERLT-RIM is a Linear Threshold (LT)-based model which is an extension to the existing RLT-RIM model. We also have evaluated the performance of the algorithm using three real-world datasets. The result shows that the proposed model determines the optimal opportunity cost with time efficiency as compared to existing models.
引用
收藏
页数:9
相关论文
共 50 条
  • [1] An Approach of Cost Optimized Influence Maximization in Social Networks
    Talukder, Ashis
    Alam, Md. Golam Rabiul
    Bairagi, Anupam Kumar
    Abedin, Sarder Fakhrul
    Abu Layek, Md
    Nguyen, Hoang T.
    Hong, Choong Seon
    2017 19TH ASIA-PACIFIC NETWORK OPERATIONS AND MANAGEMENT SYMPOSIUM (APNOMS 2017): MANAGING A WORLD OF THINGS, 2017, : 354 - 357
  • [2] Least-Cost Influence Maximization on Social Networks
    Gunnec, Dilek
    Raghavan, S.
    Zhang, Rui
    INFORMS JOURNAL ON COMPUTING, 2020, 32 (02) : 289 - 302
  • [3] A polyhedral approach to least cost influence maximization in social networks
    Chen, Cheng-Lung
    Pasiliao, Eduardo L.
    Boginski, Vladimir
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2023, 45 (01)
  • [4] Cost-efficient Influence Maximization in Online Social Networks
    Zhou, Jingya
    Fan, Jianxi
    Wang, Jin
    Wang, Xi
    Cheng, Baolei
    2017 FIFTH INTERNATIONAL CONFERENCE ON ADVANCED CLOUD AND BIG DATA (CBD), 2017, : 232 - 237
  • [5] Least Cost Influence Maximization Across Multiple Social Networks
    Zhang, Huiyuan
    Nguyen, Dung T.
    Zhang, Huiling
    Thai, My T.
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2016, 24 (02) : 929 - 939
  • [6] A polyhedral approach to least cost influence maximization in social networks
    Cheng-Lung Chen
    Eduardo L. Pasiliao
    Vladimir Boginski
    Journal of Combinatorial Optimization, 2023, 45
  • [7] Competitive Influence Maximization on Online Social Networks under Cost Constraint
    Chen, Bo-Lun
    Sheng, Yi-Yun
    Ji, Min
    Liu, Ji-Wei
    Yu, Yong-Tao
    Zhang, Yue
    KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS, 2021, 15 (04): : 1263 - 1274
  • [8] Knapsack-Based Reverse Influence Maximization for Target Marketing in Social Networks
    Talukder, Ashis
    Alam, Md Golam Rabiul
    Iran, Nguyen H.
    Niyato, Dusit
    Hong, Choong Seon
    IEEE ACCESS, 2019, 7 : 44182 - 44198
  • [9] Knapsack-based Reverse Influence Maximization for Target Marketing in Social Networks
    Talukder, Ashis
    Hong, Choong Seon
    SAC '19: PROCEEDINGS OF THE 34TH ACM/SIGAPP SYMPOSIUM ON APPLIED COMPUTING, 2019, : 2128 - 2130
  • [10] Social Influence Maximization in Hypergraph in Social Networks
    Zhu, Jianming
    Zhu, Junlei
    Ghosh, Smita
    Wu, Weili
    Yuan, Jing
    IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING, 2019, 6 (04): : 801 - 811