Ouyang Qi, Chen Hongchang, Liu Shuxin, Pu Liming, Ge Dongdong, Fan Ke
People's Liberation Army Strategic Support Force Information Engineering University, Zhengzhou, China.
National Digital Switching System Engineering and Technological R&D Center, Zhengzhou, China.
Big Data. 2024 Oct 23. doi: 10.1089/big.2023.0131.
Predicting propagation cascades is crucial for understanding information propagation in social networks. Existing methods always focus on structure or order of infected users in a single cascade sequence, ignoring the global dependencies of cascades and users, which is insufficient to characterize their dynamic interaction preferences. Moreover, existing methods are poor at addressing the problem of model robustness. To address these issues, we propose a predication model named DropMessage Hypergraph Attention Networks, which constructs a hypergraph based on the cascade sequence. Specifically, to dynamically obtain user preferences, we divide the diffusion hypergraph into multiple subgraphs according to the time stamps, develop hypergraph attention networks to explicitly learn complete interactions, and adopt a gated fusion strategy to connect them for user cascade prediction. In addition, a new drop immediately method DropMessage is added to increase the robustness of the model. Experimental results on three real-world datasets indicate that proposed model significantly outperforms the most advanced information propagation prediction model in both MAP@k and Hits@K metrics, and the experiment also proves that the model achieves more significant prediction performance than the existing model under data perturbation.
预测传播级联对于理解社交网络中的信息传播至关重要。现有方法总是关注单个级联序列中受感染用户的结构或顺序,而忽略了级联和用户的全局依赖性,这不足以表征它们的动态交互偏好。此外,现有方法在解决模型鲁棒性问题方面表现不佳。为了解决这些问题,我们提出了一种名为DropMessage超图注意力网络的预测模型,该模型基于级联序列构建超图。具体来说,为了动态获取用户偏好,我们根据时间戳将扩散超图划分为多个子图,开发超图注意力网络以明确学习完整的交互,并采用门控融合策略将它们连接起来进行用户级联预测。此外,添加了一种新的立即丢弃方法DropMessage以提高模型的鲁棒性。在三个真实世界数据集上的实验结果表明,所提出的模型在MAP@k和Hits@K指标上均显著优于最先进的信息传播预测模型,并且实验还证明,在数据扰动下,该模型比现有模型具有更显著的预测性能。