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

软件学报 ISSN 1000-9825, CODEN RUXUEW                                        E-mail: jos@iscas.ac.cn
                 2026,37(7):2936−2952 [doi: 10.13328/j.cnki.jos.007655] [CSTR: 32375.14.jos.007655]  http://www.jos.org.cn
                 ©中国科学院软件研究所版权所有.                                                          Tel: +86-10-62562563



                                                                   *
                 面向图分类任务的互补感知证据提取方法

                 岳立楠  1,2 ,    张敏灵  1,2


                 1
                  (东南大学 计算机科学与工程学院, 江苏 南京 211189)
                 2
                  (计算机网络和信息集成教育部重点实验室 (东南大学), 江苏 南京 211189)
                 通信作者: 张敏灵, E-mail: zhangml@seu.edu.cn

                 摘 要: 图神经网络      (graph neural network, GNN) 在图分类任务中表现出色, 但其“黑箱”性质引发了对预测过程可
                 解释性的广泛关注. 作为一种自解释机制, 证据提取方法近年来受到广泛研究, 其目标是在生成预测结果的同时,
                 从原始图中提取紧凑、具备判别性的子图结构               (即证据子图) 以作为解释. 然而, 现有方法往往依赖数据中的“捷径”特
                 征进行预测, 导致提取的解释缺乏忠实性, 进而影响模型的可解释性与鲁棒性. 为缓解上述问题, 提出一种互补感
                 知证据提取    (complement-aware rationale extraction, CaR) 方法, 将未被选为证据的子图区域视为互补信息, 并从以
                 下  3  个方面提升反事实建模与解释能力: 首先, 引入对比学习机制以解耦证据表示与互补表示, 增强二者的语义独
                 立性; 其次, 提出回声学习      (echo-learning) 策略, 充分利用  GNN  各层消息传递过程中的中间表示, 捕捉不同深度层
                 次下互补结构的差异性; 最后, 将当前与历史层的互补表示与证据表示结合, 进而构造反事实样本, 提升训练数据
                 的多样性. 在多个真实数据集及一个合成数据集上的实验证明, CaR                   能够生成更具忠实性的证据, 验证了其有效性.
                 关键词: 证据提取; 图神经网络; 捷径学习; 可解释人工智能; 数据挖掘
                 中图法分类号: TP18

                 中文引用格式: 岳立楠, 张敏灵. 面向图分类任务的互补感知证据提取方法. 软件学报, 2026, 37(7): 2936–2952. http://www.jos.org.
                 cn/1000-9825/7655.htm
                 英文引用格式: Yue LN, Zhang ML. Complement-aware Rationale Extraction Method for Graph Classification Tasks. Ruan Jian Xue
                 Bao/Journal of Software, 2026, 37(7): 2936–2952 (in Chinese). http://www.jos.org.cn/1000-9825/7655.htm

                 Complement-aware Rationale Extraction Method for Graph Classification Tasks
                          1,2
                 YUE Li-Nan , ZHANG Min-Ling 1,2
                 1
                 (School of Computer Science and Engineering, Southeast University, Nanjing 211189, China)
                 2
                 (Key Laboratory of Computer Network and Information Integration (Southeast University), Ministry of Education, Nanjing 211189, China)
                 Abstract:  Graph  neural  networks  (GNNs)  have  achieved  remarkable  performance  on  graph  classification  tasks,  but  their  black-box  nature
                 has  raised  widespread  concerns  about  the  explainability  of  their  prediction  process.  As  a  self-explaining  mechanism,  rationale  extraction
                 has  received  increasing  attention  in  recent  years.  Its  goal  is  to  extract  concise  subgraph  structures  from  the  original  graph  (i.e.,  rationale
                 subgraphs)  as  explanations  while  generating  prediction  results.  However,  existing  methods  often  rely  on  spurious  shortcut  features  in  the
                 data,  resulting  in  explanations  that  lack  faithfulness,  which  in  turn  compromises  both  the  interpretability  and  robustness  of  the  model.  To
                 address  these  issues,  this  study  proposes  a  complement-aware  rationale  extraction  (CaR)  method,  which  treats  the  subgraph  regions  not
                 selected  as  rationales  as  complement  information.  The  method  enhances  counterfactual  modeling  and  interpretability  from  the  following
                 three  perspectives.  First,  a  contrastive  learning  mechanism  is  introduced  to  disentangle  rationale  representations  from  complement
                 representations,  enhancing  their  semantic  independence.  Second,  an  echo-learning  strategy  is  proposed  to  fully  leverage  the  intermediate
                 representations  generated  during  the  message-passing  process  of  GNNs,  capturing  the  structural  differences  in  complement  parts  across
                 different  network  depths.  Finally,  the  method  combines  complement  and  rationale  representations  from  both  current  and  historical  layers  to


                 *    基金项目: 国家自然科学基金  (62506072, 62225602)
                  收稿时间: 2025-09-19; 修改时间: 2026-01-18, 2026-02-02; 采用时间: 2026-02-24; jos 在线出版时间: 2026-04-29
                  CNKI 网络首发时间: 2026-04-30
   246   247   248   249   250   251   252   253   254   255   256