Link Prediction in Dynamic Social Networks Combining Entropy, Causality, and a Graph Convolutional Network Model
- PMID: 38920486
- PMCID: PMC11202929
- DOI: 10.3390/e26060477
Link Prediction in Dynamic Social Networks Combining Entropy, Causality, and a Graph Convolutional Network Model
Abstract
Link prediction is recognized as a crucial means to analyze dynamic social networks, revealing the principles of social relationship evolution. However, the complex topology and temporal evolution characteristics of dynamic social networks pose significant research challenges. This study introduces an innovative fusion framework that incorporates entropy, causality, and a GCN model, focusing specifically on link prediction in dynamic social networks. Firstly, the framework preprocesses the raw data, extracting and recording timestamp information between interactions. It then introduces the concept of "Temporal Information Entropy (TIE)", integrating it into the Node2Vec algorithm's random walk to generate initial feature vectors for nodes in the graph. A causality analysis model is subsequently applied for secondary processing of the generated feature vectors. Following this, an equal dataset is constructed by adjusting the ratio of positive and negative samples. Lastly, a dedicated GCN model is used for model training. Through extensive experimentation in multiple real social networks, the framework proposed in this study demonstrated a better performance than other methods in key evaluation indicators such as precision, recall, F1 score, and accuracy. This study provides a fresh perspective for understanding and predicting link dynamics in social networks and has significant practical value.
Keywords: causality analysis; dynamic social networks; graph convolutional networks (GCNs); link prediction; node2vec; temporal information entropy (TIE).
Conflict of interest statement
The authors declare no conflicts of interest.
Figures
References
-
- Rashid Y., Bhat J.I. An insight into topological, machine and Deep Learning-based approaches for influential node identification in social media networks: A systematic review. Multimed. Syst. 2024;30:57. doi: 10.1007/s00530-023-01258-9. - DOI
-
- McAuley J., Leskovec J. Learning to discover social circles in ego networks; Proceedings of the 25th International Conference on Neural Information Processing Systems; Red Hook, NY, USA. 3–6 December 2012; pp. 539–547.
-
- Yang J., Leskovec J. Defining and evaluating network communities based on ground-truth. Knowl. Inf. Syst. 2015;42:181–213. doi: 10.1007/s10115-013-0693-z. - DOI
-
- Vikash, Kumar T.V.V. Trust assessment in social networks. Int. J. Syst. Assur. Eng. Manag. :2023. doi: 10.1007/s13198-023-02118-5. - DOI
-
- Cai H., Zheng V.W., Chang K.C.-C. A Comprehensive Survey of Graph Embedding: Problems, Techniques, and Applications. IEEE Trans. Knowl. Data Eng. 2018;30:1616–1637. doi: 10.1109/TKDE.2018.2807452. - DOI
LinkOut - more resources
Full Text Sources
Miscellaneous
