Abstract
Dynamic network link prediction has practical applications in many areas, such as social networks, traffic networks, biological networks, and citation networks. Because of its essential practical significance, it has attracted the attention of many researchers. The key to dynamic network link prediction is to model the network topology evolution and capture time information. Currently, most studies divide dynamic networks into a series of static time snapshots, which can be considered a rough compressed of continuous-time dynamic networks. Such compression will lead to the loss of time evolution information in the window and how to choose the appropriate partition granularity is a considerable challenge. In this paper, we propose a link prediction method for continuous-time networks based on Random Walk and Time Aggregation(RWTA). In the method, we perform random walk with time-constrained directly on a continuous-time network to get node sequence without slicing into time snapshots. Then, based on skip-gram, the initial node representation is gotten, and the dynamic graph with node representation is created. A temporal proximity neighborhood aggregation process is designed to enhance node representation, and the binary operator is done to obtain edge representation. Finally, A classifier is utilized to predict links. Extensive experiments on real-world datasets show that our model outperforms other state-of-the-art methods.




Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Newman MEJ (2003) The structure and function of complex networks. SIAM Rev 45:167–256
Liben-Nowell D, Kleinberg JM (2007) The link-prediction problem for social networks. J Assoc Inf Sci Technol 58:1019–1031
Yang X, Yang X, Ling F, Zhang H, Zhang D, Xiao J (2018) Link prediction based on local major path degree. Modern Phys Lett B
Mikolov T, Chen K, Corrado GS, Dean J (2013) Efficient estimation of word representations in vector space. In: ICLR
Perozzi B, Al-Rfou R, Skien, S (2014) Deepwalk: online learning of social representations. Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining
Grover A, Leskovec J (2016) node2vec: Scalable feature learning for networks. Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
Kipf T Welling M (2017) Semi-supervised classification with graph convolutional networks. ArXiv abs/1609.02907
Velickovic P, Cucurull G, Casanova A, Romero A , Lio’ P, Bengio Y v Graph attention networks. ArXiv abs/1710.10903
Hao X, Li W (2021) Research on dynamic network link prediction. J Taiyuan Univ Technol 34:117–126
Adamic LA, Adar E (2003) Friends and neighbors on the web. Soc Netw 25:211–230
Wang D, Cui P, Zhu W (2016) Structural deep network embedding. Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
Zhang M, Chen Y (2018) Link prediction based on graph neural networks. ArXiv:abs/1802.09691
Mikolov T, Karafiát M, Burget L, Cernocký JH, Khudanpur S (2010) Recurrent neural network based language model. In: INTERSPEECH
Hochreiter S, Schmidhuber J (1997) Long short-term memory. Neural Comput 9:1735–1780
Cho, K., van Merrienboer, B., çaglar GülçSehre, Bahdanau, D., Bougares, F., Schwenk, H., Bengio, Y.: Learning phrase representations using rnn encoder-decoder for statistical machine translation. In: EMNLP (2014)
Goyal P, Chhetri SR, Canedo A (2020) dyngraph2vec: Capturing network dynamics using dynamic graph representation learning. ArXiv :abs/1809.02657
Hao X, Lian T, Wang L (2020) Dynamic link prediction by integrating node vector evolution and local neighborhood representation. Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval
Chen J, Wang X, Xu X (2022) Gc-lstm: graph convolution embedded lstm for dynamic network link prediction. Appl Intell 52:7513–7528
Sankar A, Wu Y, Gou L, Zhang W, Yang H (2020) Dysat: Deep neural representation learning on dynamic graphs via self-attention networks. Proceedings of the 13th International Conference on Web Search and Data Mining
Nguyen GH, Lee JB, Ross, RA, Ahmed N, Koh E, Kim S (2018) Continuous-time dynamic network embeddings. Companion Proceedings of the The Web Conference 2018
Xu D, Ruan, C, Körpeoglu E, Kumar S, Achan K (2020) Inductive representation learning on temporal graphs. ArXiv:abs/2002.07962
Xia F, Liu J, Nie H, Fu Y, Wan L, Kong X (2020) Random walks: a review of algorithms and applications. IEEE Trans Emerging Topics Comput Intell 4:95–107
Rossi RA, Ahmed N (2015)The network data repository with interactive graph analytics and visualization. In: AAAI
Chaintreau,A, Hui P, Crowcroft J, Diot C, Gass R, Scott J (2007) Impact of human mobility on opportunistic forwarding algorithms. IEEE Trans Mobile Comput 6
Isella L, Stehlé J, Barrat A, Cattuto C, Pinton J-F, den Broeck WV (2011) What’s in a crowd? analysis of face-to-face behavioral networks. J Theoretical Biol 271(1):166–80
Klimt B, Yang Y (2004) The enron corpus: A new dataset for email classification research. In: ECML
Michalski R, Palus S, Kazienko P (2011) Matching organizational structure and social network extracted from email communication. In: BIS
Opsahl T (2013) Triadic closure in two-mode networks: Redefining the global and local clustering coefficients. Soc Netw 35:159–167
Kumar S, Spezzano F, Subrahmanian, VS. Faloutsos, C (2016) Edge weight prediction in weighted signed networks. 2016 IEEE 16th International Conference on Data Mining (ICDM), 221–230
Lu L, Zhou T (2010) Link prediction in complex networks: a survey. ArXiv abs/1010.0725
Tang, J, Qu M, Wang M, Zhang M. Yan J, Mei Q (2015) Line: Large-scale information network embedding. Proceedings of the 24th International Conference on World Wide Web
Ren M, Zhang Q, Zhang J (2019) An introductory survey of probability density function control. Syst Sci Control Eng 7(1):158–170
Liu J, Liu Y, Zhang Q (2022) A weight initialization method based on neural network with asymmetric activation function. Neurocomputing 483:171–182
Acknowledgements
This work was supported by the National Natural Science Foundation of China (No. 61872260), National key research and development program of China (No. 2021YFB3300503) and Regional Innovation and Development Joint Fund oféNSFC (No. U22A20167).
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Zhang, M., Xu, B. & Wang, L. Dynamic network link prediction based on random walking and time aggregation. Int. J. Mach. Learn. & Cyber. 14, 2867–2875 (2023). https://doi.org/10.1007/s13042-023-01803-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s13042-023-01803-y