Cited by 186Explainable Artificial Intelligence (XAI)Advanced Graph Neural NetworksPrivacy-Preserving Technologies in Data

Evaluating explainability for graph neural networks

Open access
Agarwal, Chirag, Queen, Owen, Lakkaraju, Himabindu, Zitnik, Marinka·2023·Scientific Data

Abstract

As explanations are increasingly used to understand the behavior of graph neural networks (GNNs), evaluating the quality and reliability of GNN explanations is crucial. However, assessing the quality of GNN explanations is challenging as existing graph datasets have no or unreliable ground-truth explanations. Here, we introduce a synthetic graph data generator, Shape GG en , which can generate a variety of benchmark datasets (e.g., varying graph sizes, degree distributions, homophilic vs. heterophilic graphs) accompanied by ground-truth explanations. The flexibility to generate diverse synthetic datasets and corresponding ground-truth explanations allows Shape GG en to mimic the data in various real-world areas. We include Shape GG en and several real-world graph datasets in a graph explainability library, G raph XAI. In addition to synthetic and real-world graph datasets with ground-truth explanations, G raph XAI provides data loaders, data processing functions, visualizers, GNN model implementations, and evaluation metrics to benchmark GNN explainability methods.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1038/s41597-023-01974-x

Cites

35 of 35 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Focusing on the most predictive relationships (edges with importance scores >0.5, representing an average of 14.9% of edges from the KG), the model's performance showed a slight reduction from AUPRC = 0.890 (s.d. 0.006) to AUPRC = 0.886 (s.d. 0.005), indicating that TxGNN's Explainer effectively identifies key associations and explanations accurately reflect TxGNN's internal reasoning.

    “Focusing on the most predictive relationships (that is, edges with importance scores >0.5, representing an average of 14.9% of edges from the KG), the model’s performance showed a slight reduction from AUPRC = 0.890 (s.d. 0.006) to AUPRC = 0.886 (s.d. 0.005), indicating that TxGNN’s Explainer effectively identifies key associations34 and explanations accurately reflect TxGNN’s internal reasoning.”

    From A foundation model for clinician-centered drug repurposing (2024) · cites this paper as [34]

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 17

  1. [1]Agarwal, C., Lakkaraju, H. & Zitnik, M. Towards a unified framework for fair and stable graph representation learning. In UAI (2021).
  2. [2]Sanchez-Lengeling et al. Evaluating attribution for graph neural networks. NeurIPS (2020).
  3. [3]Giunchiglia, V., Shukla, C. V., Gonzalez, G. & Agarwal, C. Towards training GNNs using explanation directed message passing. In The First Learning on Graphs Conference (2022).
  4. [6]Baldassarre, F. & Azizpour, H. Explainability techniques for graph convolutional networks. In ICML Workshop on LRGR (2019).
  5. [7]Faber, L. et al. Contrastive graph neural network explanation. In ICML Workshop on Graph Representation Learning and Beyond (2020).
  6. [9]Lucic, A., Ter Hoeve, M. A., Tolomei, G., De Rijke, M. & Silvestri, F. Cf-gnnexplainer: Counterfactual explanations for graph neural networks. In AISTATS (PMLR, 2022).
  7. [12]Schlichtkrull, M. S., De Cao, N. & Titov, I. Interpreting graph neural networks for nlp with differentiable edge masking. In ICLR (2021).
  8. [13]Vu, M. N. & Thai, M. T. PGM-Explainer: probabilistic graphical model explanations for graph neural networks. In NeurIPS (2020).
  9. [24]Wang, Z., Yin, H. & Song, Y. Benchmarking the combinatorial generalizability of complex query answering on knowledge graphs. In NeurIPS Datasets and Benchmarks (2021).
  10. [25]Liu, M. et al. DIG: A turnkey library for diving into graph deep learning research. JMLR (2021).
  11. [26]Fey, M. & Lenssen, J. E. Fast graph representation learning with PyTorch Geometric. ICLR 2019 (RLGM Workshop) (2019).
  12. [30]Sundararajan, M., Taly, A. & Yan, Q. Axiomatic attribution for deep networks. In ICML (2017).
  13. [31]Yuan, H., Yu, H., Wang, J., Li, K. & Ji, S. On explainability of graph neural networks via subgraph explorations. In ICML (2021).
  14. [32]Xu, K., Hu, W., Leskovec, J. & Jegelka, S. How powerful are graph neural networks? In ICLR (2019).
  15. [33]Kipf, T. N. & Welling, M. Semi-supervised classification with graph convolutional networks. In ICLR (2017).
  16. [41]Guyon, I. Design of experiments of the nips 2003 variable selection benchmark. In NIPS 2003 workshop on feature extraction and feature selection (2003).
  17. [42]Pedregosa, F. et al. Scikit-learn: Machine learning in Python. In JMLR (2011).

Cited by

Sorted by citations

  • A foundation model for clinician-centered drug repurposing

    Huang, K., Chandak, P., Wang, Q., Havaldar, S., Vaid, A., Leskovec, J., Nadkarni, G. N., Glicksberg, B. S., Gehlenborg, N., & Zitnik, M. (2024) · Nature Medicine · doi:10.1038/s41591-024-03233-x · Cited by 249 · see citing works

    “…an average of 14.9% of edges from the KG), the model’s performance showed a slight reduction from AUPRC = 0.890 (s.d. 0.006) to AUPRC = 0.886 (s.d. 0.005), indicating that TxGNN’s Explainer effectively identifies key associations 34 and explanations accurately reflect TxGNN’s internal reasoning.”
    BackgroundMethodInfluentialSelf-citation

Authors
Agarwal, C., Queen, O., Lakkaraju, H., & Zitnik, M.
Affiliations
Harvard University (US)
Venue
Scientific Data
Published
2023-03-18
Volume
10
Issue
1
Pages
144-144
ISSN
2052-4463 (ISSN-L)
OpenAlex
W4327813569
Cited by
186
References
35
Citations by year
2026: 60 · 2025: 70 · 2024: 40 · 2023: 14 · 2022: 2
Type
data paper
Language
en
Open access
Locations
  • Scientific Data (publishedVersion, cc-by)
  • PubMed Central (publishedVersion, cc-by)
  • PubMed (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
  • arXiv (Cornell University) (cc-by)
Funders
  • National Science Foundation (2008461, FA8702-15-D-0001, 2030459, 2040989, 2033384)
  • AstraZeneca
  • U.S. Air Force (FA8702‐15‐D‐0001, Contract No. FA8702-15-D-0001, Air Force Contract No. FA8702-15-D-0001)
  • Harvard Data Science Initiative, Harvard University
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Explainable Artificial Intelligence (XAI)
  • Physical Sciences › Computer Science › Artificial Intelligence › Advanced Graph Neural Networks
  • Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
Keywords
graph neural networks, explainability, explanation evaluation, benchmark dataset

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review