Javascript must be enabled to continue!
CIDER: Counterfactual-Invariant Diffusion-based GNN Explainer for Causal Subgraph Inference
View through CrossRef
Abstract
Inferring causal links or subgraphs corresponding to a specific phenotype or label based solely on measured data is an important yet challenging task, which is also different from inferring causal nodes. While Graph Neural Network (GNN) Explainers have shown potential in subgraph identification, existing methods with GNN often offer associative rather than causal insights. This lack of transparency and explainability hinders our understanding of their results and also underlying mechanisms. To address this issue, we propose a novel method of causal link/subgraph inference, called CIDER: Counterfactual-Invariant Diffusion-based GNN ExplaineR, by implementing both counterfactual and diffusion implementations. In other words, it is a model-agnostic and task-agnostic framework for generating causal explanations based on a counterfactual-invariant and diffusion process, which provides not only causal subgraphs due to counterfactual implementation but reliable causal links due to the diffusion process. Specifically, CIDER is first formulated as an inference task that generatively provides the two distributions of one causal subgraph and another spurious subgraph. Then, to enhance the reliability, we further model the CIDER framework as a diffusion process. Thus, using the causal subgraph distribution, we can explicitly quantify the contribution of each subgraph to a phenotype/label in a counterfactual manner, representing each subgraph’s causal strength. From a causality perspective, CIDER is an interventional causal method, different from traditional association studies or observational causal approaches, and can also reduce the effects of unobserved confounders. We evaluate CIDER on both synthetic and real-world datasets, which all demonstrate the superiority of CIDER over state-of-the-art methods.
Springer Science and Business Media LLC
Title: CIDER: Counterfactual-Invariant Diffusion-based GNN Explainer for Causal Subgraph Inference
Description:
Abstract
Inferring causal links or subgraphs corresponding to a specific phenotype or label based solely on measured data is an important yet challenging task, which is also different from inferring causal nodes.
While Graph Neural Network (GNN) Explainers have shown potential in subgraph identification, existing methods with GNN often offer associative rather than causal insights.
This lack of transparency and explainability hinders our understanding of their results and also underlying mechanisms.
To address this issue, we propose a novel method of causal link/subgraph inference, called CIDER: Counterfactual-Invariant Diffusion-based GNN ExplaineR, by implementing both counterfactual and diffusion implementations.
In other words, it is a model-agnostic and task-agnostic framework for generating causal explanations based on a counterfactual-invariant and diffusion process, which provides not only causal subgraphs due to counterfactual implementation but reliable causal links due to the diffusion process.
Specifically, CIDER is first formulated as an inference task that generatively provides the two distributions of one causal subgraph and another spurious subgraph.
Then, to enhance the reliability, we further model the CIDER framework as a diffusion process.
Thus, using the causal subgraph distribution, we can explicitly quantify the contribution of each subgraph to a phenotype/label in a counterfactual manner, representing each subgraph’s causal strength.
From a causality perspective, CIDER is an interventional causal method, different from traditional association studies or observational causal approaches, and can also reduce the effects of unobserved confounders.
We evaluate CIDER on both synthetic and real-world datasets, which all demonstrate the superiority of CIDER over state-of-the-art methods.
Related Results
Network modeling using graph neural networks
Network modeling using graph neural networks
(English) Network modeling is central to the field of computer networks. Models are useful in researching new protocols and mechanisms, allowing administrators to estimate their pe...
The Effectiveness of Explainer Video Duration as a Delivery of Practical Course Teaching Material in Sipejar
The Effectiveness of Explainer Video Duration as a Delivery of Practical Course Teaching Material in Sipejar
In the current digital era, video media, particularly explainer videos, are increasingly utilized for distance learning. However, student interest in explainary video media remains...
Causal discovery and prediction: methods and algorithms
Causal discovery and prediction: methods and algorithms
(English) This thesis focuses on the discovery of causal relations and on the prediction of causal effects. Regarding causal discovery, this thesis introduces a novel and generic m...
Biotechnological aspects of the development of apple cider enriched with biologically active substances from Jerusalem artichoke
Biotechnological aspects of the development of apple cider enriched with biologically active substances from Jerusalem artichoke
Cider, produced by fermenting apple or pear juice, remains a popular alcoholic beverage worldwide. The aim of this research is to develop a sparkling pearl cider fortified with the...
Kajian Cider sebagai Alternatif Penganekaragaman Produk Kopi
Kajian Cider sebagai Alternatif Penganekaragaman Produk Kopi
Coffee is an important export commodity from Indonesia. There are not many processed product from coffee, and sincecoffee is a delightful refreshing beverage, it is interesting to ...
Unveiling Molecular Moieties through Hierarchical Graph Explainability
Unveiling Molecular Moieties through Hierarchical Graph Explainability
Abstract
Background: Graph Neural Networks (GNN) have emerged in very recent years as a powerful tool for supporting in silico Virtual Screening. In this work we present a ...
A truss‐based approach for densest homogeneous subgraph mining in node‐attributed graphs
A truss‐based approach for densest homogeneous subgraph mining in node‐attributed graphs
AbstractIn a wide range of graph analysis tasks such as community detection and event detection, densest subgraph mining is important and primitive. With the development of social ...
Query driven-graph neural networks for community search
Query driven-graph neural networks for community search
Given one or more query vertices, Community Search (CS) aims to find densely intra-connected and loosely inter-connected structures containing query vertices. Attributed Community ...

