Credit Distribution for Influence Maximization in Online Social Networks with Time Constraint

被引:5
|
作者
Pan, Yan [1 ]
Deng, Xiaoheng [1 ]
Shen, Hailan [1 ]
机构
[1] Cent S Univ, Sch Informat Sci & Engn, Changsha 410083, Hunan, Peoples R China
来源
2015 IEEE INTERNATIONAL CONFERENCE ON SMART CITY/SOCIALCOM/SUSTAINCOM (SMARTCITY) | 2015年
基金
中国国家自然科学基金;
关键词
online social networks; influence maximization; credit distribution; time constraint; greedy algorithm;
D O I
10.1109/SmartCity.2015.80
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Considering the time constraint, influence maximization with time constraint (IMTC) is a problem of identifying several maximum influential individuals as seed nodes who will influence others and lead to the largest number of adoption in an expected sense. Associated with probabilities of events and the radio of information gain, we propose an optimized approach to evaluate the activation probability synthetically. As the credit which indicates the strength of influence given to adjacent neighbors is depended on the optimized activation probability (OAP), we also extend the Credit Distribution (CD) model by restricting the scope of credit distribution with the time- delay aspect of influence diffusion in online social networks. Furthermore, the time obstacle caused by repeated attempts is converted to length of the action propagation augmented paths (APAP). The simulations and experiments implemented on real datasets manifest that our approach is more effectively and efficiently in identifying seed nodes and predicting influence diffusion compared with other related approaches.
引用
收藏
页码:255 / 260
页数:6
相关论文
共 50 条
  • [41] Time-bounded targeted influence spread in online social networks
    Lei Yu
    Guohui Li
    Ling Yuan
    Li Zhang
    Multimedia Tools and Applications, 2023, 82 : 9065 - 9081
  • [42] Efficient Influence Maximization in Social Networks
    Chen, Wei
    Wang, Yajun
    Yang, Siyu
    KDD-09: 15TH ACM SIGKDD CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2009, : 199 - 207
  • [43] Efficient influence maximization under TSCM: a suitable diffusion model in online social networks
    Qin, Yadong
    Ma, Jun
    Gao, Shuai
    SOFT COMPUTING, 2017, 21 (04) : 827 - 838
  • [44] Earned benefit maximization in social networks under budget constraint
    Banerjee, Suman
    Jenamani, Mamata
    Pratihar, Dilip Kumar
    EXPERT SYSTEMS WITH APPLICATIONS, 2021, 169
  • [45] Efficient influence maximization under TSCM: a suitable diffusion model in online social networks
    Yadong Qin
    Jun Ma
    Shuai Gao
    Soft Computing, 2017, 21 : 827 - 838
  • [46] 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
  • [47] CRB: A new rumor blocking algorithm in online social networks based on competitive spreading model and influence maximization
    Dong, Chen
    Xu, Gui-Qiong
    Meng, Lei
    CHINESE PHYSICS B, 2024, 33 (08)
  • [48] Hurst exponent based approach for influence maximization in social networks
    Saxena, Bhawna
    Saxena, Vikas
    JOURNAL OF KING SAUD UNIVERSITY-COMPUTER AND INFORMATION SCIENCES, 2022, 34 (05) : 2218 - 2230
  • [49] An Efficient Influence Maximization Algorithm Based on Clique in Social Networks
    Li, Huan
    Zhang, Ruisheng
    Zhao, Zhili
    Yuan, Yongna
    IEEE ACCESS, 2019, 7 : 141083 - 141093
  • [50] STIM: Scalable Time-Sensitive Influence Maximization in Large Social Networks
    Zhu, Yuanyuan
    Ding, Kailin
    Zhong, Ming
    Wei, Lijia
    DATABASE SYSTEMS FOR ADVANCED APPLICATIONS (DASFAA 2020), PT III, 2020, 12114 : 120 - 136