Improved information diffusion models based on a new two-sided sign-aware matching framework in complex networks

被引:2
作者
Mohammadi, Sohameh [1 ,2 ]
Nadimi-Shahraki, Mohammad H. [1 ,2 ]
Beheshti, Zahra [1 ,2 ]
Zamanifar, Kamran [3 ]
机构
[1] Islamic Azad Univ, Fac Comp Engn, Najafabad Branch, Najafabad, Iran
[2] Islamic Azad Univ, Big Data Res Ctr, Najafabad Branch, Najafabad, Iran
[3] Univ Isfahan, Dept Software Engn, Esfahan, Iran
关键词
Complex networks; Information diffusion model; Influence propagation; Influence maximization; Viral marketing; INFLUENCE MAXIMIZATION; SOCIAL NETWORKS; POSITIVE INFLUENCE;
D O I
10.1016/j.chaos.2024.115298
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
The information diffusion model is an important trending topic in the influence maximization problem that companies use it aiming to promote effective viral advertising campaigns at a low cost. The majority of existing models still do not fulfill the need for sufficient prediction accuracy in real-world applications. The main reason is that most of the current information diffusion models do not consider some important aspects of complicated relationships among network users. As one of the important users' relationships aspects, there are extensively reciprocal relationships along with parasocial relationships simultaneously based on different trust levels, including trust, mediocre trust, and distrust relationships in almost all real-world complex networks, but these models have not considered them. Motivated by these limitations, in this study, we introduce a two-sided signaware matching (TSM) framework to comprehensively describe the influence propagation process according to two new scenarios in signed social networks (SSNs). Under the TSM framework, we propose four effective information diffusion models: SCSI-B, SCSI-N, STSI-B, and STSI-N, which are divided into the cascade and threshold-based group of models. The experimental results on real-world SSNs showed that the proposed models outperform the state-of-the-art baselines with improvements ranging from 7.4% to 20.8% in terms of the F-score metric according to their corresponding scenarios. In addition, the improvements of proposed models against classic baselines are from 24.9 % to 45 %, and hence they can be used to facilitate intelligent decision-making in viral marketing.
引用
收藏
页数:21
相关论文
共 50 条
[1]  
Ahmed S., 2013, P 28 ANN ACM S APPL, P121
[2]   Negative influence blocking maximization with uncertain sources under the independent cascade model [J].
Chen, Ling ;
Zhang, Yuliang ;
Chen, Yixin ;
Li, Bin ;
Liu, Wei .
INFORMATION SCIENCES, 2021, 564 :343-367
[3]  
Domingos P., 2001, KDD-2001. Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, P57, DOI 10.1145/502512.502525
[4]   TSIFIM: A three-stage iterative framework for influence maximization in complex networks [J].
Dong, Chen ;
Xu, Guiqiong ;
Yang, Pingle ;
Meng, Lei .
EXPERT SYSTEMS WITH APPLICATIONS, 2023, 212
[5]   Evolutionary multiobjective optimization to target social network influentials in viral marketing [J].
Francisco Robles, Juan ;
Chica, Manuel ;
Cordon, Oscar .
EXPERT SYSTEMS WITH APPLICATIONS, 2020, 147
[6]   Reciprocal versus parasocial relationships in online social networks [J].
Gong, Neil Zhenqiang ;
Xu, Wenchang .
SOCIAL NETWORK ANALYSIS AND MINING, 2014, 4 (01) :1-14
[7]  
Goyal Amit, 2010, P 3 ACM INT C WEB SE, P241
[8]  
Guha R., 2004, P 13 INT C WORLD WID, P403, DOI DOI 10.1145/988672.988727
[9]   Heterogeneous network influence maximization algorithm based on multi-scale propagation strength and repulsive force of propagation field [J].
Guo, Chang ;
Li, Weimin ;
Wang, Jingchao ;
Yu, Xiao ;
Liu, Xiao ;
Luvembe, Alex Munyole ;
Wang, Can ;
Jin, Qun .
KNOWLEDGE-BASED SYSTEMS, 2024, 291
[10]   Positive opinion maximization in signed social networks [J].
He, Qiang ;
Sun, Lihong ;
Wang, Xingwei ;
Wang, Zhenkun ;
Huang, Min ;
Yi, Bo ;
Wang, Yuantian ;
Ma, Lianbo .
INFORMATION SCIENCES, 2021, 558 :34-49