Root Cause Explanation of Outliers under Noisy Mechanisms
- URL: http://arxiv.org/abs/2312.11818v1
- Date: Tue, 19 Dec 2023 03:24:26 GMT
- Title: Root Cause Explanation of Outliers under Noisy Mechanisms
- Authors: Phuoc Nguyen, Truyen Tran, Sunil Gupta, Thin Nguyen, Svetha Venkatesh
- Abstract summary: Causal processes are often modelled as graphs with entities being nodes and their paths/interconnections as edge.
Existing work only consider the contribution of nodes in the generative process.
We consider both individual edge and node of each mechanism when identifying the root causes.
- Score: 50.59446568076628
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Identifying root causes of anomalies in causal processes is vital across
disciplines. Once identified, one can isolate the root causes and implement
necessary measures to restore the normal operation. Causal processes are often
modelled as graphs with entities being nodes and their paths/interconnections
as edge. Existing work only consider the contribution of nodes in the
generative process, thus can not attribute the outlier score to the edges of
the mechanism if the anomaly occurs in the connections. In this paper, we
consider both individual edge and node of each mechanism when identifying the
root causes. We introduce a noisy functional causal model to account for this
purpose. Then, we employ Bayesian learning and inference methods to infer the
noises of the nodes and edges. We then represent the functional form of a
target outlier leaf as a function of the node and edge noises. Finally, we
propose an efficient gradient-based attribution method to compute the anomaly
attribution scores which scales linearly with the number of nodes and edges.
Experiments on simulated datasets and two real-world scenario datasets show
better anomaly attribution performance of the proposed method compared to the
baselines. Our method scales to larger graphs with more nodes and edges.
Related papers
- Revisiting Edge Perturbation for Graph Neural Network in Graph Data
Augmentation and Attack [58.440711902319855]
Edge perturbation is a method to modify graph structures.
It can be categorized into two veins based on their effects on the performance of graph neural networks (GNNs)
We propose a unified formulation and establish a clear boundary between two categories of edge perturbation methods.
arXiv Detail & Related papers (2024-03-10T15:50:04Z) - Ising on the Graph: Task-specific Graph Subsampling via the Ising Model [1.804478631424646]
We present an approach for subsampling graph structures using an Ising model defined on either the nodes or edges.
Our approach is task-specific as it can learn how to reduce a graph for a specific downstream task in an end-to-end fashion.
arXiv Detail & Related papers (2024-02-15T18:58:18Z) - BOURNE: Bootstrapped Self-supervised Learning Framework for Unified
Graph Anomaly Detection [50.26074811655596]
We propose a novel unified graph anomaly detection framework based on bootstrapped self-supervised learning (named BOURNE)
By swapping the context embeddings between nodes and edges, we enable the mutual detection of node and edge anomalies.
BOURNE can eliminate the need for negative sampling, thereby enhancing its efficiency in handling large graphs.
arXiv Detail & Related papers (2023-07-28T00:44:57Z) - NodeFormer: A Scalable Graph Structure Learning Transformer for Node
Classification [70.51126383984555]
We introduce a novel all-pair message passing scheme for efficiently propagating node signals between arbitrary nodes.
The efficient computation is enabled by a kernerlized Gumbel-Softmax operator.
Experiments demonstrate the promising efficacy of the method in various tasks including node classification on graphs.
arXiv Detail & Related papers (2023-06-14T09:21:15Z) - Sequential Learning of the Topological Ordering for the Linear
Non-Gaussian Acyclic Model with Parametric Noise [6.866717993664787]
We develop a novel sequential approach to estimate the causal ordering of a DAG.
We provide extensive numerical evidence to demonstrate that our procedure is scalable to cases with possibly thousands of nodes.
arXiv Detail & Related papers (2022-02-03T18:15:48Z) - Graph Neural Networks with Feature and Structure Aware Random Walk [7.143879014059894]
We show that in typical heterphilous graphs, the edges may be directed, and whether to treat the edges as is or simply make them undirected greatly affects the performance of the GNN models.
We develop a model that adaptively learns the directionality of the graph, and exploits the underlying long-distance correlations between nodes.
arXiv Detail & Related papers (2021-11-19T08:54:21Z) - Explicit Pairwise Factorized Graph Neural Network for Semi-Supervised
Node Classification [59.06717774425588]
We propose the Explicit Pairwise Factorized Graph Neural Network (EPFGNN), which models the whole graph as a partially observed Markov Random Field.
It contains explicit pairwise factors to model output-output relations and uses a GNN backbone to model input-output relations.
We conduct experiments on various datasets, which shows that our model can effectively improve the performance for semi-supervised node classification on graphs.
arXiv Detail & Related papers (2021-07-27T19:47:53Z) - Unveiling Anomalous Edges and Nominal Connectivity of Attributed
Networks [53.56901624204265]
The present work deals with uncovering anomalous edges in attributed graphs using two distinct formulations with complementary strengths.
The first relies on decomposing the graph data matrix into low rank plus sparse components to improve markedly performance.
The second broadens the scope of the first by performing robust recovery of the unperturbed graph, which enhances the anomaly identification performance.
arXiv Detail & Related papers (2021-04-17T20:00:40Z) - Preprocessing noisy functional data using factor models [0.0]
We consider functional data which are measured on a discrete set of observation points.
Signal and noise can be naturally represented as the common and idiosyncratic component of a factor model.
arXiv Detail & Related papers (2020-12-10T16:54:44Z) - Semi-supervised Anomaly Detection on Attributed Graphs [43.69966808278313]
We propose a simple yet effective method for detecting anomalous instances on an attribute graph with label information of a small number of instances.
The proposed method embeds nodes on the attributed graph in the latent space by taking into account their attributes.
In experiments with five real-world attributed graph datasets, we demonstrate that the proposed method achieves better performance than various existing anomaly detection methods.
arXiv Detail & Related papers (2020-02-27T10:06:22Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.