时序异构图自监督表示学习——多目标优化框架
Temporal Heterogeneous Graph Self-Supervised Representation Learning—Multi-Objective Optimization Framework
摘要: 文章提出了一种创新的时序异构图自监督嵌入框架,有效捕获图数据的异构性与时序动态特性。实验表明,该方法在链接预测和节点分类等任务中表现卓越,较现有基准方法平均提升1.7%~2.3%的性能。该框架优势源于三个核心创新:1) 层次化编码机制高效处理多类型节点与边的复杂交互;2) 基于Transformer的时序自注意力模型精确捕获长短期依赖关系;3) 融合掩码重建、对比学习与结构保持的多目标自监督框架显著减轻了对数据标注的依赖。消融研究证实,时序信息建模与异构关系建模对性能贡献最为显著,分别带来2.9%和2.3%的提升,同时文章提出的方法在处理稀疏关系方面表现也较为突出。本研究不仅推进了时序异构图表示学习的理论前沿,也为社交媒体分析、电商推荐等现实应用提供了有效的解决方案。
Abstract: This paper proposes an innovative temporal heterogeneous graph self-supervised embedding framework that effectively captures both graph heterogeneity and temporal dynamics. Experiments demonstrate that the proposed method excels in tasks such as link prediction and node classification, achieving 1.7%~2.3% average performance improvements over existing baseline methods. The framework’s advantages stem from three key innovations: 1) a hierarchical encoding mechanism that efficiently processes complex interactions between diverse node and edge types; 2) a Transformer-based temporal self-attention model that precisely captures both long-term and short-term dependencies; and 3) a multi-objective self-supervised learning framework integrating mask reconstruction, contrastive learning, and structure preservation that significantly reduces reliance on data annotation. Ablation studies confirm that temporal information modeling and heterogeneous relationship modeling contribute most significantly to performance gains, bringing improvements of 2.9% and 2.3%, respectively. Meanwhile, the proposed method also demonstrates outstanding performance in handling sparse relationships. This research not only advances the theoretical frontier of temporal heterogeneous graph representation learning but also provides effective solutions for real-world applications such as social media analysis and e-commerce recommendations.
文章引用:建一飞. 时序异构图自监督表示学习——多目标优化框架[J]. 建模与仿真, 2025, 14(5): 644-658. https://doi.org/10.12677/mos.2025.145422

参考文献

