Page 234 - 《软件学报》2026年第2期

秦者云 等: 基于结构关系建模的自监督图表示学习 713

Engineering, 2023, 35(6): 5879–5900. [doi: 10.1109/TKDE.2022.3172903]
[9] Jiao YZ, Xiong Y, Zhang JW, Zhang Y, Zhang TQ, Zhu YY. Sub-graph contrast for scalable self-supervised graph representation
learning. In: Proc. of the 2020 IEEE Int’l Conf. on Data Mining. Sorrento: IEEE, 2020. 222–231. [doi: 10.1109/ICDM50108.2020.00031]
[10] Qiu JZ, Chen QB, Dong YX, Zhang J, Yang HX, Ding M, Wang KS, Tang J. GCC: Graph contrastive coding for graph neural network
pre-training. In: Proc. of the 26th ACM SIGKDD Int’l Conf. on Knowledge Discovery & Data Mining. ACM, 2020. 1150–1160. [doi: 10.
1145/3394486.3403168]
[11] Hafidi H, Ghogho M, Ciblat P, Swami A. Negative sampling strategies for contrastive self-supervised learning of graph representations.
Signal Processing, 2022, 190: 108310. [doi: 10.1016/J.SIGPRO.2021.108310]
[12] Zhu YQ, Xu YC, Yu F, Liu Q, Wu S, Wang L. Deep graph contrastive representation learning. arXiv:2006.04131, 2020.
[13] Yin YH, Wang QZ, Huang SY, Xiong HY, Zhang X. AutoGCL: Automated graph contrastive learning via learnable view generators. In:
Proc. of the 36th AAAI Conf. on Artificial Intelligence. AAAI, 2022: 8892–8900. [doi: 10.1609/aaai.v36i8.20871]
[14] Li HY, Wang X, Zhang ZW, Yuan ZH, Li H, Zhu WW. Disentangled contrastive learning on graphs. In: Proc. of the 35th Int’l Conf. on
Neural Information Processing Systems. Curran Associates Inc., 2021: 1674.
[15] Li HY, Zhang ZW, Wang X, Zhu WW. Disentangled graph contrastive learning with independence promotion. IEEE Trans. on
Knowledge and Data Engineering, 2023, 35(8): 7856–7869. [doi: 10.1109/TKDE.2022.3206875]
[16] Kipf TN, Welling M. Variational graph auto-encoders. arXiv:1611.07308, 2016.
[17] Pan SR, Hu RQ, Long GD, Jiang J, Yao LN, Zhang CQ. Adversarially regularized graph autoencoder for graph embedding. In: Proc. of
the 27th Int’l Joint Conf. on Artificial Intelligence. Stockholm: ijcai.org, 2018. 2609–2615.
[18] Salehi A, Davulcu H. Graph attention auto-encoders. In: Proc. of the 32nd IEEE Int’l Conf. on Tools with Artificial Intelligence.
Baltimore: IEEE, 2019. 989–996. [doi: 10.1109/ICTAI50040.2020.00154]
[19] Tang MY, Li P, Yang C. Graph auto-encoder via neighborhood wasserstein reconstruction. In: Proc. of the 10th Int’l Conf. on Learning
Representations. OpenReview.net, 2022.
[20] García-Durán A, Niepert M. Learning graph representations with embedding propagation. In: Proc. of the 31st Int’l Conf. on Neural
Information Processing Systems. Long Beach: Curran Associates Inc., 2017. 5125–5136.
[21] Hou ZY, Liu X, Cen YK, Dong YX, Yang HX, Wang CJ, Tang J. GraphMAE: Self-supervised masked graph autoencoders. In: Proc. of
the 28th ACM SIGKDD Conf. on Knowledge Discovery and Data Mining. Washington: ACM, 2022. 594–604. [doi: 10.1145/3534678.
3539321]
[22] Hou ZY, He YF, Cen YK, Liu X, Dong YX, Kharlamov E, Tang J. GraphMAE2: A decoding-enhanced masked self-supervised graph
learner. In: Proc. of the 2023 ACM Web Conf. Austin: ACM, 2023. 737–746. [doi: 10.1145/3543507.3583379]
[23] Zheng CB, Yang ZC, Lu Y. GMAE: Representation learning on graph via masked graph autoencoders. In: Proc. of the 27th Int’l Conf. on
Computer Supported Cooperative Work in Design. Tianjin: IEEE, 2024. 2515–2521. [doi: 10.1109/CSCWD61410.2024.10580417]
[24] Liu C, Yao ZL, Zhan YB, Ma XQ, Tao DP, Wu J, Hu WB, Pan SR, Du B. Hi-GMAE: Hierarchical graph masked autoencoders. arXiv:
2405.10642, 2024.
[25] Zhu YQ, Xu WZ, Zhang JH, Liu Q, Wu S, Wang L. Deep graph structure learning for robust representations: A survey. arXiv:
2103.03036, 2021.
[26] Jin W, Ma Y, Liu XR, Tang XF, Wang SH, Tang JL. Graph structure learning for robust graph neural networks. In: Proc. of the 26th
ACM SIGKDD Int’l Conf. on Knowledge Discovery & Data Mining. ACM, 2020. 66–74. [doi: 10.1145/3394486.3403049]
[27] Chen Y, Wu LF, Zaki MJ. Iterative deep graph learning for graph neural networks: Better and robust node embeddings. In: Proc. of the
34th Int’l Conf. on Neural Information Processing Systems. Vancouver: Curran Associates Inc., 2020: 1620.
[28] Sun QY, Li JX, Peng H, Wu J, Fu XC, Ji C, Yu PS. Graph structure learning with variational information bottleneck. In: Proc. of the 36th
AAAI Conf. on Artificial Intelligence. AAAI, 2022: 4165–4174. [doi: 10.1609/aaai.v36i4.20335]
[29] Zeng HQ, Zhou HK, Srivastava A, Kannan R, Prasanna VK. GraphSAINT: Graph sampling based inductive learning method. In: Proc. of
the 8th Int’l Conf. on Learning Representations. Addis Ababa: OpenReview.net, 2020.
[30] Xu MH, Wang H, Ni BB, Guo HY, Tang J. Self-supervised graph-level representation learning with local and global structure. In: Proc.
of the 38th Int’l Conf. on Machine Learning. PMLR, 2021. 11548–11558.
[31] Chung F. The heat kernel as the pagerank of a graph. Proc. of the National Academy of Sciences of the United States of America, 2007,
104(50): 19735–19740. [doi: 10.1073/pnas.0708838104]
[32] Gasteiger J, Weißenberger S, Günnemann S. Diffusion improves graph learning. In: Proc. of the 33rd Int’l Conf. on Neural Information
Processing Systems. Vancouver: Curran Associates Inc., 2019. 1197.
[33] Karypis G, Kumar V. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM Journal on Scientific Computing,