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 条
  • [21] A Hybrid Algorithm for Influence Maximization of Social Networks
    Lin, Yongze
    Zhang, Xinyuan
    Xia, Liting
    Ren, Yue
    Li, Weimin
    [J]. IEEE 17TH INT CONF ON DEPENDABLE, AUTONOM AND SECURE COMP / IEEE 17TH INT CONF ON PERVAS INTELLIGENCE AND COMP / IEEE 5TH INT CONF ON CLOUD AND BIG DATA COMP / IEEE 4TH CYBER SCIENCE AND TECHNOLOGY CONGRESS (DASC/PICOM/CBDCOM/CYBERSCITECH), 2019, : 427 - 431
  • [22] Efficient algorithms for influence maximization in social networks
    Yi-Cheng Chen
    Wen-Chih Peng
    Suh-Yin Lee
    [J]. Knowledge and Information Systems, 2012, 33 : 577 - 601
  • [23] Incremental Influence Maximization for Dynamic Social Networks
    Wang, Yake
    Zhu, Jinghua
    Ming, Qian
    [J]. DATA SCIENCE, PT II, 2017, 728 : 13 - 27
  • [24] Exploiting community and structural hole spanner for influence maximization in social networks
    Li, Xiao
    Chen, Ziang
    [J]. EXPERT SYSTEMS, 2023, 40 (10)
  • [25] Enhancing Influence Maximization in Social Networks using Parallel Reverse Reachability Set Computations
    Haque, Mridul
    Banerjee, Dip Sankar
    [J]. 2018 ELEVENTH INTERNATIONAL CONFERENCE ON CONTEMPORARY COMPUTING (IC3), 2018, : 53 - 58
  • [26] IRIE: Scalable and Robust Influence Maximization in Social Networks
    Jung, Kyomin
    Heo, Wooram
    Chen, Wei
    [J]. 12TH IEEE INTERNATIONAL CONFERENCE ON DATA MINING (ICDM 2012), 2012, : 918 - 923
  • [27] Efficient Greedy Algorithms for Influence Maximization in Social Networks
    Lv, Jiaguo
    Guo, Jingfeng
    Ren, Huixiao
    [J]. JOURNAL OF INFORMATION PROCESSING SYSTEMS, 2014, 10 (03): : 471 - 482
  • [28] A holistic approach to influence maximization in social networks: STORIE
    Sumith, N.
    Annappa, B.
    Bhattacharya, Swapan
    [J]. APPLIED SOFT COMPUTING, 2018, 66 : 533 - 547
  • [29] Influence maximization under equilibrious groups in social networks
    Li, Runzhi
    Zhu, Jianming
    Wang, Guoqing
    [J]. JOURNAL OF SUPERCOMPUTING, 2024, 80 (15) : 22190 - 22212
  • [30] Fuzzy Influence Maximization in Social Networks
    Zareie, Ahmad
    Sakellariou, Rizos
    [J]. ACM TRANSACTIONS ON THE WEB, 2024, 18 (03)