Graph Learning · Research survey

References

Formatted in IEEE style.

  1. [1] F. Xia, K. Sun, S. Yu, A. Aziz, L. Wan, S. Pan, et al., “Graph learning: A survey”, IEEE Transactions on Artificial Intelligence, vol. 2, no. 2, pp. 109–127, 2021.
  2. [2] D. Zhang, J. Yin, X. Zhu, and C. Zhang, “Network Representation Learning: A Survey”, IEEE Trans. Big Data, vol. 6, no. 1, pp. 3–28, 2020.
  3. [3] A. Shehzad, F. Xia, S. Abid, C. Peng, S. Yu, D. Zhang, et al., “Graph transformers: A survey”, arXiv preprint arXiv:2407.09777, 2024.
  4. [4] Z. Zhou, Y. Liu, J. Ding, D. Jin, and Y. Li, “Hierarchical knowledge graph learning enabled socioeconomic indicator prediction in location-based social network”, in Proceedings of the ACM Web Conference 2023, pp. 122–132, 2023.
  5. [5] S. Yu, Y. Li, S. Wang, T. Tang, Q. Zhang, J. Zhou, et al., “CaGE: A Causality-inspired Graph Neural Network Explainer for Recommender Systems”, ACM Transactions on Information Systems, 2025.
  6. [6] C. Peng, F. Xia, M. Naseriparsa, and F. Osborne, “Knowledge graphs: Opportunities and challenges”, Artificial Intelligence Review, vol. 56, no. 11, pp. 13071–13102, 2023.
  7. [7] S. Yu, Y. Wang, Z. Wan, Y. Shen, Q. Zhang, and F. Xia, “Path-aware Few-shot Knowledge Graph Completion”, IEEE Transactions on Artificial Intelligence, pp. 1-14, 2025.
  8. [8] J. Liu, F. Xia, L. Wang, B. Xu, X. Kong, H. Tong, et al., “Shifu2: A network representation learning based model for advisor-advisee relationship mining”, IEEE Transactions on Knowledge and Data Engineering, vol. 33, no. 4, pp. 1763–1777, 2019.
  9. [9] J. Liu, F. Xia, X. Feng, J. Ren, and H. Liu, “Deep graph learning for anomalous citation detection”, IEEE Transactions on Neural Networks and Learning Systems, vol. 33, no. 6, pp. 2543–2557, 2022.
  10. [10] X. Kong, K. Wang, M. Hou, F. Xia, G. Karmakar, and J. Li, “Exploring human mobility for multi-pattern passenger prediction: A graph learning framework”, IEEE Transactions on Intelligent Transportation Systems, vol. 23, no. 9, pp. 16148–16160, 2022.
  11. [11] W. Weng, M. Wu, H. Jiang, W. Kong, X. Kong, and F. Xia, “Pattern-Matching Dynamic Memory Network for Dual-Mode Traffic Prediction”, IEEE Transactions on Intelligent Transportation Systems, pp. 1-15, 2025.
  12. [12] S. Yu, S. Jin, M. Li, T. Sarwar, and F. Xia, “Long-range brain graph transformer”, Advances in Neural Information Processing Systems, vol. 37, pp. 24472–24495, 2024.
  13. [13] C. Peng, Y. Huang, Q. Dong, S. Yu, F. Xia, C. Zhang, et al., “Biologically Plausible Brain Graph Transformer”, in The Thirteenth International Conference on Learning Representations, 2025.
  14. [14] L. Brynte, J. P. Iglesias, C. Olsson, and F. Kahl, “Learning Structure-From-Motion with Graph Attention Networks”, in IEEE/CVF Conference on Computer Vision and Pattern Recognition, pp. 4808–4817, 2024.
  15. [15] Q. He, Z. Wang, H. Zeng, Y. Zeng, and Y. Liu, “SVGA-Net: Sparse Voxel-Graph Attention Network for 3D Object Detection from Point Clouds”, in Thirty-Sixth AAAI Conference on Artificial Intelligence, pp. 870–878, 2022.
  16. [16] S. Pan, R. Hu, S. Fung, G. Long, J. Jiang, and C. Zhang, “Learning Graph Embedding With Adversarial Training Methods”, IEEE Trans. Cybern., vol. 50, no. 6, pp. 2475–2487, 2020.
  17. [17] J. Bruna, W. Zaremba, A. Szlam, and Y. LeCun, “Spectral Networks and Locally Connected Networks on Graphs”, in 2nd International Conference on Learning Representations, 2014.
  18. [18] A. Vaswani, N. Shazeer, N. Parmar, J. Uszkoreit, L. Jones, A. N. Gomez, et al., “Attention is All you Need”, in Advances in Neural Information Processing Systems, 2017.
  19. [19] S. Luan, C. Hua, Q. Lu, L. Ma, L. Wu, X. Wang, et al., “The heterophilic graph learning handbook: Benchmarks, models, theoretical analysis, applications and challenges”, arXiv preprint arXiv:2407.09618, 2024.
  20. [20] C. A Choquette-Choo, A. Ganesh, R. McKenna, H B. McMahan, J. Rush, A. Guha Thakurta, et al., “(Amplified) Banded Matrix Factorization: A unified approach to private training”, Advances in Neural Information Processing Systems, vol. 36, 2024.
  21. [21] G. H. Golub and C. H. Reinsch, “Singular value decomposition and least squares solutions”, in Milestones in Matrix Computation - Selected Works of Gene H. Golub, with Commentaries, pp. 160–180, 2007.
  22. [22] L. Wan, Z. Fu, Y. Ling, Y. Sun, X. Li, L. Sun, et al., “Z-Laplacian Matrix Factorization: Network Embedding With Interpretable Graph Signals”, IEEE Transactions on Knowledge and Data Engineering, vol. 36, no. 8, pp. 4331–4345, 2023.
  23. [23] D. Li, S. Kosugi, Y. Zhang, M. Okumura, F. Xia, and R. Jiang, “Revisiting dynamic graph clustering via matrix factorization”, in Proceedings of the ACM on Web Conference, pp. 1342–1352, 2025.
  24. [24] C. Yang, Z. Liu, D. Zhao, M. Sun, and E. Y. Chang, “Network Representation Learning with Rich Text Information”, in Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, pp. 2111–2117, 2015.
  25. [25] N. Lao and W. W. Cohen, “Relational retrieval using a combination of path-constrained random walks”, Mach. Learn., vol. 81, no. 1, pp. 53–67, 2010.
  26. [26] G. H. Nguyen, J. B. Lee, R. A Rossi, N. K Ahmed, E. Koh, and S. Kim, “Continuous-time dynamic network embeddings”, in Companion proceedings of the the web conference 2018, pp. 969–976, 2018.
  27. [27] F. Xia, J. Liu, H. Nie, Y. Fu, L. Wan, and X. Kong, “Random walks: A review of algorithms and applications”, IEEE Transactions on Emerging Topics in Computational Intelligence, vol. 4, no. 2, pp. 95–107, 2019.
  28. [28] R. Levie, “A graphon-signal analysis of graph neural networks”, Advances in Neural Information Processing Systems, vol. 36, 2024.
  29. [29] A. Sandryhaila and J. M. F. Moura, “Discrete Signal Processing on Graphs”, IEEE Trans. Signal Process., vol. 61, no. 7, pp. 1644–1656, 2013.
  30. [30] S. Chen, R. Varma, A. Sandryhaila, and J. Kovacevic, “Discrete Signal Processing on Graphs: Sampling Theory”, IEEE Trans. Signal Process., vol. 63, no. 24, pp. 6510–6523, 2015.
  31. [31] S. K. Narang, A. Gadde, and A. Ortega, “Signal processing techniques for interpolation in graph structured data”, in IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP, pp. 5445–5449, 2013.
  32. [32] G. Corso, H. Stark, S. Jegelka, T. Jaakkola, and R. Barzilay, “Graph neural networks”, Nature Reviews Methods Primers, vol. 4, no. 1, pp. 17, 2024.
  33. [33] Y. Zhou, H. Zheng, X. Huang, S. Hao, D. Li, and J. Zhao, “Graph neural networks: Taxonomy, advances, and trends”, ACM Transactions on Intelligent Systems and Technology (TIST), vol. 13, no. 1, pp. 1–54, 2022.
  34. [34] F. Xia, L. Wang, T. Tang, X. Chen, X. Kong, G. Oatley, et al., “CenGCN: Centralized convolutional networks with vertex imbalance for scale-free graphs”, IEEE Transactions on Knowledge and Data Engineering, vol. 35, no. 5, pp. 4555–4569, 2022.
  35. [35] P. Velickovic, G. Cucurull, A. Casanova, A. Romero, P. Lio, and Y. Bengio, “Graph attention networks”, in ICLR, 2018.
  36. [36] S. Cao, W. Lu, and Q. Xu, “Deep Neural Networks for Learning Graph Representations”, in Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, pp. 1145–1152, 2016.
  37. [37] D. Wang, P. Cui, and W. Zhu, “Structural Deep Network Embedding”, in Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Francisco, CA, USA, August 13-17, 2016, pp. 1225–1234, 2016.
  38. [38] N K. Thomas and M. Welling, “Variational graph auto-encoders.”, in Neural Information Processing Systems Workshop on Bayesian Deep Learning, 2016.
  39. [39] U. A. Bhatti, H. Tang, G. Wu, S. Marjan, and A. Hussain, “Deep learning with graph convolutional networks: An overview and latest applications in computational intelligence”, International Journal of Intelligent Systems, vol. 2023, no. 1, pp. 8342104, 2023.
  40. [40] Z. Qin, S. Yang, and Y. Zhong, “Hierarchically gated recurrent neural network for sequence modeling”, Advances in Neural Information Processing Systems, vol. 36, 2024.
  41. [41] G. Van Houdt, C. Mosquera, and G. N\'apoles, “A review on the long short-term memory model”, Artificial Intelligence Review, vol. 53, no. 8, pp. 5929–5955, 2020.
  42. [42] B. Perozzi, R. Al-Rfou, and S. Skiena, “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.
  43. [43] A. Grover and J. Leskovec, “node2vec: Scalable feature learning for networks”, in Proceedings of the 22nd ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 855–864, 2016.
  44. [44] C. Tu, W. Zhang, Z. Liu, M. Sun, and others, “Max-margin deepwalk: Discriminative learning of network representation.”, in IJCAI, vol. 2016, pp. 3889–3895, 2016.
  45. [45] D. Luo, Y. Bian, Y. Yan, X. B. Yu, J. Huan, X. Liu, et al., “Random Walk on Multiple Networks”, IEEE Trans. Knowl. Data Eng., vol. 35, no. 8, pp. 8417–8430, 2023.
  46. [46] R. Hussein, D. Yang, and P. Cudr\'e-Mauroux, “Are Meta-Paths Necessary?: Revisiting Heterogeneous Graph Embeddings”, in Proceedings of the 27th ACM International Conference on Information and Knowledge Management, CIKM, pp. 437–446, 2018.
  47. [47] G. Wan, B. Du, S. Pan, and G. Haffari, “Reinforcement Learning Based Meta-Path Discovery in Large-Scale Heterogeneous Information Networks”, in The Thirty-Fourth AAAI Conference on Artificial Intelligence, pp. 6094–6101, 2020.
  48. [48] A. El-Kishky, T. Markovich, S. Park, C. Verma, B. Kim, R. Eskander, et al., “TwHIN: Embedding the Twitter Heterogeneous Information Network for Personalized Recommendation”, in The 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, KDD, pp. 2842–2850, 2022.
  49. [49] L. R\'egnier, M. Dolgushev, S Redner, and O. B\'enichou, “Universal exploration dynamics of random walks”, Nature Communications, vol. 14, no. 1, pp. 618, 2023.
  50. [50] K. Zelenkovski, T. Sandev, R. Metzler, L. Kocarev, and L. Basnarkov, “Random walks on networks with centrality-based stochastic resetting”, Entropy, vol. 25, no. 2, pp. 293, 2023.
  51. [51] A. Ortega, P. Frossard, J. Kovacevi\'c, J. M. Moura, and P. Vandergheynst, “Graph signal processing: Overview, challenges, and applications”, Proceedings of the IEEE, vol. 106, no. 5, pp. 808–828, 2018.
  52. [52] D. I. Shuman, S. K. Narang, P. Frossard, A. Ortega, and P. Vandergheynst, “The Emerging Field of Signal Processing on Graphs: Extending High-Dimensional Data Analysis to Networks and Other Irregular Domains”, IEEE Signal Process. Mag., vol. 30, no. 3, pp. 83–98, 2013.
  53. [53] W. Luo, Y. H. Lee, X. Jian, and T. Hao, “A New Method for GPR Clutter Suppression Based on Stationary Graph Signals Processing”, IEEE Trans. Geosci. Remote. Sens., vol. 63, pp. 1–12, 2025.
  54. [54] A. Hashemi, R. Shafipour, H. Vikalo, and G. Mateos, “Towards accelerated greedy sampling and reconstruction of bandlimited graph signals”, Signal Process., vol. 195, pp. 108505, 2022.
  55. [55] J. Liu, F. Xia, J. Ren, B. Xu, G. Pang, and L. Chi, “Mirror: Mining implicit relationships via structure-enhanced graph convolutional networks”, ACM Transactions on Knowledge Discovery from Data, vol. 17, no. 4, pp. 1–24, 2023.
  56. [56] J. Ren, F. Xia, I. Lee, A. Noori Hoshyar, and C. Aggarwal, “Graph Learning for Anomaly Analytics: Algorithms, Applications, and Challenges”, ACM Transactions on Intelligent Systems and Technology, vol. 14, no. 2, pp. 29, 2023.
  57. [57] J. Ren, F. Xia, X. Chen, J. Liu, M. Hou, A. Shehzad, et al., “Matching Algorithms: Fundamentals, Applications and Challenges”, IEEE Transactions on Emerging Topics in Computational Intelligence, vol. 5, no. 3, pp. 332-350, 2021.
  58. [58] L. Wang, J. Ren, B. Xu, J. Li, W. Luo, and F. Xia, “Model: Motif-based deep feature learning for link prediction”, IEEE Transactions on Computational Social Systems, vol. 7, no. 2, pp. 503–516, 2020.
  59. [59] X. Ren, J. Tang, D. Yin, N. Chawla, and C. Huang, “A survey of large language models for graphs”, in Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 6616–6626, 2024.
  60. [60] Y. Ma, Y. Tian, N. Moniz, and N. V Chawla, “Class-imbalanced learning on graphs: A survey”, ACM Computing Surveys, vol. 57, no. 8, pp. 1–16, 2025.
  61. [61] Z. Li, Y. Li, Y. Luo, G. Li, and C. Zhang, “Graph neural networks for databases: A survey”, arXiv preprint arXiv:2502.12908, 2025.
  62. [62] Z. Guo, Z. Wu, T. Xiao, C. Aggarwal, H. Liu, and S. Wang, “Counterfactual learning on graphs: A survey”, Machine Intelligence Research, vol. 22, no. 1, pp. 17–59, 2025.
  63. [63] S. Yu, Y. Wang, R. Li, G. Liu, Y. Shen, S. Ji, et al., “Graph2text or Graph2token: A Perspective of Large Language Models for Graph Learning”, arXiv preprint arXiv:2501.01124, 2025.
  64. [64] L. Zeng, S. Ye, X. Chen, X. Zhang, J. Ren, J. Tang, et al., “Edge Graph Intelligence: Reciprocally Empowering Edge Networks with Graph Intelligence”, IEEE Communications Surveys & Tutorials, 2025.
  65. [65] B. Wu, Y. Wang, Y. Zeng, J. Liu, J. Zhao, C. Yang, et al., “Graph Foundation Models for Recommendation: A Comprehensive Survey”, arXiv preprint arXiv:2502.08346, 2025.
  66. [66] W. Ju, S. Yi, Y. Wang, Q. Long, J. Luo, Z. Xiao, et al., “A survey of data-efficient graph learning”, in Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, pp. 8104–8113, 2024.
  67. [67] F. G. Febrinanto, F. Xia, K. Moore, C. Thapa, and C. Aggarwal, “Graph lifelong learning: A survey”, IEEE Computational Intelligence Magazine, vol. 18, no. 1, pp. 32–51, 2023.
  68. [68] C. Peng, J. He, and F. Xia, “Learning on Multimodal Graphs: A Survey”, arXiv preprint arXiv:2402.05322, 2024.
  69. [69] J. Li, H. Chen, Z. Li, A. Zhang, X. Wang, X. Wang, et al., “Generative Adversarial Network Based Image-Scaling Attack and Defense Modeling”, IEEE Transactions on Emerging Topics in Computational Intelligence, vol. 9, no. 1, pp. 861-873, 2025.
  70. [70] Z. Huang, W. Zhou, Y. Li, X. Wu, C. Xu, J. Fang, et al., “SEHG: Bridging Interpretability and Prediction in Self-Explainable Heterogeneous Graph Neural Networks”, in Proceedings of the ACM on Web Conference, pp. 1292–1304, 2025.
  71. [71] M. Nandan, S. Mitra, and D. De, “GraphXAI: a survey of graph neural networks (GNNs) for explainable AI (XAI)”, Neural Computing and Applications, pp. 1–52, 2025.
  72. [72] R. Luo, T. Tang, F. Xia, J. Liu, C. Xu, L. Y. Zhang, et al., “Algorithmic Fairness: A Tolerance Perspective”, arXiv preprint arXiv:2405.09543, 2024.
  73. [73] K. Duan, Z. Liu, P. Wang, W. Zheng, K. Zhou, T. Chen, et al., “A comprehensive study on large-scale graph training: Benchmarking and rethinking”, Advances in Neural Information Processing Systems, vol. 35, pp. 5376–5389, 2022.
  74. [74] A. Shehzad, D. Zhang, S. Yu, S. Abid, D. K. Kumar, and F. Xia, “Multiscale Graph Transformer for Brain Disorder Diagnosis”, IEEE Transactions on Consumer Electronics, 2025.
  75. [75] W. Hu, M. Fey, M. Zitnik, Y. Dong, H. Ren, B. Liu, et al., “Open graph benchmark: Datasets for machine learning on graphs”, Advances in neural information processing systems, vol. 33, pp. 22118–22133, 2020.
  76. [76] W. Hu, M. Fey, H. Ren, M. Nakata, Y. Dong, and J. Leskovec, “OGB-LSC: A Large-Scale Challenge for Machine Learning on Graphs”, Advances in neural information processing systems, 2021.
  77. [77] W. Hamilton, Z. Ying, and J. Leskovec, “Inductive representation learning on large graphs”, Advances in neural information processing systems, vol. 30, 2017.
  78. [78] J. Yang and J. Leskovec, “Defining and evaluating network communities based on ground-truth”, in Proceedings of the ACM SIGKDD workshop on mining data semantics, pp. 1–8, 2012.
  79. [79] H. Ma, Y. Rong, and J. Huang, “Graph Neural Networks: Scalability”, Graph Neural Networks: Foundations, Frontiers, and Applications, pp. 99–119, 2022.
  80. [80] N. Shabani, J. Wu, A. Beheshti, Q. Z Sheng, J. Foo, V. Haghighi, et al., “A comprehensive survey on graph summarization with graph neural networks”, IEEE Transactions on Artificial Intelligence, vol. 5, no. 8, pp. 3780-3800, 2024.
  81. [81] M. Besta and T. Hoefler, “Parallel and distributed graph neural networks: An in-depth concurrency analysis”, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 46, no. 5, pp. 2584-2606, 2024.
  82. [82] Y. Chen, H. Ye, S. Vedula, A. Bronstein, R. Dreslinski, T. Mudge, et al., “Demystifying graph sparsification algorithms in graph properties preservation”, Proceedings of the VLDB Endowment, vol. 17, no. 3, pp. 427–440, 2023.
  83. [83] Y. Chen, R. Yao, Y. Yang, and J. Chen, “A Gromov-Wasserstein geometric view of spectrum-preserving graph coarsening”, in International Conference on Machine Learning, pp. 5257–5281, 2023.
  84. [84] Q. Sun, Z. Chen, B. Yang, C. Ji, X. Fu, S. Zhou, et al., “GC-Bench: An Open and Unified Benchmark for Graph Condensation”, Advances in Neural Information Processing Systems, 2024.
  85. [85] A. Abboud, R. Krauthgamer, and O. Trabelsi, “Friendly cut sparsifiers and faster Gomory-Hu trees”, in Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 3630–3649, 2022.
  86. [86] I. Alth\"ofer, G. Das, D. Dobkin, and D. Joseph, “Generating sparse spanners for weighted graphs”, in SWAT 90: 2nd Scandinavian Workshop on Algorithm Theory Bergen, pp. 26–37, 1990.
  87. [87] D. A Spielman and S. Teng, “Nearly linear time algorithms for preconditioning and solving symmetric, diagonally dominant linear systems”, SIAM Journal on Matrix Analysis and Applications, vol. 35, no. 3, pp. 835–885, 2014.
  88. [88] D. A Spielman and N. Srivastava, “Graph sparsification by effective resistances”, in Proceedings of the fortieth annual ACM symposium on Theory of computing, pp. 563–568, 2008.
  89. [89] J. D Batson, D. A Spielman, and N. Srivastava, “Twice-ramanujan sparsifiers”, in Proceedings of the forty-first annual ACM symposium on Theory of computing, pp. 255–262, 2009.
  90. [90] X. Xu, N. Yuruk, Z. Feng, and T. A. Schweiger, “Scan: a structural clustering algorithm for networks”, in Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 824–833, 2007.
  91. [91] V. Satuluri, S. Parthasarathy, and Y. Ruan, “Local graph sparsification for scalable clustering”, in Proceedings of the 2011 ACM SIGMOD International Conference on Management of data, pp. 721–732, 2011.
  92. [92] Y. Rong, W. Huang, T. Xu, and J. Huang, “Dropedge: Towards deep graph convolutional networks on node classification”, in International Conference on Learning Representations, 2019.
  93. [93] C. Zheng, B. Zong, W. Cheng, D. Song, J. Ni, W. Yu, et al., “Robust graph representation learning via neural sparsification”, in International Conference on Machine Learning, pp. 11458–11468, 2020.
  94. [94] R. Wickman, X. Zhang, and W. Li, “A Generic Graph Sparsification Framework using Deep Reinforcement Learning”, in IEEE International Conference on Data Mining (ICDM), pp. 1221–1226, 2022.
  95. [95] N. Razin, T. Verbin, and N. Cohen, “On the ability of graph neural networks to model interactions between vertices”, Advances in Neural Information Processing Systems, vol. 36, pp. 26501–26545, 2023.
  96. [96] Y. Jin, A. Loukas, and J. JaJa, “Graph coarsening with preserved spectral properties”, in International Conference on Artificial Intelligence and Statistics, pp. 4452–4462, 2020.
  97. [97] I. S Dhillon, Y. Guan, and B. Kulis, “Weighted graph cuts without eigenvectors a multilevel approach”, IEEE transactions on pattern analysis and machine intelligence, vol. 29, no. 11, pp. 1944–1957, 2007.
  98. [98] F. Dorfler and F. Bullo, “Kron reduction of graphs with applications to electrical networks”, IEEE Transactions on Circuits and Systems I: Regular Papers, vol. 60, no. 1, pp. 150–163, 2012.
  99. [99] M. Purohit, B A. Prakash, C. Kang, Y. Zhang, and V. Subrahmanian, “Fast influence-based coarsening for large networks”, in Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 1296–1305, 2014.
  100. [100] Z. Zhang, C. Yang, Z. Liu, M. Sun, Z. Fang, B. Zhang, et al., “Cosine: compressive network embedding on large-scale information networks”, IEEE Transactions on Knowledge and Data Engineering, vol. 34, no. 8, pp. 3655–3668, 2020.
  101. [101] C Deng, Z Zhao, Y Wang, Z Zhang, and Z Feng, “GraphZoom: A Multi-level Spectral Approach for Accurate and Scalable Graph Embedding”, in The International Conference on Learning Representations, 2020.
  102. [102] M. Fahrbach, G. Goranci, R. Peng, S. Sachdeva, and C. Wang, “Faster graph embeddings via coarsening”, in international conference on machine learning, pp. 2953–2963, 2020.
  103. [103] M. Kumar, A. Sharma, S. Saxena, and S. Kumar, “Featured graph coarsening with similarity guarantees”, in International Conference on Machine Learning, pp. 17953–17975, 2023.
  104. [104] C. Dickens, E. Huang, A. Reganti, J. Zhu, K. Subbian, and D. Koutra, “Graph coarsening via convolution matching for scalable graph neural network training”, in Companion Proceedings of the ACM on Web Conference 2024, pp. 1502–1510, 2024.
  105. [105] D. Bacciu, A. Conte, and F. Landolfi, “Generalizing downsampling from regular data to graphs”, in Proceedings of the AAAI Conference on Artificial Intelligence, vol. 37, no. 6, pp. 6718–6727, 2023.
  106. [106] Z. Huang, S. Zhang, C. Xi, T. Liu, and M. Zhou, “Scaling up graph neural networks via graph coarsening”, in Proceedings of the 27th ACM SIGKDD conference on knowledge discovery & data mining, pp. 675–684, 2021.
  107. [107] S. Si, F. Yu, A. S. Rawat, C. Hsieh, and S. Kumar, “Serving graph compression for graph neural networks”, in The Eleventh International Conference on Learning Representations, 2023.
  108. [108] L. Cao, H. Deng, Y. Yang, C. Wang, and L. Chen, “Graph-Skeleton:\ 1% Nodes are Sufficient to Represent Billion-Scale Graph”, in Proceedings of the ACM on Web Conference 2024, pp. 570–581, 2024.
  109. [109] X. Gao, J. Yu, T. Chen, G. Ye, W. Zhang, and H. Yin, “Graph condensation: A survey”, IEEE Transactions on Knowledge and Data Engineering, vol. 37, no. 4, pp. 1819-1837, 2025.
  110. [110] B. Zhao, K. R. Mopuri, and H. Bilen, “Dataset Condensation with Gradient Matching”, in Ninth International Conference on Learning Representations, 2021.
  111. [111] W. Jin, L. Zhao, S. Zhang, Y. Liu, J. Tang, and N. Shah, “Graph Condensation for Graph Neural Networks”, in International Conference on Learning Representations, 2022.
  112. [112] W. Jin, X. Tang, H. Jiang, Z. Li, D. Zhang, J. Tang, et al., “Condensing graphs via one-step gradient matching”, in Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 720–730, 2022.
  113. [113] B. Yang, K. Wang, Q. Sun, C. Ji, X. Fu, H. Tang, et al., “Does graph distillation see like vision dataset counterpart?”, Advances in Neural Information Processing Systems, vol. 36, 2024.
  114. [114] T. Zhang, Y. Zhang, K. Wang, K. Wang, B. Yang, K. Zhang, et al., “Two trades is not baffled: Condense graph via crafting rational gradient matching”, arXiv preprint arXiv:2402.04924, 2024.
  115. [115] J. Fang, X. Li, Y. Sui, Y. Gao, G. Zhang, K. Wang, et al., “Exgc: Bridging efficiency and explainability in graph condensation”, in Proceedings of the ACM on Web Conference 2024, pp. 721–732, 2024.
  116. [116] X. Zheng, M. Zhang, C. Chen, Q. V. H. Nguyen, X. Zhu, and S. Pan, “Structure-free graph condensation: From large-scale graphs to condensed graph-free data”, Advances in Neural Information Processing Systems, vol. 36, 2024.
  117. [117] Y. Zhang, T. Zhang, K. Wang, Z. Guo, Y. Liang, X. Bresson, et al., “Navigating Complexity: Toward Lossless Graph Condensation via Expanding Window Matching”, in Forty-first International Conference on Machine Learning, 2024.
  118. [118] X. Wang, Y. Chen, and W. Zhu, “A survey on curriculum learning”, IEEE transactions on pattern analysis and machine intelligence, vol. 44, no. 9, pp. 4555–4576, 2021.
  119. [119] B. Zhao and H. Bilen, “Dataset condensation with distribution matching”, in Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision, pp. 6514–6523, 2023.
  120. [120] Y. Liu, R. Qiu, and Z. Huang, “Cat: Balanced continual graph learning with graph condensation”, in 2023 IEEE International Conference on Data Mining (ICDM), pp. 1157–1162, 2023.
  121. [121] M. Liu, S. Li, X. Chen, and L. Song, “Graph condensation via receptive field distribution matching”, arXiv preprint arXiv:2206.13697, 2022.
  122. [122] Y. Liu, D. Bo, and C. Shi, “Graph Distillation with Eigenbasis Matching”, in Forty-first International Conference on Machine Learning, 2024.
  123. [123] Y. Liu, R. Qiu, Y. Tang, H. Yin, and Z. Huang, “PUMA: Efficient Continual Graph Learning for Node Classification With Graph Condensation”, IEEE Transactions on Knowledge and Data Engineering, vol. 37, no. 1, pp. 449-461, 2025.
  124. [124] T. Nguyen, Z. Chen, and J. Lee, “Dataset Meta-Learning from Kernel Ridge-Regression”, in International Conference on Learning Representations, 2020.
  125. [125] L. Wang, W. Fan, J. Li, Y. Ma, and Q. Li, “Fast graph condensation with structure-based neural tangent kernel”, in Proceedings of the ACM on Web Conference 2024, pp. 4439–4448, 2024.
  126. [126] Z. Xu, Y. Chen, M. Pan, H. Chen, M. Das, H. Yang, et al., “Kernel ridge regression-based graph dataset distillation”, in Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 2850–2861, 2023.
  127. [127] P. Goyal and E. Ferrara, “Graph embedding techniques, applications, and performance: A survey”, Knowledge-Based Systems, vol. 151, pp. 78–94, 2018.
  128. [128] M. F. Balin and \. Cataly\"urek, “Layer-Neighbor Sampling---Defusing Neighborhood Explosion in GNNs”, Advances in Neural Information Processing Systems, vol. 36, pp. 25819–25836, 2023.
  129. [129] S. Brin, “The PageRank citation ranking: bringing order to the web”, Proceedings of ASIS, 1998, vol. 98, pp. 161–172, 1998.
  130. [130] J. Chen, J. Zhu, and L. Song, “Stochastic Training of Graph Convolutional Networks with Variance Reduction”, in International Conference on Machine Learning, pp. 942–950, 2018.
  131. [131] W. Cong, R. Forsati, M. Kandemir, and M. Mahdavi, “Minimal variance sampling with provable guarantees for fast training of graph neural networks”, in Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 1393–1403, 2020.
  132. [132] J. Chen, T. Ma, and C. Xiao, “FastGCN: Fast learning with graph convolutional networks via importance sampling”, in International Conference on Learning Representations, 2018.
  133. [133] J. Gilmer, S. S Schoenholz, P. F Riley, O. Vinyals, and G. E Dahl, “Neural message passing for quantum chemistry”, in International conference on machine learning, pp. 1263–1272, 2017.
  134. [134] W. Huang, T. Zhang, Y. Rong, and J. Huang, “Adaptive sampling towards fast graph representation learning”, Advances in neural information processing systems, vol. 31, 2018.
  135. [135] D. Zou, Z. Hu, Y. Wang, S. Jiang, Y. Sun, and Q. Gu, “Layer-dependent importance sampling for training deep and large graph convolutional networks”, Advances in neural information processing systems, vol. 32, 2019.
  136. [136] E. Ohlsson, “Sequential poisson sampling”, Journal of official Statistics, vol. 14, no. 2, pp. 149, 1998.
  137. [137] W. Chiang, X. Liu, S. Si, Y. Li, S. Bengio, and C. Hsieh, “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.
  138. [138] H. Zeng, H. Zhou, A. Srivastava, R. Kannan, and V. Prasanna, “GraphSAINT: Graph Sampling Based Inductive Learning Method”, in International Conference on Learning Representations, 2020.
  139. [139] W. Zhou, H. Huang, R. Shi, K. Yin, and H. Jin, “An Efficient Subgraph-Inferring Framework for Large-Scale Heterogeneous Graphs”, in Proceedings of the AAAI Conference on Artificial Intelligence, vol. 38, no. 8, pp. 9431–9439, 2024.
  140. [140] M. Yang, H. Wang, Z. Wei, S. Wang, and J. Wen, “Efficient Algorithms for Personalized PageRank Computation: A Survey”, IEEE Transactions on Knowledge and Data Engineering, vol. 36, no. 9, pp. 4582-4602, 2024.
  141. [141] J. Gasteiger, A. Bojchevski, and S. G\"unnemann, “Predict then Propagate: Graph Neural Networks meet Personalized PageRank”, in International Conference on Learning Representations, 2018.
  142. [142] A. Bojchevski, J. Gasteiger, B. Perozzi, A. Kapoor, M. Blais, B. R\'ozemberczki, et al., “Scaling graph neural networks with approximate pagerank”, in Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 2464–2473, 2020.
  143. [143] N. Liao, D. Mo, S. Luo, X. Li, and P. Yin, “Scalable decoupling graph neural network with feature-oriented optimization”, The VLDB Journal, vol. 33, no. 3, pp. 667–683, 2024.
  144. [144] F. Wu, A. Souza, T. Zhang, and others, “Simplifying graph convolutional networks”, in ICML, 2019.
  145. [145] H. Zhu and P. Koniusz, “Simple spectral graph convolution”, in International conference on learning representations, 2021.
  146. [146] J. Gasteiger, S. Weienberger, and S. G\"unnemann, “Diffusion improves graph learning”, Advances in neural information processing systems, vol. 32, 2019.
  147. [147] M. Chen, Z. Wei, B. Ding, Y. Li, Y. Yuan, X. Du, et al., “Scalable graph neural networks via bidirectional propagation”, Advances in neural information processing systems, vol. 33, pp. 14556–14566, 2020.
  148. [148] H. Wang, M. He, Z. Wei, S. Wang, Y. Yuan, X. Du, et al., “Approximate graph propagation”, in Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining, pp. 1686–1696, 2021.
  149. [149] L. Ma, Z. Yang, Y. Miao, J. Xue, M. Wu, L. Zhou, et al., “$\$NeuGraph$\$: Parallel deep neural network computation on large graphs”, in 2019 USENIX Annual Technical Conference (USENIX ATC 19), pp. 443–458, 2019.
  150. [150] Z. Jia, S. Lin, M. Gao, M. Zaharia, and A. Aiken, “Improving the accuracy, scalability, and performance of graph neural networks with roc”, Proceedings of Machine Learning and Systems, vol. 2, pp. 187–198, 2020.
  151. [151] L. Wang, Q. Yin, C. Tian, J. Yang, R. Chen, W. Yu, et al., “FlexGraph: a flexible and efficient distributed framework for GNN training”, in Proceedings of the Sixteenth European Conference on Computer Systems, pp. 67–82, 2021.
  152. [152] M. F. Balin, K. Sancak, and U. V Catalyurek, “Mg-gcn: A scalable multi-gpu gcn training framework”, in Proceedings of the 51st International Conference on Parallel Processing, pp. 1–11, 2022.
  153. [153] J. Thorpe, Y. Qiao, J. Eyolfson, S. Teng, G. Hu, Z. Jia, et al., “Dorylus: Affordable, scalable, and accurate $\$GNN$\$ training with distributed $\$CPU$\$ servers and serverless threads”, in 15th USENIX Symposium on Operating Systems Design and Implementation (OSDI 21), pp. 495–514, 2021.
  154. [154] A. Tripathy, K. Yelick, and A. Buluc, “Reducing communication in graph neural network training”, in SC20: International Conference for High Performance Computing, Networking, Storage and Analysis, pp. 1–14, 2020.
  155. [155] C. Wan, Y. Li, C. R Wolfe, A. Kyrillidis, N. S. Kim, and Y. Lin, “PipeGCN: Efficient Full-Graph Training of Graph Convolutional Networks with Pipelined Feature Communication”, in International Conference on Learning Representations, 2022.
  156. [156] R. Zhu, K. Zhao, H. Yang, W. Lin, C. Zhou, B. Ai, et al., “AliGraph: A Comprehensive Graph Neural Network Platform”, Proceedings of the VLDB Endowment, vol. 12, no. 12, 2019.
  157. [157] D. Zhang, X. Huang, Z. Liu, J. Zhou, Z. Hu, X. Song, et al., “AGL: a scalable system for industrial-purpose graph machine learning”, Proceedings of the VLDB Endowment, vol. 13, no. 12, pp. 3125–3137, 2020.
  158. [158] X. Sun, Y. He, D. Wu, and J. Z. Huang, “Survey of distributed computing frameworks for supporting big data analysis”, Big Data Mining and Analytics, vol. 6, no. 2, pp. 154–169, 2023.
  159. [159] D. Zheng, C. Ma, M. Wang, J. Zhou, Q. Su, X. Song, et al., “DistDGL: Distributed graph neural network training for billion-scale graphs”, in 2020 IEEE/ACM 10th Workshop on Irregular Applications: Architectures and Algorithms (IA3), pp. 36–44, 2020.
  160. [160] M. Wang, D. Zheng, Z. Ye, Q. Gan, M. Li, X. Song, et al., “Deep graph library: A graph-centric, highly-performant package for graph neural networks”, arXiv preprint arXiv:1909.01315, 2019.
  161. [161] D. Zheng, X. Song, C. Yang, D. LaSalle, and G. Karypis, “Distributed hybrid cpu and gpu training for graph neural networks on billion-scale heterogeneous graphs”, in Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 4582–4591, 2022.
  162. [162] Z. Luo, Y. Bao, and C. Wu, “Optimizing task placement and online scheduling for distributed GNN training acceleration”, in IEEE INFOCOM 2022-IEEE Conference on Computer Communications, pp. 890–899, 2022.
  163. [163] T. N. Kipf and M. Welling, “Semi-Supervised Classification with Graph Convolutional Networks”, in Proceedings of the International Conference on Learning Representations, 2017.
  164. [164] C. D. Barros, M. R. Mendonca, A. B Vieira, and A. Ziviani, “A survey on embedding dynamic graphs”, ACM Computing Surveys (CSUR), vol. 55, no. 1, pp. 1–37, 2021.
  165. [165] A. Gravina and D. Bacciu, “Deep learning for dynamic graphs: models and benchmarks”, IEEE Transactions on Neural Networks and Learning Systems, vol. 35, no. 9, pp. 11788-11801, 2024.
  166. [166] Y. Zheng, L. Yi, and Z. Wei, “A survey of dynamic graph neural networks”, Frontiers of Computer Science, vol. 19, no. 6, pp. 1–18, 2025.
  167. [167] K. Sharma, Y. Lee, S. Nambi, A. Salian, S. Shah, S. Kim, et al., “A survey of graph neural networks for social recommender systems”, ACM Computing Surveys, vol. 56, no. 10, pp. 1–34, 2024.
  168. [168] S. Yu, F. Xia, Y. Wang, S. Li, F. G. Febrinanto, and M. Chetty, “PANDORA: deep graph learning based COVID-19 infection risk level forecasting”, IEEE Transactions on Computational Social Systems, vol. 11, no. 1, pp. 717–730, 2022.
  169. [169] J. Ren, M. Hou, Z. Liu, and X. Bai, “EAGLE: Contrastive Learning for Efficient Graph Anomaly Detection”, IEEE Intelligent Systems, vol. 38, no. 2, pp. 55-63, 2023.
  170. [170] A. Shehzad, D. Zhang, S. Yu, S. Abid, and F. Xia, “Dynamic Graph Transformer for Brain Disorder Diagnosis”, IEEE Journal of Biomedical and Health Informatics, vol. 29, no. 6, pp. 4388-4400, 2025.
  171. [171] H. Tang, S. Wu, X. Sun, J. Zeng, G. Xu, and Q. Li, “TCGC: Temporal Collaboration-Aware Graph Co-Evolution Learning for Dynamic Recommendation”, ACM Transactions on Information Systems, vol. 43, no. 1, 2024.
  172. [172] Y. Zhu, F. Cong, D. Zhang, W. Gong, Q. Lin, W. Feng, et al., “WinGNN: Dynamic Graph Neural Networks with Random Gradient Aggregation Window”, in Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 3650–3662, 2023.
  173. [173] Y. Luo and P. Li, “Neighborhood-aware scalable temporal network representation learning”, in Learning on Graphs Conference, 2022.
  174. [174] A. Pareja, G. Domeniconi, J. Chen, T. Ma, T. Suzumura, H. Kanezashi, et al., “Evolvegcn: Evolving graph convolutional networks for dynamic graphs”, in Proceedings of the AAAI conference on artificial intelligence, vol. 34, no. 04, pp. 5363–5370, 2020.
  175. [175] A. Sankar, Y. Wu, L. Gou, W. Zhang, and H. Yang, “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.
  176. [176] J. You, T. Du, and J. Leskovec, “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.
  177. [177] X. Qin, N. Sheikh, C. Lei, B. Reinwald, and G. Domeniconi, “Seign: A simple and efficient graph neural network for large dynamic graphs”, in 2023 IEEE 39th International Conference on Data Engineering (ICDE), pp. 2850–2863, 2023.
  178. [178] W. Yu, W. Cheng, C. C Aggarwal, K. Zhang, H. Chen, and W. Wang, “Netwalk: A flexible deep embedding approach for anomaly detection in dynamic networks”, in Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery & data mining, pp. 2672–2681, 2018.
  179. [179] L. Zhou, Y. Yang, X. Ren, F. Wu, and Y. Zhuang, “Dynamic network embedding by modeling triadic closure process”, in Proceedings of the AAAI conference on artificial intelligence, vol. 32, no. 1, 2018.
  180. [180] P. Goyal, S. R. Chhetri, and A. Canedo, “dyngraph2vec: Capturing network dynamics using dynamic graph representation learning”, Knowledge-Based Systems, vol. 187, pp. 104816, 2020.
  181. [181] S. Kumar, X. Zhang, and J. Leskovec, “Predicting dynamic embedding trajectory in temporal interaction networks”, in Proceedings of the 25th ACM SIGKDD international conference on knowledge discovery & data mining, pp. 1269–1278, 2019.
  182. [182] D. Xu, C. Ruan, E. Korpeoglu, S. Kumar, and K. Achan, “Inductive representation learning on temporal graphs”, in International Conference on Learning Representations, 2020.
  183. [183] E. Rossi, B. Chamberlain, F. Frasca, D. Eynard, F. Monti, and M. Bronstein, “Temporal graph networks for deep learning on dynamic graphs”, in International Conference on Machine Learning, 2020.
  184. [184] H. Sun, S. Geng, J. Zhong, H. Hu, and K. He, “Graph hawkes transformer for extrapolated reasoning on temporal knowledge graphs”, in Proceedings of the 2022 Conference on Empirical Methods in Natural Language Processing, pp. 7481–7493, 2022.
  185. [185] A. G Hawkes, “Point spectra of some mutually exciting point processes”, Journal of the Royal Statistical Society Series B: Statistical Methodology, vol. 33, no. 3, pp. 438–443, 1971.
  186. [186] Z. Wen and Y. Fang, “Trend: Temporal event and node dynamics for graph representation learning”, in Proceedings of the ACM Web Conference 2022, pp. 1159–1169, 2022.
  187. [187] Y. Li, Y. Shen, L. Chen, and M. Yuan, “Zebra: When temporal graph neural networks meet temporal personalized PageRank”, Proceedings of the VLDB Endowment, vol. 16, no. 6, pp. 1332–1345, 2023.
  188. [188] Y. Tian, A. Jiang, Q. Huang, J. Guo, and Y. Qi, “Latent Diffusion-based Data Augmentation for Continuous-Time Dynamic Graph Model”, in Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 2900–2911, 2024.
  189. [189] R. Trivedi, H. Dai, Y. Wang, and L. Song, “Know-evolve: Deep temporal reasoning for dynamic knowledge graphs”, in international conference on machine learning, pp. 3462–3471, 2017.
  190. [190] R. Trivedi, M. Farajtabar, P. Biswal, and H. Zha, “Dyrep: Learning representations over dynamic graphs”, in International conference on learning representations, 2019.
  191. [191] G. Jin, Y. Liang, Y. Fang, Z. Shao, J. Huang, J. Zhang, et al., “Spatio-temporal graph neural networks for predictive learning in urban computing: A survey”, IEEE Transactions on Knowledge and Data Engineering, vol. 36, no. 10, pp. 5388-5408, 2023.
  192. [192] M. Jin, H. Y. Koh, Q. Wen, D. Zambon, C. Alippi, G. I Webb, et al., “A survey on graph neural networks for time series: Forecasting, classification, imputation, and anomaly detection”, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 46, no. 12, pp. 10466-10485, 2024.
  193. [193] C. Shang, J. Chen, and J. Bi, “Discrete Graph Structure Learning for Forecasting Multiple Time Series”, in The International Conference on Learning Representations, 2020.
  194. [194] A. Deng and B. Hooi, “Graph neural network-based anomaly detection in multivariate time series”, in Proceedings of the AAAI conference on artificial intelligence, vol. 35, no. 5, pp. 4027–4035, 2021.
  195. [195] J. Bai, W. Yu, Z. Xiao, V. Havyarimana, A. C Regan, H. Jiang, et al., “Two-stream spatial--temporal graph convolutional networks for driver drowsiness detection”, IEEE Transactions on Cybernetics, vol. 52, no. 12, pp. 13821–13833, 2021.
  196. [196] X. Zeng, Y. Jiang, W. Ding, H. Li, Y. Hao, and Z. Qiu, “A hierarchical spatio-temporal graph convolutional neural network for anomaly detection in videos”, IEEE Transactions on Circuits and Systems for Video Technology, vol. 33, no. 1, pp. 200–212, 2021.
  197. [197] Z. Wu, S. Pan, G. Long, J. Jiang, and C. Zhang, “Graph wavenet for deep spatial-temporal graph modeling”, in Proceedings of the 28th International Joint Conference on Artificial Intelligence, pp. 1907–1913, 2019.
  198. [198] E. Jang, S. Gu, and B. Poole, “Categorical Reparametrization with Gumble-Softmax”, in The International Conference on Learning Representations, 2017.
  199. [199] T. Kipf, E. Fetaya, K. Wang, M. Welling, and R. Zemel, “Neural relational inference for interacting systems”, in International Conference on Machine Learning, 2018.
  200. [200] X. Zhang, C. Song, J. Zhao, Z. Xu, and X. Deng, “Spatial-temporal causality modeling for industrial processes with a knowledge-data guided reinforcement learning”, IEEE Transactions on Industrial Informatics, 2023.
  201. [201] B. Yu, H. Yin, and Z. Zhu, “Spatio-temporal graph convolutional networks: a deep learning framework for traffic forecasting”, in Proceedings of the 27th International Joint Conference on Artificial Intelligence, pp. 3634–3640, 2018.
  202. [202] D. Cao, Y. Wang, J. Duan, C. Zhang, X. Zhu, C. Huang, et al., “Spectral temporal graph neural network for multivariate time-series forecasting”, Advances in neural information processing systems, vol. 33, pp. 17766–17778, 2020.
  203. [203] Z. Wu, S. Pan, G. Long, J. Jiang, X. Chang, and C. Zhang, “Connecting the dots: Multivariate time series forecasting with graph neural networks”, in Proceedings of the 26th ACM SIGKDD international conference on knowledge discovery & data mining, pp. 753–763, 2020.
  204. [204] J. Choi, H. Choi, J. Hwang, and N. Park, “Graph neural controlled differential equations for traffic forecasting”, in Proceedings of the AAAI conference on artificial intelligence, vol. 36, no. 6, pp. 6367–6374, 2022.
  205. [205] A. M. Karimi, Y. Wu, M. Koyuturk, and R. H French, “Spatiotemporal graph neural network for performance prediction of photovoltaic power systems”, in Proceedings of the AAAI conference on artificial intelligence, vol. 35, no. 17, pp. 15323–15330, 2021.
  206. [206] Y. Zheng, H. Y. Koh, M. Jin, L. Chi, K. T Phan, S. Pan, et al., “Correlation-aware spatial--temporal graph learning for multivariate time-series anomaly detection”, IEEE Transactions on Neural Networks and Learning Systems, vol. 35, no. 9, pp. 11802-11816, 2023.
  207. [207] X. Geng, Y. Li, L. Wang, L. Zhang, Q. Yang, J. Ye, et al., “Spatiotemporal multi-graph convolution network for ride-hailing demand forecasting”, in Proceedings of the AAAI conference on artificial intelligence, vol. 33, no. 01, pp. 3656–3663, 2019.
  208. [208] J. Simeunovi\'c, B. Schubnel, P. Alet, and R. E Carrillo, “Spatio-temporal graph neural networks for multi-site PV power forecasting”, IEEE Transactions on Sustainable Energy, vol. 13, no. 2, pp. 1210–1220, 2021.
  209. [209] L. Deng, D. Lian, Z. Huang, and E. Chen, “Graph convolutional adversarial networks for spatiotemporal anomaly detection”, IEEE Transactions on Neural Networks and Learning Systems, vol. 33, no. 6, pp. 2416–2428, 2022.
  210. [210] H. Yu, T. Li, W. Yu, J. Li, Y. Huang, L. Wang, et al., “Regularized graph structure learning with semantic knowledge for multi-variates time-series forecasting”, in Proceedings of the 28th International Joint Conference on Artificial Intelligence, 2022.
  211. [211] Y. Li, R. Yu, C. Shahabi, and Y. Liu, “Diffusion Convolutional Recurrent Neural Network: Data-Driven Traffic Forecasting”, in International Conference on Learning Representations, 2018.
  212. [212] C. Chen, K. Li, S. G Teo, X. Zou, K. Wang, J. Wang, et al., “Gated residual recurrent graph neural networks for traffic prediction”, in Proceedings of the AAAI conference on artificial intelligence, vol. 33, no. 01, pp. 485–492, 2019.
  213. [213] L. Bai, L. Yao, C. Li, X. Wang, and C. Wang, “Adaptive graph convolutional recurrent network for traffic forecasting”, Advances in neural information processing systems, vol. 33, pp. 17804–17815, 2020.
  214. [214] A. Cini, I. Marisca, F. M. Bianchi, and C. Alippi, “Scalable spatiotemporal graph neural networks”, in Proceedings of the AAAI conference on artificial intelligence, vol. 37, no. 6, pp. 7218–7226, 2023.
  215. [215] J. Kan, K. Hu, M. Hagenbuchner, A. C. Tsoi, M. Bennamoun, and Z. Wang, “Sign language translation with hierarchical spatio-temporal graph neural network”, in Proceedings of the IEEE/CVF winter conference on applications of computer vision, pp. 3367–3376, 2022.
  216. [216] Z. He, P. Chen, X. Li, Y. Wang, G. Yu, C. Chen, et al., “A spatiotemporal deep learning approach for unsupervised anomaly detection in cloud systems”, IEEE Transactions on Neural Networks and Learning Systems, vol. 34, no. 4, pp. 1705–1719, 2020.
  217. [217] Y. Liu, Q. Liu, J. Zhang, H. Feng, Z. Wang, Z. Zhou, et al., “Multivariate time-series forecasting with temporal polynomial graph neural networks”, Advances in neural information processing systems, vol. 35, pp. 19414–19426, 2022.
  218. [218] Y. Li and J. M. Moura, “Forecaster: A graph transformer for forecasting spatial and time-dependent data”, in ECAI 2020, pp. 1293–1300, 2020.
  219. [219] H. Zhao, Y. Wang, J. Duan, C. Huang, D. Cao, Y. Tong, et al., “Multivariate time-series anomaly detection via graph attention network”, in 2020 IEEE international conference on data mining (ICDM), pp. 841–850, 2020.
  220. [220] C. Zheng, X. Fan, C. Wang, and J. Qi, “Gman: A graph multi-attention network for traffic prediction”, in Proceedings of the AAAI conference on artificial intelligence, vol. 34, no. 01, pp. 1234–1241, 2020.
  221. [221] I. Marisca, A. Cini, and C. Alippi, “Learning to reconstruct missing data from spatiotemporal graphs with sparse observations”, Advances in Neural Information Processing Systems, vol. 35, pp. 32069–32082, 2022.
  222. [222] Z. Shao, Z. Zhang, F. Wang, and Y. Xu, “Pre-training enhanced spatial-temporal graph neural network for multivariate time series forecasting”, in Proceedings of the 28th ACM SIGKDD conference on knowledge discovery and data mining, pp. 1567–1577, 2022.
  223. [223] X. Zhang, M. Zeman, T. Tsiligkaridis, and M. Zitnik, “Graph-Guided Network for Irregularly Sampled Multivariate Time Series”, in International Conference on Learning Representations, 2022.
  224. [224] P. Chu, J. Wang, Q. You, H. Ling, and Z. Liu, “Transmot: Spatial-temporal graph transformer for multiple object tracking”, in Proceedings of the IEEE/CVF Winter Conference on applications of computer vision, pp. 4870–4880, 2023.
  225. [225] Y. Ektefaie, G. Dasoulas, A. Noori, and others, “Multimodal learning with graphs”, Nature Machine Intelligence, vol. 5, no. 4, pp. 340–350, 2023.
  226. [226] C. Xie, W. Zhou, C. Peng, A. N. Hoshyar, C. Xu, U. Naseem, et al., “Multimodal Hyperbolic Graph Learning for Alzheimer’s Disease Detection”, in Australasian Joint Conference on Artificial Intelligence, pp. 390–403, 2024.
  227. [227] Y. He, Y. Sui, X. He, Y. Liu, Y. Sun, and B. Hooi, “Unigraph2: Learning a unified embedding space to bind multimodal graphs”, in Proceedings of the ACM on Web Conference 2025, pp. 1759–1770, 2025.
  228. [228] S. Kim, N. Lee, J. Lee, D. Hyun, and C. Park, “Heterogeneous graph learning for multi-modal medical data analysis”, in Proceedings of the AAAI Conference on Artificial Intelligence, 2023.
  229. [229] F. Zhao, C. Zhang, and B. Geng, “Deep Multimodal Data Fusion”, ACM Computing Surveys, vol. 56, no. 9, pp. 1–36, 2024.
  230. [230] W. Ai, Y. Shou, T. Meng, and K. Li, “DER-GCN: Dialog and Event Relation-Aware Graph Convolutional Neural Network for Multimodal Dialog Emotion Recognition”, IEEE Transactions on Neural Networks and Learning Systems, vol. 36, no. 3, pp. 4908-4921, 2024.
  231. [231] C. Peng, T. Guo, C. Xie, X. Bai, J. Zhou, X. Zhao, et al., “mBGT: Encoding Brain Signals With Multimodal Brain Graph Transformer”, IEEE Transactions on Consumer Electronics, 2024.
  232. [232] Z. Tao, Y. Wei, X. Wang, and others, “Mgat: Multimodal graph attention network for recommendation”, Information Processing & Management, vol. 57, no. 5, pp. 102277, 2020.
  233. [233] Z. Guo, J. Li, G. Li, C. Wang, S. Shi, and B. Ruan, “LGMRec: Local and Global Graph Learning for Multimodal Recommendation”, in Proceedings of the AAAI Conference on Artificial Intelligence, vol. 38, no. 8, pp. 8454–8462, 2024.
  234. [234] X. Chen, N. Zhang, L. Li, S. Deng, C. Tan, C. Xu, et al., “Hybrid transformer with multi-level fusion for multimodal knowledge graph completion”, in Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 904–915, 2022.
  235. [235] J. Cai, X. Wang, H. Li, Z. Zhang, and W. Zhu, “Multimodal Graph Neural Architecture Search under Distribution Shifts”, in Proceedings of the AAAI Conference on Artificial Intelligence, vol. 38, no. 8, pp. 8227–8235, 2024.
  236. [236] K. Liu, F. Xue, D. Guo, and others, “Multimodal Graph Contrastive Learning for Multimedia-Based Recommendation”, IEEE Transactions on Multimedia, vol. 25, pp. 9343-9355, 2023.
  237. [237] Z. Lin, B. Liang, Y. Long, Y. Dang, M. Yang, M. Zhang, et al., “Modeling intra-and inter-modal relations: Hierarchical graph contrastive learning for multimodal sentiment analysis”, in Proceedings of the 29th International Conference on Computational Linguistics, vol. 29, no. 1, pp. 7124–7135, 2022.
  238. [238] R. Saqur and K. Narasimhan, “Multimodal graph networks for compositional generalization in visual question answering”, Advances in Neural Information Processing Systems, vol. 33, pp. 3070–3081, 2020.
  239. [239] M. Wang, W. Shao, S. Huang, and D. Zhang, “Hypergraph-regularized multimodal learning by graph diffusion for imaging genetics based Alzheimer’s Disease diagnosis”, Medical Image Analysis, vol. 89, pp. 102883, 2023.
  240. [240] R. Liu, H. Liu, H. Huang, B. Song, and Q. Wu, “Multimodal multiscale dynamic graph convolution networks for stock price prediction”, Pattern Recognition, vol. 149, pp. 110211, 2024.
  241. [241] E. Kim, W. Y. Kang, K. On, Y. Heo, and B. Zhang, “Hypergraph attention networks for multimodal learning”, in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pp. 14581–14590, 2020.
  242. [242] H. Cai, Y. Gao, and M. Liu, “Graph transformer geometric learning of brain networks using multimodal MR images for brain age estimation”, IEEE Transactions on Medical Imaging, vol. 42, no. 2, pp. 456–466, 2022.
  243. [243] X. He and X. Wang, “Multimodal Graph Transformer for Multimodal Question Answering”, in Proceedings of the 17th Conference of the European Chapter of the Association for Computational Linguistics, pp. 189–200, 2023.
  244. [244] T. Liu, Y. Wang, R. Ying, and H. Zhao, “MuSe-GNN: learning unified gene representation from multimodal biological graph data”, Advances in neural information processing systems, vol. 36, 2024.
  245. [245] Z. Lian, L. Chen, L. Sun, and others, “GCNet: graph completion network for incomplete multimodal learning in conversation”, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 45, no. 7, pp. 8419–8432, 2023.
  246. [246] X. Song, F. Zhou, A. F. Frangi, and others, “Multicenter and Multichannel Pooling GCN for Early AD Diagnosis Based on Dual-Modality Fused Brain Network”, IEEE Transactions on Medical Imaging, vol. 42, no. 2, pp. 354-367, 2023.
  247. [247] T. Meng, F. Zhang, Y. Shou, H. Shao, W. Ai, and K. Li, “Masked graph learning with recurrent alignment for multimodal emotion recognition in conversation”, IEEE/ACM Transactions on Audio, Speech, and Language Processing, vol. 32, pp. 4298-4312, 2024.
  248. [248] N. Zhang, L. Li, X. Chen, and others, “Multimodal Analogical Reasoning over Knowledge Graphs”, in The Eleventh International Conference on Learning Representations, 2023.
  249. [249] L. Chen, Z. Li, T. Xu, and others, “Multi-modal siamese network for entity alignment”, in Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 118–126, 2022.
  250. [250] D. Li, Y. Wang, K. Funakoshi, and M. Okumura, “Joyful: Joint Modality Fusion and Graph Contrastive Learning for Multimodal Emotion Recognition”, in EMNLP, 2023.
  251. [251] Y. Tian, C. Zhang, Z. Guo, and others, “Recipe2Vec: Multi-modal Recipe Representation Learning with Graph Neural Networks”, in Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022.
  252. [252] X. Zhou and C. Miao, “Disentangled Graph Variational Auto-Encoder for Multimodal Recommendation With Interpretability”, IEEE Transactions on Multimedia, vol. 26, pp. 7543-7554, 2024.
  253. [253] M. Li, X. Zhuang, L. Bai, and W. Ding, “Multimodal graph learning based on 3D Haar semi-tight framelet for student engagement prediction”, Information Fusion, vol. 105, pp. 102224, 2024.
  254. [254] Y. Song, P. Sun, H. Liu, Z. Li, W. Song, Y. Xiao, et al., “Scene-Driven Multimodal Knowledge Graph Construction for Embodied AI”, IEEE Transactions on Knowledge and Data Engineering, vol. 36, no. 11, pp. 6962–6976, 2024.
  255. [255] J. Wang, J. Hu, S. Qian, and others, “Multimodal graph convolutional networks for high quality content recognition”, Neurocomputing, vol. 412, pp. 42–51, 2020.
  256. [256] T. Lyu, J. Gao, L. Tian, and others, “MDNN: A Multimodal Deep Neural Network for Predicting Drug-Drug Interaction Events.”, in IJCAI, 2021.
  257. [257] Y. Zeng, Q. Jin, T. Bao, and W. Li, “Multi-modal knowledge hypergraph for diverse image retrieval”, in Proceedings of the AAAI Conference on Artificial Intelligence, 2023.
  258. [258] H. Wen, J. Ding, W. Jin, Y. Wang, Y. Xie, and J. Tang, “Graph neural networks for multimodal single-cell data integration”, in Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 4153–4163, 2022.
  259. [259] K. Hu, Z. Wang, K. A E. Martens, M. Hagenbuchner, M. Bennamoun, A. C. Tsoi, et al., “Graph fusion network-based multimodal learning for freezing of gait detection”, IEEE Transactions on Neural Networks and Learning Systems, vol. 34, no. 3, pp. 1588–1600, 2023.
  260. [260] S. Kim, S. Yun, J. Lee, G. Chang, W. Roh, D. Sohn, et al., “Self-supervised Multimodal Graph Convolutional Network for collaborative filtering”, Information Sciences, vol. 653, pp. 119760, 2024.
  261. [261] G. Tu, T. Xie, B. Liang, H. Wang, and R. Xu, “Adaptive Graph Learning for Multimodal Conversational Emotion Detection”, in Proceedings of the AAAI Conference on Artificial Intelligence, vol. 38, no. 17, pp. 19089–19097, 2024.
  262. [262] X. Guo and L. Zhao, “A systematic survey on deep generative models for graph generation”, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 45, no. 5, pp. 5370–5390, 2022.
  263. [263] C. Liu, W. Fan, Y. Liu, J. Li, H. Li, H. Liu, et al., “Generative diffusion models on graphs: methods and applications”, in Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, pp. 6702–6711, 2023.
  264. [264] H. Cao, C. Tan, Z. Gao, Y. Xu, G. Chen, P. Heng, et al., “A survey on generative diffusion models”, IEEE Transactions on Knowledge and Data Engineering, vol. 36, no. 7, pp. 2814-2830, 2024.
  265. [265] S. P\"olsterl and C. Wachinger, “Adversarial learned molecular graph inference and generation”, in Machine Learning and Knowledge Discovery in Databases: European Conference, ECML PKDD, pp. 173–189, 2021.
  266. [266] K. Zahirnia, Y. Hu, M. Coates, and O. Schulte, “Neural graph generation from graph statistics”, Advances in Neural Information Processing Systems, vol. 36, 2024.
  267. [267] D. Flam-Shepherd, T. C Wu, and A. Aspuru-Guzik, “MPGVAE: improved generation of small organic molecules using message passing neural nets”, Machine Learning: Science and Technology, vol. 2, no. 4, pp. 045010, 2021.
  268. [268] C. Niu, Y. Song, J. Song, S. Zhao, A. Grover, and S. Ermon, “Permutation invariant graph generation via score-based generative modeling”, in International Conference on Artificial Intelligence and Statistics, pp. 4474–4484, 2020.
  269. [269] K. Madhawa, K. Ishiguro, K. Nakago, and M. Abe, “Graphnvp: An invertible flow model for generating molecular graphs”, arXiv preprint arXiv:1905.11600, 2019.
  270. [270] C. Zang and F. Wang, “Moflow: an invertible flow model for generating molecular graphs”, in Proceedings of the 26th ACM SIGKDD international conference on knowledge discovery & data mining, pp. 617–626, 2020.
  271. [271] M. Kuznetsov and D. Polykovskiy, “MolGrow: A graph normalizing flow for hierarchical molecular generation”, in Proceedings of the AAAI Conference on Artificial Intelligence, vol. 35, no. 9, pp. 8226–8234, 2021.
  272. [272] Q. Zhang, J. Yao, Y. Yang, Y. Shi, W. Gao, and X. Wang, “Effective Entry-Wise Flow for Molecule Generation”, in 2024 IEEE 40th International Conference on Data Engineering (ICDE), pp. 207–220, 2024.
  273. [273] X. Chen, J. He, X. Han, and L. Liu, “Efficient and Degree-Guided Graph Generation via Discrete Diffusion Modeling”, in International Conference on Machine Learning, pp. 4585–4610, 2023.
  274. [274] C. Shi, S. Luo, M. Xu, and J. Tang, “Learning gradient fields for molecular conformation generation”, in International conference on machine learning, pp. 9558–9568, 2021.
  275. [275] L. Yang, Z. Huang, Z. Zhang, Z. Liu, S. Hong, W. Zhang, et al., “Graphusion: Latent Diffusion for Graph Generation”, IEEE Transactions on Knowledge and Data Engineering, vol. 36, no. 11, pp. 6358-6369, 2024.
  276. [276] A. Bojchevski, O. Shchur, D. Z\"ugner, and S. G\"unnemann, “Netgan: Generating graphs via random walks”, in International conference on machine learning, pp. 610–619, 2018.
  277. [277] S. Gupta, S. Manchanda, S. Bedathur, and S. Ranu, “Tigger: Scalable generative modelling for temporal interaction graphs”, in Proceedings of the AAAI Conference on Artificial Intelligence, vol. 36, no. 6, pp. 6819–6828, 2022.
  278. [278] J. Lee and J. Jung, “Time-aware random walk diffusion to improve dynamic graph learning”, in Proceedings of the AAAI Conference on Artificial Intelligence, vol. 37, no. 7, pp. 8473–8481, 2023.
  279. [279] G. Salha, R. Hennequin, V. A. Tran, and M. Vazirgiannis, “A Degeneracy Framework for Scalable Graph Autoencoders”, in Twenty-Eighth International Joint Conference on Artificial Intelligence, pp. 3353–3359, 2019.
  280. [280] A. Grover, A. Zweig, and S. Ermon, “Graphite: Iterative generative modeling of graphs”, in International conference on machine learning, pp. 2434–2444, 2019.
  281. [281] G. Salha, S. Limnios, R. Hennequin, V. Tran, and M. Vazirgiannis, “Gravity-inspired graph autoencoders for directed link prediction”, in Proceedings of the 28th ACM international conference on information and knowledge management, pp. 589–598, 2019.
  282. [282] Y. Jang, S. Lee, and S. Ahn, “A Simple and Scalable Representation for Graph Generation”, in The Twelfth International Conference on Learning Representations, 2023.
  283. [283] T. Luo, Z. Mo, and S. J. Pan, “Fast graph generation via spectral diffusion”, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 46, no. 5, pp. 3496-3508, 2023.
  284. [284] X. Chen, X. Han, J. Hu, F. Ruiz, and L. Liu, “Order Matters: Probabilistic Modeling of Node Sequence for Graph Generation”, in International Conference on Machine Learning, pp. 1630–1639, 2021.
  285. [285] L. Kong, J. Cui, H. Sun, Y. Zhuang, B A. Prakash, and C. Zhang, “Autoregressive diffusion model for graph generation”, in International conference on machine learning, pp. 17391–17408, 2023.
  286. [286] Q. Liu, M. Allamanis, M. Brockschmidt, and A. Gaunt, “Constrained graph variational autoencoders for molecule design”, Advances in neural information processing systems, vol. 31, 2018.
  287. [287] N. Goyal, H. V. Jain, and S. Ranu, “Graphgen: A scalable approach to domain-agnostic labeled graph generation”, in Proceedings of The Web Conference 2020, pp. 1253–1263, 2020.
  288. [288] D Bacciu, A Micheli, M Podda, and others, “Graph generation by sequential edge prediction”, in 27th European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning, pp. 95–100, 2019.
  289. [289] D. Bacciu, A. Micheli, and M. Podda, “Edge-based sequential graph generation with recurrent neural networks”, Neurocomputing, vol. 416, pp. 177–189, 2020.
  290. [290] R. Liao, Y. Li, Y. Song, S. Wang, W. Hamilton, D. K Duvenaud, et al., “Efficient graph generation with graph recurrent attention networks”, Advances in neural information processing systems, vol. 32, 2019.
  291. [291] Y. Jang, D. Kim, and S. Ahn, “Hierarchical Graph Generation with K\^2-trees”, in ICML 2023 Workshop on Structured Probabilistic Inference & Generative Modeling, 2023.
  292. [292] W. Jin, R. Barzilay, and T. Jaakkola, “Hierarchical generation of molecular graphs using structural motifs”, in International conference on machine learning, pp. 4839–4848, 2020.
  293. [293] P. Liu and A. E. Sariy\"uce, “Using motif transitions for temporal graph generation”, in Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 1501–1511, 2023.
  294. [294] W. Jin, R. Barzilay, and T. Jaakkola, “Junction tree variational autoencoder for molecular graph generation”, in International conference on machine learning, pp. 2323–2332, 2018.
  295. [295] H. Dai, Y. Tian, B. Dai, S. Skiena, and L. Song, “Syntax-Directed Variational Autoencoder for Structured Data”, in International Conference on Learning Representations, 2018.
  296. [296] B. Wang, Z. Wang, X. Wang, Y. Cao, R. A Saurous, and Y. Kim, “Grammar prompting for domain-specific language generation with large language models”, Advances in Neural Information Processing Systems, vol. 36, 2024.
  297. [297] X. Guo, L. Wu, and L. Zhao, “Deep graph translation”, IEEE Transactions on Neural Networks and Learning Systems, vol. 34, no. 11, pp. 8225–8234, 2022.
  298. [298] W. Zhong, Z. Yang, and C. Y. Chen, “Retrosynthesis prediction using an end-to-end graph generative architecture for molecular graph editing”, Nature Communications, vol. 14, no. 1, pp. 3009, 2023.
  299. [299] X. Guo, L. Zhao, Z. Qin, L. Wu, A. Shehu, and Y. Ye, “Interpretable deep graph generation with node-edge co-disentanglement”, in Proceedings of the 26th ACM SIGKDD international conference on knowledge discovery & data mining, pp. 1697–1707, 2020.
  300. [300] C. Shi, M. Xu, H. Guo, M. Zhang, and J. Tang, “A graph to graphs framework for retrosynthesis prediction”, in International conference on machine learning, pp. 8818–8827, 2020.
  301. [301] J. Wu, F. Yin, Y. Zhang, X. Zhang, and C. Liu, “Graph-to-graph: towards accurate and interpretable online handwritten mathematical expression recognition”, in Proceedings of the AAAI Conference on Artificial Intelligence, vol. 35, no. 4, pp. 2925–2933, 2021.
  302. [302] D. Hou, C. Gao, X. Li, and Z. Wang, “DAG-Aware Variational Autoencoder for Social Propagation Graph Generation”, in Proceedings of the AAAI Conference on Artificial Intelligence, vol. 38, no. 8, pp. 8508–8516, 2024.
  303. [303] C. Zhao, Y. Shen, Z. Chen, M. Ding, and C. Gan, “Textpsg: Panoptic scene graph generation from textual descriptions”, in Proceedings of the IEEE/CVF International Conference on Computer Vision, pp. 2839–2850, 2023.
  304. [304] S. Sun, S. Zhi, Q. Liao, J. Heikkil\"a, and L. Liu, “Unbiased scene graph generation via two-stage causal modeling”, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 45, no. 10, pp. 12562–12580, 2023.
  305. [305] C. Zheng, X. Lyu, L. Gao, B. Dai, and J. Song, “Prototype-based embedding network for scene graph generation”, in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pp. 22783–22792, 2023.
  306. [306] Y. Lu, H. Rai, J. Chang, B. Knyazev, G. Yu, S. Shekhar, et al., “Context-aware scene graph generation with seq2seq transformers”, in Proceedings of the IEEE/CVF international conference on computer vision, pp. 15931–15941, 2021.
  307. [307] S. Kundu and S. N Aakur, “Is-ggt: Iterative scene graph generation with generative transformers”, in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pp. 6292–6301, 2023.
  308. [308] C. Yang, P. Zhuang, W. Shi, A. Luu, and P. Li, “Conditional structure generation through graph variational generative adversarial nets”, Advances in neural information processing systems, vol. 32, 2019.
  309. [309] Z. Mo, T. Luo, and S. J. Pan, “Graph principal flow network for conditional graph generation”, in Proceedings of the ACM on Web Conference 2024, pp. 768–779, 2024.
  310. [310] E. Bengio, M. Jain, M. Korablyov, D. Precup, and Y. Bengio, “Flow network based generative models for non-iterative diverse candidate generation”, Advances in Neural Information Processing Systems, vol. 34, pp. 27381–27394, 2021.
  311. [311] Z. Zhang, M. Hu, Y. Bai, and Z. Zhang, “Coreference Graph Guidance for Mind-Map Generation”, in Proceedings of the AAAI Conference on Artificial Intelligence, vol. 38, no. 17, pp. 19623–19631, 2024.
  312. [312] Y. Cong, M. Y. Yang, and B. Rosenhahn, “Reltr: Relation transformer for scene graph generation”, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 45, no. 9, pp. 11169–11183, 2023.
  313. [313] X. Bai, Y. Chen, and Y. Zhang, “Graph Pre-training for AMR Parsing and Generation”, in Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), pp. 6001–6015, 2022.
  314. [314] M. Hu, H. Guo, S. Zhao, H. Gao, and Z. Su, “Efficient Mind-Map Generation via Sequence-to-Graph and Reinforced Graph Refinement”, in Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing, pp. 8130–8141, 2021.
  315. [315] S. Nag, K. Min, S. Tripathi, and A. K Roy-Chowdhury, “Unbiased scene graph generation in videos”, in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pp. 22803–22813, 2023.
  316. [316] X. Lin, C. Shi, Y. Zhan, Z. Yang, Y. Wu, and D. Tao, “TD$^2$-Net: Toward Denoising and Debiasing for Video Scene Graph Generation”, in Proceedings of the AAAI Conference on Artificial Intelligence, vol. 38, no. 4, pp. 3495–3503, 2024.
  317. [317] J. Yang, W. Peng, X. Li, Z. Guo, L. Chen, B. Li, et al., “Panoptic video scene graph generation”, in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pp. 18675–18685, 2023.
  318. [318] T. Nguyen, P. Nguyen, and K. Luu, “Hig: Hierarchical interlacement graph approach to scene graph generation in video understanding”, in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pp. 18384–18394, 2024.
  319. [319] Y. Xiang, D. Luo, and H. Xu, “Privacy-preserved evolutionary graph modeling via Gromov-Wasserstein autoregression”, in Proceedings of the AAAI Conference on Artificial Intelligence, vol. 37, no. 12, pp. 14566–14574, 2023.
  320. [320] S. Zheng, C. Wang, C. Wu, Y. Lou, H. Feng, and X. Yang, “Temporal Graph Generation Featuring Time-Bound Communities”, in 2024 IEEE 40th International Conference on Data Engineering (ICDE), pp. 2365–2378, 2024.
  321. [321] W. Lin, H. Lan, and B. Li, “Generative causal explanations for graph neural networks”, in Proceedings of the International Conference on Machine Learning, pp. 6666–6679, 2021.
  322. [322] H. Yuan, J. Tang, X. Hu, and S. Ji, “Xgnn: Towards model-level explanations of graph neural networks”, in Proceedings of the ACM SIGKDD international conference on knowledge discovery & data mining, pp. 430–438, 2020.
  323. [323] C. Shan, Y. Shen, Y. Zhang, X. Li, and D. Li, “Reinforcement Learning Enhanced Explainer for Graph Neural Networks”, in Proceedings of the Neural Information Processing Systems, pp. 22523–22533, 2021.
  324. [324] X. Wang and H. W. Shen, “GNNInterpreter: A Probabilistic Generative Model-Level Explanation for Graph Neural Networks”, in Proceedings of the International Conference on Learning Representations, pp. 1–25, 2023.
  325. [325] W. Li, Y. Li, Z. Li, J. HAO, and Y. Pang, “DAG Matters! GFlowNets Enhanced Explainer for Graph Neural Networks”, in Proceedings of the International Conference on Learning Representations, pp. 1–25, 2023.
  326. [326] Z. Ying, D. Bourgeois, J. You, M. Zitnik, and J. Leskovec, “Gnnexplainer: Generating explanations for graph neural networks”, in Proceedings of the Neural Information Processing Systems, pp. 1–12, 2019.
  327. [327] D. Luo, W. Cheng, D. Xu, W. Yu, B. Zong, H. Chen, et al., “Parameterized explainer for graph neural network”, Proceedings of the Neural Information Processing Systems, vol. 33, pp. 19620–19631, 2020.
  328. [328] X. Wang, Y. Wu, A. Zhang, X. He, and T. Chua, “Towards multi-grained explainability for graph neural networks”, in Proceedings of the Neural Information Processing Systems, pp. 18446–18458, 2021.
  329. [329] T. Funke, M. Khosla, M. Rathee, and A. Anand, “Zorro: Valid, sparse, and stable explanations in graph neural networks”, IEEE Transactions on Knowledge and Data Engineering, vol. 35, no. 8, pp. 8687–8698, 2022.
  330. [330] H. Yuan, H. Yu, J. Wang, K. Li, and S. Ji, “On explainability of graph neural networks via subgraph explorations”, in Proceedings of the International conference on machine learning, pp. 12241–12252, 2021.
  331. [331] S. Zhang, Y. Liu, N. Shah, and Y. Sun, “Gstarx: Explaining graph neural networks with structure-aware cooperative games”, in Proceedings of the Neural Information Processing Systems, pp. 19810–19823, 2022.
  332. [332] P. E Pope, S. Kolouri, M. Rostami, C. E Martin, and H. Hoffmann, “Explainability methods for graph convolutional neural networks”, in Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, pp. 10772–10781, 2019.
  333. [333] Q. Feng, N. Liu, F. Yang, R. Tang, M. Du, and X. Hu, “DEGREE: Decomposition Based Explanation for Graph Neural Networks”, in Proceedings of the International Conference on Learning Representations, pp. 1–19, 2022.
  334. [334] P. Xiong, T. Schnake, M. Gastegger, G. Montavon, K. R. Muller, and S. Nakajima, “Relevant walk search for explaining graph neural networks”, in Proceedings of the International Conference on Machine Learning, pp. 38301–38324, 2023.
  335. [335] J. Tan, S. Geng, Z. Fu, Y. Ge, S. Xu, Y. Li, et al., “Learning and evaluating graph neural network explanations based on counterfactual and factual reasoning”, in Proceedings of the ACM web conference, pp. 1018–1027, 2022.
  336. [336] H. Kang, G. Han, and H. Park, “UNR-Explainer: Counterfactual Explanations for Unsupervised Node Representation Learning Models”, in Proceedings of the International Conference on Learning Representations, pp. 1–20, 2024.
  337. [337] D. Qiu, M. Wang, A. Khan, and Y. Wu, “Generating Robust Counterfactual Witnesses for Graph Neural Networks”, arXiv preprint arXiv:2404.19519, 2024.
  338. [338] Q. Yang, C. Ma, Q. Zhang, X. Gao, C. Zhang, and X. Zhang, “Counterfactual Learning on Heterogeneous Graphs with Greedy Perturbation”, in Proceedings of the ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 2988–2998, 2023.
  339. [339] G. P Wellawatte, A. Seshadri, and A. D White, “Model agnostic generation of counterfactual explanations for molecules”, Chemical science, vol. 13, no. 13, pp. 3697–3705, 2022.
  340. [340] C. Chhablani, S. Jain, A. Channesh, I. A Kash, and S. Medya, “Game-theoretic Counterfactual Explanation for Graph Neural Networks”, in Proceedings of the ACM on Web Conference, pp. 503–514, 2024.
  341. [341] Z. Huang, M. Kosan, S. Medya, S. Ranu, and A. Singh, “Global counterfactual explainer for graph neural networks”, in Proceedings of the ACM International Conference on Web Search and Data Mining, pp. 141–149, 2023.
  342. [342] M. Bajaj, L. Chu, Z. Y. Xue, J. Pei, L. Wang, P. C. Lam, et al., “Robust counterfactual explanations on graph neural networks”, Proceedings of the Neural Information Processing Systems, pp. 5644–5655, 2021.
  343. [343] J. Ma, R. Guo, S. Mishra, A. Zhang, and J. Li, “Clear: Generative counterfactual explanations on graphs”, in Proceedings of the neural information processing systems, pp. 25895–25907, 2022.
  344. [344] S. Miao, M. Liu, and P. Li, “Interpretable and Generalizable Graph Learning via Stochastic Attention Mechanism”, in International Conference on Machine Learning, ICML, vol. 162, pp. 15524–15543, 2022.
  345. [345] S. Miao, Y. Luo, M. Liu, and P. Li, “Interpretable Geometric Deep Learning via Learnable Randomness Injection”, in The Eleventh International Conference on Learning Representations, 2023.
  346. [346] J. Yu, T. Xu, Y. Rong, Y. Bian, J. Huang, and R. He, “Graph Information Bottleneck for Subgraph Recognition”, in 9th International Conference on Learning Representations, 2021.
  347. [347] J. Yu, J. Cao, and R. He, “Improving Subgraph Recognition with Variational Graph Information Bottleneck”, in IEEE/CVF Conference on Computer Vision and Pattern Recognition, pp. 19374–19383, 2022.
  348. [348] Y. Nian, Y. Chang, W. Jin, and L. Lin, “Globally Interpretable Graph Learning via Distribution Matching”, in Proceedings of the ACM Web Conference, pp. 992–-1002, 2024.
  349. [349] S. Seo, S. Kim, and C. Park, “Interpretable Prototype-based Graph Information Bottleneck”, in Proceedings of the neural information processing systems, vol. 36, pp. 76737–76748, 2023.
  350. [350] Y. Wu, X. Wang, A. Zhang, X. He, and T. Chua, “Discovering Invariant Rationales for Graph Neural Networks”, in The Tenth International Conference on Learning Representations, 2022.
  351. [351] Z. Zhang, Q. Liu, H. Wang, C. Lu, and C. Lee, “ProtGNN: Towards Self-Explaining Graph Neural Networks”, in Thirty-Sixth AAAI Conference on Artificial Intelligence, pp. 9127–9135, 2022.
  352. [352] R. Schmidt, S. Montani, R. Bellazzi, L. Portinale, and L. Gierl, “Cased-Based Reasoning for medical knowledge-based systems”, Int. J. Medical Informatics, vol. 64, no. 2-3, pp. 355–367, 2001.
  353. [353] E. Dai and S. Wang, “Towards Self-Explainable Graph Neural Network”, in CIKM '21: The 30th ACM International Conference on Information and Knowledge Management, Virtual Event, Queensland, Australia, November 1 - 5, 2021, pp. 302–311, 2021.
  354. [354] A. Feng, C. You, S. Wang, and L. Tassiulas, “KerGNNs: Interpretable Graph Neural Networks with Graph Kernels”, in Thirty-Sixth AAAI Conference on Artificial Intelligence, pp. 6614–6622, 2022.
  355. [355] H. Zhang, B. Wu, X. Yuan, S. Pan, H. Tong, and J. Pei, “Trustworthy Graph Neural Networks: Aspects, Methods, and Trends”, Proceedings of the IEEE, vol. 112, no. 2, pp. 97–139, 2024.
  356. [356] W. Fu, H. Wang, C. Gao, G. Liu, Y. Li, and T. Jiang, “Privacy-Preserving Individual-Level COVID-19 Infection Prediction via Federated Graph Learning”, ACM Transactions on Information Systems, vol. 42, no. 3, pp. 1–29, 2024.
  357. [357] T. Tang, G. Han, R. Luo, F. Ding, S. Yu, and I. Lee, “RMTrans: Robust Multimodal Transformer for Patient Prognosis under Backdoor Treats”, in ACM Transactions on Intelligent Systems and Technology, 2025.
  358. [358] Y. Dong, J. Ma, S. Wang, C. Chen, and J. Li, “Fairness in Graph Mining: A survey”, IEEE Transactions on Knowledge and Data Engineering, vol. 35, no. 10, pp. 10583–10602, 2023.
  359. [359] R. Luo, H. Huang, L. Ivan, C. Xu, J. Qi, and F. Xia, “FairGP: A Scalable and Fair Graph Transformer Using Graph Partitioning”, in Proceedings of the AAAI Conference on Artificial Intelligence, 2025.
  360. [360] Z. Li, Y. Dong, Q. Liu, and J. X. Yu, “Rethinking Fair Graph Neural Networks from Re-balancing”, in Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 1736–1745, 2024.
  361. [361] F. Guan, T. Zhu, W. Zhou, and K. R. Choo, “Graph Neural Networks: A Survey on the Links between Privacy and Security”, Artificial Intelligence Review, vol. 57, no. 2, pp. 40, 2024.
  362. [362] Y. Wei, H. Yuan, X. Fu, Q. Sun, H. Peng, X. Li, et al., “Poincare Differential Privacy for Hierarchy-Aware Graph Embedding”, in Proceedings of the AAAI Conference on Artificial Intelligence, pp. 9160–9168, 2024.
  363. [363] Y. Zhang, Y. Zhao, Z. Li, X. Cheng, Y. Wang, and O. Kotevska, “A Survey on Privacy in Graph Neural Networks: Attacks, Preservation, and Applications”, IEEE Transactions on Knowledge and Data Engineering, vol. 36, no. 12, pp. 7497–7515, 2024.
  364. [364] T. T. Mueller, C. Paetzold, D. Usynin, D. Rueckert, and G. Kaissis, “Differentially Private Graph Classification with GNNs”, arXiv:2022.02575v2, 2022.
  365. [365] Z. Xiang, T. Wang, and D. Wang, “Preserving Node-level Privacy in Graph Neural Networks”, in 2024 IEEE Symposium on Security and Privacy (SP), pp. 4714–4732, 2024.
  366. [366] S. Sajadmanesh, A. S. Shamsabadi, A. Bellet, and D. Gatica-Perez, “Gap: Differentially Private Graph Neural Networks with Aggregation Perturbation”, in Proceedings of the 32nd USENIX Security Symposium, 2023.
  367. [367] M. Abadi, A. Chu, I. Goodfellow, H. B. Mcmahan, I. Mironov, K. Talwar, et al., “Deep Learning with Differential Privacy”, in Proceedings of the 2016 ACM SIGSAC Conference on Computer and Commnuications Security, 2016.
  368. [368] E. Chien, W. Chen, C. Pan, P. Li, A. Ozgur, and O. Milenkovic, “Differentially Private Decoupled Graph Convolutions for Multigranular Topology Protection”, in Proceedings of the 37th International Conference on Neural Information Processing Systems, pp. 45381–45401, 2023.
  369. [369] J. Pei, W. Liu, J. Li, L. Wang, and C. Liu, “A Review of Federated Learning Methods in Heterogeneous Scenarios”, IEEE Transactions on Consumer Electronics, vol. 70, no. 3, pp. 5983–5999, 2024.
  370. [370] X. Fu, Z. Chen, B. Zhang, C. Chen, and J. Li, “Federated Graph Learning with Structure Proxy Alignment”, in Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 827–838, 2024.
  371. [371] Z. Lu, H. Pan, Y. Dai, X. Si, and Y. Zhang, “Federated Learning with Non-IID Data: A Survey”, IEEE Internet of Things Journal, vol. 11, no. 11, pp. 19188–19209, 2024.
  372. [372] W. Zhang, S. Zhou, T. Walsh, and J. C Weiss, “Fairness amidst non-IID graph data: A literature review”, AI Magazine, vol. 46, no. 1, pp. e12212, 2025.
  373. [373] L. Zhong, Y. Pi, Z. Chen, Z. Yu, W. Miao, and X. Chen, “SpreadFGL:Edge-Client Collaborative Federated Graph Learning with Adaptive Neighbor Generation”, in Proceedings of the IEEE Conference on Computer Commnuications, 2024.
  374. [374] Y. Yang, Q. Li, J. Jia, Y. Hong, and B. Wang, “Distributed Backdoor Attacks on Federated Graph Learning and Certified Defenses”, in Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, pp. 2829–2843, 2024.
  375. [375] J. Liao, W. Fu, C. Wang, Z. Wei, and J. Xu, “Value at Adversarial Risk: A Graph Defense Strategy against Cost-Aware Attacks”, in Proceedings of the AAAI Conference on Artificial Intelligence, pp. 13763–13771, 2024.
  376. [376] K. Zhao, Q. Kang, Y. Song, R. She, S. Wang, and W. P. Tay, “Adversarial Robustness in Graph Neural Networks: a Hamiltonian Approach”, in Proceedings of the 37th International Conference on Neural Information Processing Systems, pp. 3338–3361, 2023.
  377. [377] L. Gosch, S. Geisler, D. Sturm, B. Charpentier, D. Zugner, and S. Gunnemann, “Adversarial Training for Graph Neural Networks: Pitfalls, Solutions, and New Directions”, in Proceedings of the 37th International Conference on Neural Information Processing Systems, pp. 58088–58112, 2023.
  378. [378] J. Yang, R. Zhang, Z. Chen, F. Wu, and K. Kuang, “Unifying Adversarial Perturbation for Graph Neural Networks”, arXiv:2025.00387, 2025.
  379. [379] Z. Zhang, X. Wang, H. Zhou, Y. Yu, M. Zhang, C. Yang, et al., “Can Large Language Models Improve the Adversarial Robustness of Graph Neural Networks?”, in Proceedings of the 31th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 2008–2019, 2025.
  380. [380] E. Dai, W. Jin, H. Liu, and S. Wang, “Towards Robust Graph Neural Networks for Noisy Graphs with Sparse Labels”, in Proceedings of the 15th ACM International Conference on Web Search and Data Mining, pp. 181–191, 2022.
  381. [381] J. Luo, Q. Sun, H. Yuan, X. Fu, and J. Li, “Robust Graph Learning Against Adversarial Evasion Attacks via Prior-Free Diffusion-Based Structure Purification”, in Proceedings of the ACM on Web Conference 2025, pp. 2098–2110, 2025.
  382. [382] Y. Lai, Y. Zhu, B. Pan, and K. Zhou, “Node-aware Bi-smoothing: Certified Robustness against Graph Injection Attacks”, in Proceedings of 2024 IEEE Symposium on Security and Privacy, 2024.
  383. [383] X. Zeng, H. Li, Q. Qi, J. Wang, H. Deng, H. Sun, et al., “Robustness Verification of Deep Graph Neural Networks Tightened by Linear Approximation”, in Proceedings of the 15th ACM International Conference on Web Search and Data Mining, pp. 281–289, 2025.
  384. [384] C. Dwork, M. Hardt, T. Pitassi, O. Reingold, and R. S. Zemel, “Fairness through Awareness”, in Proceedings of Innovations in Theoretical Computer Science, pp. 214–226, 2012.
  385. [385] M. Hardt, E. Price, and N. Srebro, “Equality of Opportunity in Supervised Learning”, in Proceedings of the 30th International Conference on Neural Information Processing Systems, pp. 3323–3331, 2016.
  386. [386] E. Dai and S. Wang, “Learning Fair Graph Neural Networks with Limited and Private Sensitive Attribute Information”, IEEE Transactions on Knowledge and Data Engineering, vol. 35, no. 7, pp. 7103–7117, 2023.
  387. [387] R. Luo, H. Huang, S. Yu, Z. Han, E. He, X. Zhang, et al., “FUGNN: Harmonizing Fairness and Utility in Graph Neural Networks”, in Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 2072–2081, 2024.
  388. [388] R. Luo, H. Huang, S. Yu, X. Zhang, and F. Xia, “FairGT:A Fairness-aware Graph Transformer”, in Proceedings of the 32rd International Joint Conference on Artificial Intelligence, pp. 449–457, 2024.
  389. [389] J. Kang, J. He, R. Maciejewski, and H. Tong, “InFoRM: Individual Fairness on Graph Mining”, in Proceedings of the 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 379–389, 2020.
  390. [390] Y. Dong, J. Kang, H. Tong, and J. Li, “Individual Fairness for Graph Neural Networks: A Ranking based Approach”, in Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 300–310, 2021.
  391. [391] K. Munagala and G. S. Sankar, “Individual Fairness in Graph Decomposition”, in Proceedings of the 41st International Conference on Machine Learning, pp. 36723–36742, 2024.
  392. [392] J. M Buchanan, “A Hobbesian interpretation of the Rawlsian difference principle”, Kyklos, vol. 29, no. 1, pp. 5–25, 1976.
  393. [393] J. Kang, Y. Zhu, Y. Xia, J. Luo, and H. Tong, “RawlsGCN: Towards Rawlsian Difference Principle on Graph Convolutional Network”, in Proceedings of the ACM Web Conference 2022, pp. 1214–1225, 2022.
  394. [394] Z. Liu, T. Nguyen, and Y. Fang, “On Generalized Degree Fairness in Graph Neural Networks”, in Proceedings of the AAAI Conference on Artificial Intelligence, pp. 4525–4533, 2023.
  395. [395] J. Xia, Y. Zhu, Y. Du, and S. Z. Li, “A Survey of Pretraining on Graphs: Taxonomy, Methods, and Applications”, arXiv preprint arXiv:2202.07893, 2022.
  396. [396] J. Liu, C. Yang, Z. Lu, J. Chen, Y. Li, M. Zhang, et al., “Graph Foundation Models: Concepts, Opportunities and Challenges”, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 47, no. 6, pp. 5023-5044, 2025.
  397. [397] W. L. Hamilton, Z. Ying, and J. Leskovec, “Inductive Representation Learning on Large Graphs”, in Advances in Neural Information Processing Systems, pp. 1024–1034, 2017.
  398. [398] C. Ying, T. Cai, S. Luo, S. Zheng, G. Ke, D. He, et al., “Do transformers really perform badly for graph representation?”, in Advances in Neural Information Processing Systems, vol. 34, pp. 28877–28888, 2021.
  399. [399] D. Chen, L. O'Bray, and K. Borgwardt, “Structure-aware transformer for graph representation learning”, in International Conference on Machine Learning, pp. 3469–3489, 2022.
  400. [400] J. Ma, M. He, and Z. Wei, “Polyformer: Scalable node-wise filters via polynomial graph transformer”, in Proceedings of the ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 2118–2129, 2024.
  401. [401] M. Simonovsky and N. Komodakis, “Graphvae: Towards generation of small graphs using variational autoencoders”, in Proceedings of the International Conference on Artificial Neural Networks, pp. 412–422, 2018.
  402. [402] H. Wang, J. Wang, J. Wang, M. Zhao, W. Zhang, F. Zhang, et al., “Graphgan: Graph representation learning with generative adversarial nets”, in Proceedings of the AAAI conference on artificial intelligence, vol. 32, no. 1, 2018.
  403. [403] H. Mao, Z. Chen, W. Tang, J. Zhao, Y. Ma, T. Zhao, et al., “Position: Graph foundation models are already here”, in International Conference on Machine Learning, pp. 34670–34692, 2024.
  404. [404] J. Tang, Y. Yang, W. Wei, L. Shi, L. Su, S. Cheng, et al., “Graphgpt: Graph instruction tuning for large language models”, in Proceedings of the International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 491–500, 2024.
  405. [405] X. He, K. Zhao, and X. Chu, “AutoML: A survey of the state-of-the-art”, Knowledge-based systems, vol. 212, pp. 106622, 2021.
  406. [406] M. Landers and A. Doryab, “Deep reinforcement learning verification: a survey”, ACM Computing Surveys, vol. 55, no. 14s, pp. 1–31, 2023.
  407. [407] S. Milani, N. Topin, M. Veloso, and F. Fang, “Explainable reinforcement learning: A survey and comparative review”, ACM Computing Surveys, vol. 56, no. 7, pp. 1–36, 2024.
  408. [408] S. Munikoti, D. Agarwal, L. Das, M. Halappanavar, and B. Natarajan, “Challenges and opportunities in deep reinforcement learning with graph neural networks: A comprehensive review of algorithms and applications”, IEEE transactions on neural networks and learning systems, vol. 35, no. 11, pp. 15051-15071, 2023.
  409. [409] F. Devailly, D. Larocque, and L. Charlin, “IG-RL: Inductive graph reinforcement learning for massive-scale traffic signal control”, IEEE Transactions on Intelligent Transportation Systems, vol. 23, no. 7, pp. 7496–7507, 2021.
  410. [410] S. Yang, “Hierarchical graph multi-agent reinforcement learning for traffic signal control”, Information Sciences, vol. 634, pp. 55–72, 2023.
  411. [411] J. Xu, Y. Wang, B. Zhang, and J. Ma, “A Graph reinforcement learning based SDN routing path selection for optimizing long-term revenue”, Future Generation Computer Systems, vol. 150, pp. 412–423, 2024.
  412. [412] Y. Liu, W. Wang, Y. Hu, J. Hao, X. Chen, and Y. Gao, “Multi-agent game abstraction via graph attention neural network”, in Proceedings of the AAAI conference on artificial intelligence, vol. 34, no. 05, pp. 7211–7218, 2020.
  413. [413] S. Shen, Y. Fu, H. Su, H. Pan, P. Qiao, Y. Dou, et al., “Graphcomm: A graph neural network based method for multi-agent reinforcement learning”, in ICASSP 2021-2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 3510–3514, 2021.
  414. [414] X. Zhang, Y. Liu, X. Xu, Q. Huang, H. Mao, and A. Carie, “Structural relational inference actor-critic for multi-agent reinforcement learning”, Neurocomputing, vol. 459, pp. 383–394, 2021.
  415. [415] L. Kong, J. Feng, H. Liu, D. Tao, Y. Chen, and M. Zhang, “Mag-gnn: Reinforcement learning boosted graph neural network”, Advances in Neural Information Processing Systems, vol. 36, 2024.
  416. [416] T. Lanciano, A. Miyauchi, A. Fazzone, and F. Bonchi, “A survey on the densest subgraph problem and its variants”, ACM Computing Surveys, vol. 56, no. 8, pp. 1–40, 2024.
  417. [417] P. Ribeiro, P. Paredes, M. E. Silva, D. Aparicio, and F. Silva, “A survey on subgraph counting: concepts, algorithms, and applications to network motifs and graphlets”, ACM Computing Surveys, vol. 54, no. 2, pp. 1–36, 2021.
  418. [418] Q. Sun, J. Li, H. Peng, J. Wu, Y. Ning, P. S Yu, et al., “Sugar: Subgraph neural network with reinforcement pooling and self-supervised mutual information mechanism”, in Proceedings of the web conference 2021, pp. 2081–2091, 2021.
  419. [419] Y. Gao, H. Yang, P. Zhang, C. Zhou, and Y. Hu, “Graph neural architecture search”, in International joint conference on artificial intelligence, 2021.
  420. [420] L. Wei, H. Zhao, Z. He, and Q. Yao, “Neural architecture search for GNN-based graph classification”, ACM Transactions on Information Systems, vol. 42, no. 1, pp. 1–29, 2023.
  421. [421] R. Liu, P. Xing, Z. Deng, A. Li, C. Guan, and H. Yu, “Federated Graph Neural Networks: Overview, Techniques, and Challenges”, IEEE Transactions on Neural Networks and Learning Systems, vol. 36, no. 3, pp. 4279-4295, 2024.
  422. [422] L. Ge, Y. Li, H. Li, L. Tian, and Z. Wang, “A Review of Privacy-Preserving Research on Federated Graph Neural Networks”, Neurocomputing, vol. 600, pp. 128166, 2024.
  423. [423] X. Fu, B. Zhang, Y. Dong, C. Chen, and J. Li, “Federated Graph Machine Learning: A Survey of Concepts, Techniques, and Applications”, SIGKDD Explor. Newsl., vol. 24, pp. 32–47, 2022.
  424. [424] B. McMahan, E. Moore, D. Ramage, S. Hampson, and B. A. y Arcas, “Communication-Efficient Learning of Deep Networks from Decentralized Data”, in Artificial intelligence and statistics, vol. 54, pp. 1273–1282, 2017.
  425. [425] T. Li, A. K. Sahu, M. Zaheer, M. Sanjabi, A. Talwalkar, and V. Smith, “Federated Optimization in Heterogeneous Networks”, Proceedings of Machine learning and systems, vol. 2, pp. 429–450, 2020.
  426. [426] X. Kong, W. Zhang, Y. Qu, X. Yao, and G. Shen, “FedAWR: An Interactive Federated Active Learning Framework for Air Writing Recognition”, IEEE Transactions on Mobile Computing, vol. 23, no. 5, pp. 6423-6436, 2024.
  427. [427] X. Kong, W. Zhang, H. Wang, M. Hou, X. Chen, X. Yan, et al., “Federated Graph Anomaly Detection via Contrastive Self-Supervised Learning”, IEEE Transactions on Neural Networks and Learning Systems, vol. 36, no. 5, pp. 7931-7944, 2024.
  428. [428] Y. Tan, Y. Liu, G. Long, J. Jiang, Q. Lu, and C. Zhang, “Federated Learning on Non-IID Graphs via Structural Knowledge Sharing”, in Proceedings of the AAAI conference on artificial intelligence, vol. 37, no. 8, pp. 9953–9961, 2023.
  429. [429] X. Li, Y. Zhu, B. Pang, G. Yan, Y. Yan, Z. Li, et al., “OpenFGL: A Comprehensive Benchmarks for Federated Graph Learning”, arXiv preprint arXiv:2408.16288, 2024.
  430. [430] Z. Liu, H. Zhou, X. He, H. Yuan, J. Du, M. Wang, et al., “Model-Heterogeneous Federated Graph Learning With Prototype Propagation”, IEEE Transactions on Artificial Intelligence, vol. 6, no. 3, pp. 676-689, 2025.
  431. [431] H. Xie, J. Ma, L. Xiong, and C. Yang, “Federated Graph Classification over Non-IID Graphs”, Advances in neural information processing systems, vol. 34, pp. 18839–18852, 2021.
  432. [432] G. Wan, W. Huang, and M. Ye, “Federated Graph Learning under Domain Shift with Generalizable Prototypes”, in Proceedings of the AAAI Conference on Artificial Intelligence, vol. 38, no. 14, pp. 15429–15437, 2024.
  433. [433] K. Zhang, C. Yang, X. Li, L. Sun, and S. M. Yiu, “Subgraph Federated Learning with Missing Neighbor Generation”, Advances in Neural Information Processing Systems, vol. 34, pp. 6671–6682, 2021.
  434. [434] X. Kong, H. Yuan, G. Shen, H. Zhou, W. Liu, and Y. Yang, “Mitigating Data Imbalance and Generating Better Prototypes in Heterogeneous Federated Graph Learning”, Knowledge-Based Systems, vol. 296, pp. 111876, 2024.
  435. [435] J. Baek, W. Jeong, J. Jin, J. Yoon, and S. J. Hwang, “Personalized Subgraph Federated Learning”, in International conference on machine learning, vol. 202, pp. 1396–1415, 2023.
  436. [436] Y. Yao, W. Jin, S. Ravi, and C. Joe-Wong, “FedGCN: Convergence-Communication Tradeoffs in Federated Training of Graph Convolutional Networks”, Advances in neural information processing systems, vol. 36, pp. 79748–79760, 2023.
  437. [437] C. Meng, S. Rambhatla, and Y. Liu, “Cross-Node Federated Graph Neural Network for Spatio-Temporal Data Modeling”, in Proceedings of the 27th ACM SIGKDD conference on knowledge discovery & data mining, pp. 1202–1211, 2021.
  438. [438] P. Xing, S. Lu, L. Wu, and H. Yu, “BiG-Fed: Bilevel Optimization Enhanced Graph-Aided Federated Learning”, IEEE Transactions on Big Data, pp. 1-12, 2022.
  439. [439] F Chen, G Long, Z Wu, T Zhou, and J Jiang, “Personalized Federated Learning With a Graph”, in Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022.
  440. [440] K. Liang, L. Meng, M. Liu, Y. Liu, W. Tu, S. Wang, et al., “A survey of knowledge graph reasoning on graph types: Static, dynamic, and multi-modal”, IEEE Transactions on Pattern Analysis and Machine Intelligence, 2024.
  441. [441] S. Ji, S. Pan, E. Cambria, P. Marttinen, and P. S. Yu, “A Survey on Knowledge Graphs: Representation, Acquisition, and Applications”, IEEE Trans. Neural Networks Learn. Syst., vol. 33, no. 2, pp. 494–514, 2022.
  442. [442] Z. Li, X. Jin, W. Li, S. Guan, J. Guo, H. Shen, et al., “Temporal Knowledge Graph Reasoning Based on Evolutional Representation Learning”, in SIGIR '21: The 44th International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 408–417, 2021.
  443. [443] W. Chen, H. Wan, Y. Wu, S. Zhao, J. Cheng, Y. Li, et al., “Local-Global History-Aware Contrastive Learning for Temporal Knowledge Graph Reasoning”, in 40th IEEE International Conference on Data Engineering, ICDE 2024, Utrecht, The Netherlands, May 13-16, 2024, pp. 733–746, 2024.
  444. [444] X. Han, Z. Liu, and M. Sun, “Neural Knowledge Acquisition via Mutual Attention Between Knowledge Graph and Text”, in Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, pp. 4832–4839, 2018.
  445. [445] S. Guan, X. Jin, Y. Wang, and X. Cheng, “Shared Embedding Based Neural Networks for Knowledge Graph Completion”, in Proceedings of the 27th ACM International Conference on Information and Knowledge Management, CIKM 2018, Torino, Italy, October 22-26, 2018, pp. 247–256, 2018.
  446. [446] L. Niu, C. Fu, Q. Yang, Z. Li, Z. Chen, Q. Liu, et al., “Open-world knowledge graph completion with multiple interaction attention”, World Wide Web, vol. 24, no. 1, pp. 419–439, 2021.
  447. [447] C. Zhang, Y. Li, N. Du, W. Fan, and P. S. Yu, “On the Generative Discovery of Structured Medical Knowledge”, in Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, KDD, pp. 2720–2728, 2018.
  448. [448] X. Zhuo, G. Wu, Z. Zhang, and X. Wu, “Geometric-Contextual Mutual Infomax Path Aggregation for Relation Reasoning on Knowledge Graph”, IEEE Trans. Knowl. Data Eng., vol. 36, no. 7, pp. 3076–3090, 2024.
  449. [449] X. Mei, L. Yang, Z. Jiang, X. Cai, D. Gao, J. Han, et al., “An Inductive Reasoning Model based on Interpretable Logical Rules over temporal knowledge graph”, Neural Networks, vol. 174, pp. 106219, 2024.
  450. [450] M. Chen, W. Zhang, W. Zhang, Q. Chen, and H. Chen, “Meta Relational Learning for Few-Shot Link Prediction in Knowledge Graphs”, in Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing, pp. 4216–4225, 2019.
  451. [451] J. Qu, D. Ouyang, W. Hua, Y. Ye, and X. Zhou, “Discovering Correlations between Sparse Features in Distant Supervision for Relation Extraction”, in Proceedings of the Twelfth ACM International Conference on Web Search and Data Mining, WSDM, pp. 726–734, 2019.
  452. [452] X. Ying, Z. Meng, M. Zhao, M. Yu, S. Pan, and X. Li, “Gated graph convolutional network with enhanced representation and joint attention for distant supervised heterogeneous relation extraction”, World Wide Web (WWW), vol. 26, no. 1, pp. 401–420, 2023.
  453. [453] B. Li, W. Ye, J. Zhang, and S. Zhang, “Reviewing Labels: Label Graph Network with Top-k Prediction Set for Relation Extraction”, in Thirty-Seventh AAAI Conference on Artificial Intelligence, pp. 13051–13058, 2023.
  454. [454] Y. Wei and Q. Li, “SagDRE: Sequence-Aware Graph-Based Document-Level Relation Extraction with Adaptive Margin Loss”, in The 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 2000–2008, 2022.
  455. [455] N. Zhang, S. Deng, Z. Sun, G. Wang, X. Chen, W. Zhang, et al., “Long-tail Relation Extraction via Knowledge Graph Embeddings and Graph Convolution Networks”, in Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, NAACL-HLT 2019, Minneapolis, MN, USA, June 2-7, 2019, Volume 1 (Long and Short Papers), pp. 3016–3025, 2019.
  456. [456] M. Ehrmann, A. Hamdi, E. L. Pontes, M. Romanello, and A. Doucet, “Named entity recognition and classification in historical documents: A survey”, ACM Computing Surveys, vol. 56, no. 2, pp. 1–47, 2023.
  457. [457] J. Hao, M. Chen, W. Yu, Y. Sun, and W. Wang, “Universal representation learning of knowledge bases by jointly embedding instances and ontological concepts”, in Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 1709–1719, 2019.
  458. [458] Y. Zhao, A. Zhang, R. Xie, K. Liu, and X. Wang, “Connecting Embeddings for Knowledge Graph Entity Typing”, in Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics, ACL 2020, Online, July 5-10, 2020, pp. 6419–6428, 2020.
  459. [459] W. Zheng, L. Yan, and F. Wang, “Knowledge is power: Open-world knowledge representation learning for knowledge-based visual reasoning”, Artif. Intell., vol. 333, pp. 104147, 2024.
  460. [460] Y. Wang, H. Zhang, J. Liang, and R. Li, “Dynamic Heterogeneous-Graph Reasoning with Language Models and Knowledge Representation Learning for Commonsense Question Answering”, in Proceedings of the 61st Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), ACL, pp. 14048–14063, 2023.
  461. [461] M. Schlichtkrull, T. N Kipf, P. Bloem, and others, “Modeling relational data with graph convolutional networks”, in The semantic web: 15th international conference, ESWC, 2018.
  462. [462] C. Shang, Y. Tang, J. Huang, J. Bi, X. He, and B. Zhou, “End-to-End Structure-Aware Convolutional Networks for Knowledge Base Completion”, in The Thirty-Third AAAI Conference on Artificial Intelligence, pp. 3060–3067, 2019.
  463. [463] Z. Zhong, A. Barkova, and D. Mottin, “Knowledge-augmented Graph Machine Learning for Drug Discovery: A Survey from Precision to Interpretability”, CoRR, vol. abs/2302.08261, 2023.
  464. [464] P. Liu, W. Yuan, J. Fu, Z. Jiang, H. Hayashi, and G. Neubig, “Pre-train, prompt, and predict: A systematic survey of prompting methods in natural language processing”, ACM Computing Surveys, vol. 55, no. 9, pp. 1–35, 2023.
  465. [465] X. Sun, H. Cheng, J. Li, B. Liu, and J. Guan, “All in one: Multi-task prompting for graph neural networks”, in Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 2120–2131, 2023.
  466. [466] Z. Liu, X. Yu, Y. Fang, and X. Zhang, “Graphprompt: Unifying pre-training and downstream tasks for graph neural networks”, in Proceedings of the ACM Web Conference 2023, pp. 417–428, 2023.
  467. [467] T. Fang, Y. Zhang, Y. Yang, C. Wang, and L. Chen, “Universal prompt tuning for graph neural networks”, Advances in Neural Information Processing Systems, vol. 36, 2024.
  468. [468] N. Chen, Z. Zhong, and J. Pang, “An Exploratory Study of COVID-19 Information on Twitter in the Greater Region”, Big Data Cogn. Comput., vol. 5, no. 1, pp. 5, 2021.
  469. [469] M. Zhang, Z. Cui, M. Neumann, and Y. Chen, “An End-to-End Deep Learning Architecture for Graph Classification”, in Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, pp. 4438–4445, 2018.
  470. [470] W. X. Shen, X. Zeng, F. Zhu, Y. l. Wang, C. Qin, Y. Tan, et al., “Out-of-the-box deep learning prediction of pharmaceutical properties by broadly learned knowledge-based molecular representations”, Nat. Mach. Intell., vol. 3, no. 4, pp. 334–343, 2021.
  471. [471] T. Lyu, J. Gao, L. Tian, Z. Li, P. Zhang, and J. Zhang, “MDNN: A Multimodal Deep Neural Network for Predicting Drug-Drug Interaction Events”, in Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, pp. 3536–3542, 2021.
  472. [472] Y. Shen, Y. Zhang, K. Yuan, D. Li, and H. Zheng, “A Knowledge-Enhanced Multi-View Framework for Drug-Target Interaction Prediction”, IEEE Trans. Big Data, vol. 8, no. 5, pp. 1387–1398, 2022.
  473. [473] Y. Sun, Y. Chen, W. Ma, W. Huang, K. Liu, Z. Ma, et al., “PEMP: Leveraging Physics Properties to Enhance Molecular Property Prediction”, in Proceedings of the 31st ACM International Conference on Information & Knowledge Management, pp. 3505–3513, 2022.
  474. [474] T. Hasebe, “Knowledge-embedded message-passing neural networks: improving molecular property prediction with human knowledge”, ACS omega, vol. 6, no. 42, pp. 27955–27967, 2021.
  475. [475] Y. Yu, K. Huang, C. Zhang, L. M Glass, J. Sun, and C. Xiao, “SumGNN: multi-typed drug interaction prediction via efficient knowledge graph summarization”, Bioinformatics, vol. 37, no. 18, pp. 2988–2995, 2021.
  476. [476] Z. Zhu, M. Galkin, Z. Zhang, and J. Tang, “Neural-symbolic models for logical queries on knowledge graphs”, in International conference on machine learning, pp. 27454–27478, 2022.
  477. [477] H. Wang, F. Zhang, M. Zhao, W. Li, X. Xie, and M. Guo, “Multi-task feature learning for knowledge graph enhanced recommendation”, in The world wide web conference, pp. 2000–2010, 2019.
  478. [478] S. Yu, C. Peng, Y. Wang, A. Shehzad, F. Xia, and E. R Hancock, “Quantum Graph Learning: Frontiers and Outlook”, arXiv preprint arXiv:2302.00892, 2023.
  479. [479] C. T\"uys\"uz, C. Rieger, K. Novotny, B. Demirk\"oz, D. Dobos, K. Potamianos, et al., “Hybrid quantum classical graph neural networks for particle track reconstruction”, Quantum Machine Intelligence, vol. 3, pp. 1–20, 2021.
  480. [480] X. Ai, Z. Zhang, L. Sun, J. Yan, and E. Hancock, “Decompositional quantum graph neural network”, 2022.
  481. [481] Z. Tabi, K. H El-Safty, Z. Kallus, P. H\'aga, T. Kozsik, A. Glos, et al., “Quantum optimization for the graph coloring problem with space-efficient embedding”, in 2020 IEEE international conference on quantum computing and engineering (QCE), pp. 56–62, 2020.
  482. [482] E. Pelofske, G. Hahn, and H. Djidjev, “Decomposition algorithms for solving NP-hard problems on a quantum annealer”, Journal of Signal Processing Systems, vol. 93, no. 4, pp. 405–420, 2021.
  483. [483] D. Wang, K. Zheng, F. Teng, and Q. Chen, “Quantum annealing with integer slack variables for grid partitioning”, IEEE Transactions on Power Systems, vol. 38, no. 2, pp. 1747–1750, 2022.
  484. [484] L. K Grover, “A fast quantum mechanical algorithm for database search”, in Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, pp. 212–219, 1996.
  485. [485] Y. Chen, C. Wang, H. Guo, and others, “Novel architecture of parameterized quantum circuit for graph convolutional network”, arXiv preprint arXiv:2203.03251, 2022.
  486. [486] P. Mernyei, K. Meichanetzidis, and I. I. Ceylan, “Equivariant quantum graph circuits”, in International Conference on Machine Learning, pp. 15401–15420, 2022.
  487. [487] L. Henry, S. Thabet, C. Dalyac, and L. Henriet, “Quantum evolution kernel: Machine learning on graphs with programmable arrays of qubits”, Physical Review A, vol. 104, no. 3, pp. 032416, 2021.
  488. [488] K. Kishi, T. Satoh, R. Raymond, N. Yamamoto, and Y. Sakakibara, “Graph kernels encoding features of all subgraphs by quantum superposition”, IEEE Journal on Emerging and Selected Topics in Circuits and Systems, vol. 12, no. 3, pp. 602–613, 2022.
  489. [489] G. Yan, Y. Tang, and J. Yan, “Towards a native quantum paradigm for graph representation learning: A sampling-based recurrent embedding approach”, in Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 2160–2168, 2022.