Publications
Sort:
Issue
Microscopic diffusion prediction based on multifeature fusion and deep learning
Journal of Tsinghua University (Science and Technology) 2024, 64(4): 688-699
Published: 15 April 2024
Abstract PDF (5.8 MB) Collect
Downloads:4
Objective

Deep learning methods have been widely employed to enhance microscopic diffusion prediction in social networks. However, the existing methods have the problem of insufficient extraction of features in the information dissemination process. For example, these methods do not consider the impact of the propagation chain of the most recently infected nodes on the subsequent propagation of the message or the impact of changes in the neighboring nodes on the propagation path of the message. Therefore, the prediction accuracy is not high. To solve the above problems, describe the information diffusion process from multiple perspectives, and discover more hidden features, this paper proposes a microscopic diffusion prediction framework — multifeature fusion and deep learning for prediction (MFFDLP).

Methods

The microscopic diffusion prediction framework is divided into three main parts: extracting the static features from the network topology and the information diffusion sequence, capturing dynamic diffusion characteristics from the information diffusion graph, and predicting the next infected node. (1) First, node embedding and node structure context are extracted from historical friendship graphs and information diffusion sequences. The gate recurrent unit (GRU) is applied to mine the deep global temporal features from the connected vectors. To further enhance the role of the recently infected node, GRU is used to mine the local temporal features from the structure context of the node. These two features are fused to form the information diffusion sequence features. (2) Capture dynamic diffusion characteristics from the information diffusion graph. These features represent changes in users' interaction or interest. An information diffusion graph is built based on the historical information diffusion sequence. The diffusion graph is then divided into subgraphs in chronological order. A graph attention network is applied to capture the node features from each subgraph, and the edge features are aggregated from the node features. Using an embedding lookup method and fusing the nodes and their edge features, the dynamic diffusion characteristics of the users in an information diffusion sequence are obtained. (3) Predict the next infected node. To further analyze the context interaction within the diffusion sequences, a dual multihead self-attention mechanism is applied to separately capture the contextual information from information diffusion sequence features and node dynamic diffusion characteristics. Then, a fully connected layer and Softmax are used to predict the next infected node. Finally, experiments on three real networks show that the proposed method outperforms the state-of-the-art models. The experimental results demonstrate the unique advantages of MFFDLP for microscopic diffusion prediction.

Results

Comparative experimental results on three public datasets show that the proposed method outperforms the comparative methods by up to 9.98% in the accuracy of microscopic diffusion prediction.

Conclusions

This method comprehensively combines the friendship graph, information diffusion sequence, and diffusion graph. Multiple deep learning models are used to extract multiple features from static and dynamic perspectives. Comparative experiments on multiple datasets demonstrate that MFFDLP can mine and fuse multiple features more effectively, thus improving the prediction accuracy of information diffusion.

Issue
Social network information leakage node probability prediction based on the EDLATrust algorithm
Journal of Tsinghua University (Science and Technology) 2022, 62(2): 355-366
Published: 15 February 2022
Abstract PDF (3.2 MB) Collect
Downloads:0

Message forwarding is widely used in social network information systems. However, private information can be leaked without authorization from the information publisher. Privacy information leakage nodes need to be identified to eliminate such security risks. An estimator based distributed learning automata for trust inference (EDLATrust) is developed in this study to infer the trust level between non-directly connected nodes by reducing the number of convergence steps. The EDLATrust algorithm is combined with the XGBoost algorithm to identify privacy leakage in social network by using linear and group information transmission propagation models with three information dissemination characteristics. The algorithm predicts potential links in the information transmission chain and assists predicting information leakage points to improve the information dissemination security in social networks. Tests show that the model can effectively predict information leakage points in the information transmission chain for three real social network data sets to protect user privacy.

Total 2
1/11GOpage