A Completion-Aware Framework for Impactful Counterfactual Explainability in Graph Neural Networks
Researchers propose a novel counterfactual explainability framework for graph neural networks that improves model transparency by combining factual explainability methods with link prediction techniques. The model-agnostic approach enables both edge addition and removal to generate higher-quality, more intuitive explanations for GNN predictions on graph classification tasks.