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 条
  • [21] Towards establishing the effect of self-similarity on influence maximization in online social networks
    Bhawna Saxena
    Vikas Saxena
    Social Network Analysis and Mining, 2020, 10
  • [22] Influence Maximization Based on Snapshot Prediction in Dynamic Online Social Networks
    Zhang, Lin
    Li, Kan
    MATHEMATICS, 2022, 10 (08)
  • [23] Competitive Influence maximization on Online Social Networks: A deterministic modeling approach
    Pham, Canh V.
    Nguyen, Nam V.
    Le, Tuan X.
    Hoang, Huan X.
    2019 IEEE - RIVF INTERNATIONAL CONFERENCE ON COMPUTING AND COMMUNICATION TECHNOLOGIES (RIVF), 2019, : 148 - 153
  • [24] 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
  • [25] Capacity Constrained Influence Maximization in Social Networks
    Zhang, Shiqi
    Huang, Yiqian
    Sun, Jiachen
    Lin, Wenqing
    Xiao, Xiaokui
    Tang, Bo
    PROCEEDINGS OF THE 29TH ACM SIGKDD CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, KDD 2023, 2023, : 3376 - 3385
  • [26] On the Fairness of Time-Critical Influence Maximization in Social Networks
    Ali, Junaid
    Babaei, Mahmoudreza
    Chakraborty, Abhijnan
    Mirzasoleiman, Baharan
    Gummadi, Krishna P.
    Singla, Adish
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2023, 35 (03) : 2875 - 2886
  • [27] Efficient Spread of Influence in Online Social Networks
    Nandi, Gypsy
    Das, Anjan
    COMPUTATIONAL INTELLIGENCE IN DATA MINING, VOL 2, 2015, 32 : 293 - 300
  • [28] Behavioral Information Diffusion for Opinion Maximization in Online Social Networks
    Hudson, Nathaniel
    Khamfroush, Hana
    IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING, 2021, 8 (02): : 1259 - 1268
  • [29] Misinformation blocking maximization in online social networks
    Yu, Lei
    Wang, Xiaohang
    Yu, Heng
    MULTIMEDIA TOOLS AND APPLICATIONS, 2024, 83 (23) : 62853 - 62874
  • [30] Time-bounded targeted influence spread in online social networks
    Yu, Lei
    Li, Guohui
    Yuan, Ling
    Zhang, Li
    MULTIMEDIA TOOLS AND APPLICATIONS, 2023, 82 (06) : 9065 - 9081