Page 265 - 《软件学报》2026年第7期
P. 265

2950                                                       软件学报  2026  年第  37  卷第  7  期


                     2024 ACM Web Conf. Singapore: ACM, 2024. 344–352. [doi: 10.1145/3589334.3645332]
                 [13]   Geirhos R, Jacobsen JH, Michaelis C, Zemel R, Brendel W, Bethge M, Wichmann FA. Shortcut learning in deep neural networks. Nature
                     Machine Intelligence, 2020, 2(11): 665–673. [doi: 10.1038/s42256-020-00257-z]
                 [14]   Friedrich F, Stammer W, Schramowski P, Kersting K. A typology for exploring the mitigation of shortcut behaviour. Nature Machine
                     Intelligence, 2023, 5(3): 319–330. [doi: 10.1038/s42256-023-00612-w]
                 [15]   Chang SY, Zhang Y, Yu M, Jaakkola TS. Invariant rationalization. In: Proc. of the 37th Int’l Conf. on Machine Learning. JMLR.org,
                     2020. 135.
                 [16]   Arjovsky M, Bottou L, Gulrajani I, Lopez-Paz D. Invariant risk minimization. arXiv:1907.02893, 2019.
                 [17]   Feng  WZ,  Zhang  J,  Dong  YX,  Han  Y,  Luan  HB,  Xu  Q,  Yang  Q,  Kharlamov  E,  Tang  J.  Graph  random  neural  networks  for  semi-
                     supervised learning on graphs. In: Proc. of the 34th Int’l Conf. on Neural Information Processing Systems. Vancouver: Curran Associates
                     Inc., 2020. 1853.
                 [18]   Li HY, Wang X, Zhang ZW, Zhu WW. Out-of-distribution generalization on graphs: A survey. IEEE Trans. on Pattern Analysis and
                     Machine Intelligence, 2025, 47(11): 10490–10512. [doi: 10.1109/TPAMI.2025.3593897]
                 [19]   Fan SH, Wang X, Shi C, Cui P, Wang B. Generalizing graph neural networks on out-of-distribution graphs. IEEE Trans. on Pattern
                     Analysis and Machine Intelligence, 2024, 46(1): 322–337. [doi: 10.1109/TPAMI.2023.3321097]
                 [20]   Miao S, Liu M, Li P. Interpretable and generalizable graph learning via stochastic attention mechanism. In: Proc. of the 39th Int’l Conf.
                     on Machine Learning. Baltimore: PMLR, 2022. 15524–15543.
                 [21]   Yue LN, Liu Q, Wang L, An YQ, Du YC, Huang ZY. Interventional rationalization. In: Proc. of the 2023 Conf. on Empirical Methods in
                     Natural Language Processing. Singapore: ACL, 2023. 11404–11418. [doi: 10.18653/v1/2023.emnlp-main.700]
                 [22]   Fan SH, Wang X, Mo YH, Shi C, Tang J. Debiasing graph neural networks via learning disentangled causal substructure. In: Proc. of the
                     36th Int’l Conf. on Neural Information Processing Systems. New Orleans: Curran Associates Inc., 2022. 1808.
                 [23]   Liu G, Inae E, Luo TF, Jiang M. Rationalizing graph neural networks with data augmentation. ACM Trans. on Knowledge Discovery
                     from Data, 2024, 18(4): 86. [doi: 10.1145/3638781]
                 [24]   van den Oord A, Li YZ, Vinyals O. Representation learning with contrastive predictive coding. arXiv:1807.03748, 2018.
                 [25]   Knyazev B, Taylor GW, Amer MR. Understanding attention and generalization in graph neural networks. In: Proc. of the 33rd Int’l Conf.
                     on Neural Information Processing Systems. Vancouver: Curran Associates Inc., 2019. 378.
                 [26]   Zhao  G,  Wang  QG,  Yao  F,  Zhang  YF,  Yu  G.  Survey  on  large-scale  graph  neural  network  systems.  Ruan  Jian  Xue  Bao/Journal  of
                     Software, 2022, 33(1): 150–170 (in Chinese with English abstract). http://www.jos.org.cn/1000-9825/6311.htm [doi: 10.13328/j.cnki.jos.
                     006311]
                 [27]   Sun YH, Li GY, Du JJ, Ning B, Chen H. A subgraph matching algorithm based on subgraph index for knowledge graph. Frontiers of
                     Computer Science, 2022, 16(3): 163606. [doi: 10.1007/s11704-020-0360-y]
                 [28]   Fang P, Wang F, Shi Z, Feng D, Yi QX, Xu XH, Zhang YX. An efficient memory data organization strategy for application-characteristic
                     graph processing. Frontiers of Computer Science, 2022, 16(1): 161607. [doi: 10.1007/s11704-020-0255-y]
                 [29]   Liu  XK,  Zhang  K,  Liu  Y,  Chen  EH,  Huang  ZY,  Yue  LN,  Yan  JX.  RHGN:  Relation-gated  heterogeneous  graph  network  for  entity
                     alignment  in  knowledge  graphs.  In:  Findings  of  the  Association  for  Computational  Linguistics:  ACL  2023.  Toronto:  ACL,  2023.
                     8683–8696. [doi: 10.18653/v1/2023.findings-acl.553]
                 [30]   Gao  WB,  Wang  H,  Liu  Q,  Wang  F,  Lin  X,  Yue  LN,  Zhang  Z,  Lv  R,  Wang  SJ.  Leveraging  transferable  knowledge  concept  graph
                     embedding for cold-start cognitive diagnosis. In: Proc. of the 46th Int’l ACM SIGIR Conf. on Research and Development in Information
                     Retrieval. Taipei: ACM, 2023. 983–992. [doi: 10.1145/3539618.3591774]
                 [31]   Zhou CY, Zeng C, He P, Zhang Y. GKCI: An improved GNN-based key class identification method. Ruan Jian Xue Bao/Journal of
                     Software, 2023, 34(6): 2509–2525 (in Chinese with English abstract). http://www.jos.org.cn/1000-9825/6846.htm [doi: 10.13328/j.cnki.
                     jos.006846]
                 [32]   Chen YQ, Zhang YG, Bian YT, Yang H, Ma KL, Xie BH, Liu TL, Han B, Cheng J. Learning causally invariant representations for out-of-
                     distribution generalization on graphs. In: Proc. of the 36th Int’l Conf. on Neural Information Processing Systems. 2022. 22131–22148.
                 [33]   Li HY, Zhang ZW, Wang X, Zhu WW. Learning invariant graph representations for out-of-distribution generalization. In: Proc. of the
                     36th Int’l Conf. on Neural Information Processing Systems. New Orleans: Curran Associates Inc., 2022. 859.
                 [34]   Chen JL, Ying R. TempME: Towards the explainability of temporal graph neural networks via motif discovery. In: Proc. of the 37th Int’l
                     Conf. on Neural Information Processing Systems. New Orleans: Curran Associates Inc., 2023. 1263.
                 [35]   Chen YQ, Bian YT, Zhou KW, Xie BH, Han B, Cheng J. Does invariant graph learning via environment augmentation learn invariance?
                     In: Proc. of the 37th Int’l Conf. on Neural Information Processing Systems. New Orleans: Curran Associates Inc., 2023. 3130.
   260   261   262   263   264   265   266   267   268   269   270