ScoreCAM GNN: une explication optimale des r'eseaux profonds sur graphes
Not on the map. Why?
Abstract (arXiv)
The explainability of deep networks is becoming a central issue in the deep learning community. It is the same for learning on graphs, a data structure present in many real world problems. In this paper, we propose a method that is more optimal, lighter, consistent and better exploits the topology of the evaluated graph than the state-of-the-art methods.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 12 of its 14 references that are in the map. First posted on arXiv 26 Jul 2022.
Builds on
12 of 14 references.
References · 12
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2017Graph Attention Networkscited by 8,854
- 2015Learning Deep Features for Discriminative Localizationcited by 2,430
- 2018Sanity Checks for Saliency Mapscited by 1,149
- 2019GNNExplainer: Generating Explanations for Graph Neural Networkscited by 735
- 2019Score-CAM: Score-Weighted Visual Explanations for Convolutional Neural Networkscited by 575
- 2016Geometric deep learning on graphs and manifolds using mixture model CNNscited by 468
- 2020Parameterized Explainer for Graph Neural Networkcited by 423
- 2019On the (In)fidelity and Sensitivity for Explanationscited by 309
- 2021On Explainability of Graph Neural Networks via Subgraph Explorationscited by 280
- 2020XGNN: Towards Model-Level Explanations of Graph Neural Networkscited by 211
- 2021GraphSVX: Shapley Value Explanations for Graph Neural Networkscited by 63
Built on by
Not cited yet.