Complement-aware Rationale Extraction Method for Graph Classification Tasks
Author:
Affiliation:

Clc Number:

TP18

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    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 construct counterfactual samples, increasing the diversity of the training data. Extensive experiments on multiple real-world benchmark datasets and a synthetic dataset demonstrate the effectiveness of CaR in producing faithful rationales.

    Reference
    Related
    Cited by
Get Citation

岳立楠,张敏灵.面向图分类任务的互补感知证据提取方法.软件学报,2026,37(7):2936-2952

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:September 19,2025
  • Revised:January 18,2026
  • Adopted:
  • Online: April 29,2026
  • Published: July 06,2026
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063