Pith. sign in

REVIEW 1 cited by

GraphLIME: Local Interpretable Model Explanations for Graph Neural Networks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2001.06216 v2 pith:4WGHXGRW submitted 2020-01-17 cs.LG stat.ML

classification cs.LGstat.ML
keywords graphgraphlimeinterpretablemodelnonlinearexplanationexplanationsnetworks
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Graph structured data has wide applicability in various domains such as physics, chemistry, biology, computer vision, and social networks, to name a few. Recently, graph neural networks (GNN) were shown to be successful in effectively representing graph structured data because of their good performance and generalization ability. GNN is a deep learning based method that learns a node representation by combining specific nodes and the structural/topological information of a graph. However, like other deep models, explaining the effectiveness of GNN models is a challenging task because of the complex nonlinear transformations made over the iterations. In this paper, we propose GraphLIME, a local interpretable model explanation for graphs using the Hilbert-Schmidt Independence Criterion (HSIC) Lasso, which is a nonlinear feature selection method. GraphLIME is a generic GNN-model explanation framework that learns a nonlinear interpretable model locally in the subgraph of the node being explained. More specifically, to explain a node, we generate a nonlinear interpretable model from its $N$-hop neighborhood and then compute the K most representative features as the explanations of its prediction using HSIC Lasso. Through experiments on two real-world datasets, the explanations of GraphLIME are found to be of extraordinary degree and more descriptive in comparison to the existing explanation methods.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Towards the Explainability of Temporal Graph Networks via Memory Backtracking and Topological Attribution

    cs.LG 2026-07 conditional novelty 6.5 of 10

    MemExplainer attributes TGN logits to neighboring and historical events via LRP on topology and memory trees, then optimizes event selection for fidelity, outperforming baselines on nine datasets.

Pith tools