[1] Grover, A. and Leskovec, J. (2016) Node2vec: Scalable Feature Learning for Networks. Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Francisco, 13-17 August 2016, 855-864. [Google Scholar] [CrossRef] [PubMed]
[2] Tang, J., Qu, M., Wang, M., Zhang, M., Yan, J. and Mei, Q. (2015) LINE: Large-Scale Information Network Embedding. Proceedings of the 24th International Conference on World Wide Web, Florence, 18-22 May 2015, 1067-1077. [Google Scholar] [CrossRef
[3] Wang, X., Ji, H., Shi, C., Wang, B., Ye, Y., Cui, P., et al. (2019) Heterogeneous Graph Attention Network. The World Wide Web Conference, San Francisco, 13-17 May 2019, 2022-2032. [Google Scholar] [CrossRef
[4] Yin, Y., Ji, L., Zhang, J. and Pei, Y. (2019) DHNE: Network Representation Learning Method for Dynamic Heterogeneous Networks. IEEE Access, 7, 134782-134792. [Google Scholar] [CrossRef
[5] Xue, H., Yang, L., Jiang, W., Wei, Y., Hu, Y. and Lin, Y. (2021) Modeling Dynamic Heterogeneous Network for Link Prediction Using Hierarchical Attention with Temporal RNN. Machine Learning and Knowledge Discovery in Databases, Ghent, 14-18 September 2020, 282-298. [Google Scholar] [CrossRef
[6] Li, Q., Shang, Y., Qiao, X. and Dai, W. (2020) Heterogeneous Dynamic Graph Attention Network. 2020 IEEE International Conference on Knowledge Graph (ICKG), Nanjing, 9-11 August 2020, 404-411. [Google Scholar] [CrossRef
[7] Ai, W., Wei, Y., Shao, H., Shou, Y., Meng, T. and Li, K. (2024) Edge-Enhanced Minimum-Margin Graph Attention Network for Short Text Classification. Expert Systems with Applications, 251, Article 124069. [Google Scholar] [CrossRef
[8] Liu, H., Yang, D., Liu, X., Chen, X., Liang, Z., Wang, H., et al. (2024) TodyNet: Temporal Dynamic Graph Neural Network for Multivariate Time Series Classification. Information Sciences, 677, Article 120914. [Google Scholar] [CrossRef
[9] Veličković, P., Cucurull, G., Casanova, A., Romero, A., Lio, P. and Bengio, Y. (2017) Graph Attention Networks. arXiv: 1710.10903. [Google Scholar] [CrossRef
[10] Ji, Y., Jia, T., Fang, Y. and Shi, C. (2021) Dynamic Heterogeneous Graph Embedding via Heterogeneous Hawkes Process. Machine Learning and Knowledge Discovery in Databases. Research Track, Bilbao, 13-17 September 2021, 388-403. [Google Scholar] [CrossRef
[11] Jiao, Y., Xiong, Y., Zhang, J., Zhang, Y., Zhang, T. and Zhu, Y. (2022) Scalable Self-Supervised Graph Representation Learning via Enhancing and Contrasting Subgraphs. Knowledge and Information Systems, 64, 235-260. [Google Scholar] [CrossRef
[12] Kipf, T.N. and Welling, M. (2016) Semi-Supervised Classification with Graph Convolutional Networks. arXiv: 1609.02907. [Google Scholar] [CrossRef
[13] Veličković, P., Fedus, W., Hamilton, W.L., Liò, P., Bengio, Y. and Hjelm, R.D. (2018) Deep Graph Infomax. arXiv: 1809.10341. [Google Scholar] [CrossRef
[14] Hou, Z., Liu, X., Cen, Y., Dong, Y., Yang, H., Wang, C., et al. (2022) GraphMAE: Self-Supervised Masked Graph Autoencoders. Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Washington DC, 14-18 August 2022, 594-604. [Google Scholar] [CrossRef
[15] Oord, A.V.D., Li, Y. and Vinyals, O. (2018) Representation Learning with Contrastive Predictive Coding. arXiv: 1807.03748. [Google Scholar] [CrossRef
[16] Hamilton, W., Ying, Z. and Leskovec, J. (2017) Inductive Representation Learning on Large Graphs. Proceedings of the 31st International Conference on Neural Information Processing Systems, Long Beach, 4-9 December 2017, 1025-1035.
[17] Wu, Z., Pan, S., Chen, F., Long, G., Zhang, C. and Yu, P.S. (2021) A Comprehensive Survey on Graph Neural Networks. IEEE Transactions on Neural Networks and Learning Systems, 32, 4-24. [Google Scholar] [CrossRef] [PubMed]
[18] Zhang, Z., Cui, P. and Zhu, W. (2022) Deep Learning on Graphs: A Survey. IEEE Transactions on Knowledge and Data Engineering, 34, 249-270. [Google Scholar] [CrossRef
[19] Jin, W., Derr, T., Wang, Y., Ma, Y., Liu, Z. and Tang, J. (2021) Node Similarity Preserving Graph Convolutional Networks. Proceedings of the 14th ACM International Conference on Web Search and Data Mining, Virtual, 8-12 March 2021, 148-156. [Google Scholar] [CrossRef
[20] Chen, D., Lin, Y., Li, W., Li, P., Zhou, J. and Sun, X. (2020) Measuring and Relieving the Over-Smoothing Problem for Graph Neural Networks from the Topological View. Proceedings of the AAAI Conference on Artificial Intelligence, 34, 3438-3445. [Google Scholar] [CrossRef
[21] Li, T., Zhang, J., Yu, P.S., Zhang, Y. and Yan, Y. (2018) Deep Dynamic Network Embedding for Link Prediction. IEEE Access, 6, 29219-29230. [Google Scholar] [CrossRef
[22] Dong, Y., Chawla, N.V. and Swami, A. (2017) Metapath2vec: Scalable Representation Learning for Heterogeneous Networks. Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Halifax, 13-17 August 2017, 135-144. [Google Scholar] [CrossRef
[23] Trivedi, R., Farajtabar, M., Biswal, P. and Zha, H. (2019) DyRep: Learning Representations Over Dynamic Graphs. 7th International Conference on Learning Representations, New Orleans, 6-9 May 2019.
[24] Borgwardt, K., Kriegel, H. and Wackersreuther, P. (2006) Pattern Mining in Frequent Dynamic Subgraphs. Sixth International Conference on Data Mining (ICDM’06), Hong Kong, 18-22 December 2006, 818-822. [Google Scholar] [CrossRef
[25] Goyal, P., Chhetri, S.R. and Canedo, A. (2020) Dyngraph2vec: Capturing Network Dynamics Using Dynamic Graph Representation Learning. Knowledge-Based Systems, 187, Article 104816. [Google Scholar] [CrossRef
[26] Sankar, A., Wu, Y., Gou, L., Zhang, W. and 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, Houston, 3-7 February 2020, 519-527. [Google Scholar] [CrossRef
[27] Qiu, J., Chen, Q., Dong, Y., Zhang, J., Yang, H., Ding, M., et al. (2020) GCC: Graph Contrastive Coding for Graph Neural Network Pre-Training. Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, Virtual, 6-10 July 2020, 1150-1160. [Google Scholar] [CrossRef