Abstract
Dynamic graph link prediction is a challenging problem because the graph topology and node attributes vary at different times. A purely supervised learning scheme for the dynamic graph data usually leads to poor generalization due to insufficient supervision. As a promising solution, self-supervised learning can be introduced to dynamic graph analysis tasks. However, the self-supervised learning paradigm for dynamic graph learning has not been sufficiently investigated due to the complicated properties of the evolving graphs. We assume that the dynamic graphs consist of three independent types of key factors, i.e., graph time-variant information, time-invariant information and noise. Based on this assumption, we propose the Self-supervised Decoupling for Dynamic Graph (SDDG) framework for explicitly decoupling the representation which characterizes these three factors, thus enhancing the interpretability of the learned representation and link prediction performance. More specifically, we design an encoder-decoder architecture to sufficiently exploit the dynamic graph itself with multiple regularizations, so that the time-variant embedding of dynamic graph data can be effectively decoupled from the perspectives of node and structure for time-variant-aware link prediction. Experiments on five benchmark link prediction tasks demonstrate the significant improvement of our SDDG over the state-of-the-art methods. For example, SDDG achieves 98.2% and 97.3% Top-1 AUC on Reddit-B and Reddit-T, outperforming the DDGCL model, by 1.9% and 1.8%, respectively.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Castilho, D., Gama, J., Mundim, L.R., de Carvalho, A.C.P.L.F.: Improving portfolio optimization using weighted link prediction in dynamic stock networks. In: Rodrigues, J.M.F., et al. (eds.) ICCS 2019. LNCS, vol. 11538, pp. 340–353. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-22744-9_27
Cheng, J., Liu, Y., Zhang, H., Wu, X., Chen, F.: A new recommendation algorithm based on user’s dynamic information in complex social network. Math. Prob. Eng. 2015, 1–6 (2015)
Chiang, W.L., Liu, X., Si, S., Li, Y., Bengio, S., Hsieh, C.J.: Cluster-GCN: an efficient algorithm for training deep and large graph convolutional networks. In: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 257–266 (2019)
Eldele, E., et al.: Time-series representation learning via temporal and contextual contrasting. arXiv preprint arXiv:2106.14112 (2021)
Farnoodian, N., Nijssen, S., Aversano, G.: Link prediction on CV graphs: a temporal graph neural network approach (2022)
Gomez, L., Patel, Y., Rusinol, M., Karatzas, D., Jawahar, C.: Self-supervised learning of visual features through embedding images into text topic spaces. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 4230–4239 (2017)
Gu, S., Wang, X., Shi, C., Xiao, D.: Self-supervised graph neural networks for multi-behavior recommendation. In: International Joint Conference on Artificial Intelligence (IJCAI) (2022)
Hamilton, W., Ying, Z., Leskovec, J.: Inductive representation learning on large graphs. In: Advances in Neural Information Processing Systems, vol. 30 (2017)
Jing, L., Tian, Y.: Self-supervised visual feature learning with deep neural networks: a survey. IEEE Trans. Pattern Anal. Mach. Intell. 43(11), 4037–4058 (2020)
Kumar, S., Hamilton, W.L., Leskovec, J., Jurafsky, D.: Community interaction and conflict on the web. In: Proceedings of the 2018 World Wide Web Conference, pp. 933–943 (2018)
Kumar, S., Spezzano, F., Subrahmanian, V., Faloutsos, C.: Edge weight prediction in weighted signed networks. In: 2016 IEEE 16th International Conference on Data Mining (ICDM), pp. 221–230. IEEE (2016)
Liu, X., et al.: Self-supervised learning: generative or contrastive. IEEE Trans. Knowl. Data Eng. 35, 857–876 (2023)
Liu, Y., et al.: Graph self-supervised learning: a survey. IEEE Trans. Knowl. Data Eng. 35, 5879–5900 (2022)
Panzarasa, P., Opsahl, T., Carley, K.M.: Patterns and dynamics of users’ behavior and interaction: network analysis of an online community. J. Am. Soc. Inform. Sci. Technol. 60(5), 911–932 (2009)
Pareja, A., et al.: EvolveGCN: evolving graph convolutional networks for dynamic graphs. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 34, pp. 5363–5370 (2020)
Perozzi, B., Al-Rfou, R., Skiena, S.: DeepWalk: online learning of social representations. In: Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 701–710 (2014)
Sankar, A., Wu, Y., Gou, L., Zhang, W., Yang, H.: DySAT: deep neural representation learning on dynamic graphs via self-attention networks. In: Proceedings of the 13th International Conference on Web Search and Data Mining, pp. 519–527 (2020)
Santoro, N., Quattrociocchi, W., Flocchini, P., Casteigts, A., Amblard, F.: Time-varying graphs and social network analysis: temporal indicators and metrics. arXiv preprint arXiv:1102.0629 (2011)
Seo, Y., Defferrard, M., Vandergheynst, P., Bresson, X.: Structured sequence modeling with graph convolutional recurrent networks. In: Cheng, L., Leung, A.C.S., Ozawa, S. (eds.) ICONIP 2018. LNCS, vol. 11301, pp. 362–373. Springer, Cham (2018). https://doi.org/10.1007/978-3-030-04167-0_33
Tian, S., Wu, R., Shi, L., Zhu, L., Xiong, T.: Self-supervised representation learning on dynamic graphs. In: Proceedings of the 30th ACM International Conference on Information & Knowledge Management, pp. 1814–1823 (2021)
Velickovic, P., Cucurull, G., Casanova, A., Romero, A., Lio, P., Bengio, Y.: Graph attention networks. Stat 1050, 20 (2017)
Wang, T., He, X.S., Zhou, M.Y., Fu, Z.Q.: Link prediction in evolving networks based on popularity of nodes. Sci. Rep. 7(1), 1–10 (2017)
Wang, Y., Chang, Y.Y., Liu, Y., Leskovec, J., Li, P.: Inductive representation learning in temporal networks via causal anonymous walks. arXiv preprint arXiv:2101.05974 (2021)
Welling, M., Kipf, T.N.: Semi-supervised classification with graph convolutional networks. In: International Conference on Learning Representations (2017)
Wu, X., Cheng, Q.: Stabilizing and enhancing link prediction through deepened graph auto-encoders. In: Proceedings of the IJCAI, vol. 2022, pp. 3587–3593. NIH Public Access (2022)
You, J., Du, T., Leskovec, J.: ROLAND: graph learning framework for dynamic graphs. In: Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 2358–2366 (2022)
Zhao, L., et al.: T-GCN: a temporal graph convolutional network for traffic prediction. IEEE Trans. Intell. Transp. Syst. 21(9), 3848–3858 (2019)
Acknowledgements
This research was supported by the National Key Research and Development Program of China (No. 2020YFC0833302), the National Natural Science Foundation of China under Grant (No. 62076059), the Science Project of Liaoning province under Grant (2021-MS-105) and the 111 Project (B16009).
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Wen, G. et al. (2023). Towards Time-Variant-Aware Link Prediction in Dynamic Graph Through Self-supervised Learning. In: Yang, X., et al. Advanced Data Mining and Applications. ADMA 2023. Lecture Notes in Computer Science(), vol 14179. Springer, Cham. https://doi.org/10.1007/978-3-031-46674-8_33
Download citation
DOI: https://doi.org/10.1007/978-3-031-46674-8_33
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-46673-1
Online ISBN: 978-3-031-46674-8
eBook Packages: Computer ScienceComputer Science (R0)