Uncertainty Weighted Causal Graphs

• URL: http://arxiv.org/abs/2002.00429v2
• Date: Thu, 6 Feb 2020 13:39:26 GMT
• Title: Uncertainty Weighted Causal Graphs
• Authors: Eduardo C. Garrido-Merch\'an, C. Puente, A. Sobrino, J.A. Olivas
• Abstract summary: Causality has traditionally been a scientific way to generate knowledge by relating causes to effects. We will attempt to go a step further modelling the uncertainty in the graph through probabilistic improving the management of the imprecision in the quoted graph.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Causality has traditionally been a scientific way to generate knowledge by relating causes to effects. From an imaginery point of view, causal graphs are a helpful tool for representing and infering new causal information. In previous works, we have generated automatically causal graphs associated to a given concept by analyzing sets of documents and extracting and representing the found causal information in that visual way. The retrieved information shows that causality is frequently imperfect rather than exact, feature gathered by the graph. In this work we will attempt to go a step further modelling the uncertainty in the graph through probabilistic improving the management of the imprecision in the quoted graph.

Related papers

• What makes a good feedforward computational graph? [0.8370225749625163]
  We study desirable properties of a feedforward computational graph, discovering two important complementary measures: fidelity and mixing time. Our study is backed by both theoretical analyses of the metrics' behaviour for various graphs, as well as correlating these metrics to the performance of trained neural network models.
  arXiv  Detail & Related papers  (2025-02-10T18:26:40Z)
• CEGRL-TKGR: A Causal Enhanced Graph Representation Learning Framework for Temporal Knowledge Graph Reasoning [7.738230390425271]
  We propose an innovative Causal Enhanced Graph Representation Learning framework for TKGR (named CEGRL-TKGR) This framework introduces causal structures in graph-based representation learning to unveil the essential causal relationships between events. We also advocate the utilization of causal representations for predictions, aiming to mitigate the effects of erroneous correlations caused by confounding features.
  arXiv  Detail & Related papers  (2024-08-15T03:34:53Z)
• Motif-Consistent Counterfactuals with Adversarial Refinement for Graph-Level Anomaly Detection [30.618065157205507]
  We propose a novel approach, Motif-consistent Counterfactuals with Adversarial Refinement (MotifCAR) for graph-level anomaly detection. The model combines the motif of one graph, the core subgraph containing the identification (category) information, and the contextual subgraph of another graph to produce a raw counterfactual graph. MotifCAR can generate high-quality counterfactual graphs.
  arXiv  Detail & Related papers  (2024-07-18T08:04:57Z)
• Towards Self-Interpretable Graph-Level Anomaly Detection [73.1152604947837]
  Graph-level anomaly detection (GLAD) aims to identify graphs that exhibit notable dissimilarity compared to the majority in a collection. We propose a Self-Interpretable Graph aNomaly dETection model ( SIGNET) that detects anomalous graphs as well as generates informative explanations simultaneously.
  arXiv  Detail & Related papers  (2023-10-25T10:10:07Z)
• CLEAR: Generative Counterfactual Explanations on Graphs [60.30009215290265]
  We study the problem of counterfactual explanation generation on graphs. A few studies have explored counterfactual explanations on graphs, but many challenges of this problem are still not well-addressed. We propose a novel framework CLEAR which aims to generate counterfactual explanations on graphs for graph-level prediction models.
  arXiv  Detail & Related papers  (2022-10-16T04:35:32Z)
• Graph Self-supervised Learning with Accurate Discrepancy Learning [64.69095775258164]
  We propose a framework that aims to learn the exact discrepancy between the original and the perturbed graphs, coined as Discrepancy-based Self-supervised LeArning (D-SLA) We validate our method on various graph-related downstream tasks, including molecular property prediction, protein function prediction, and link prediction tasks, on which our model largely outperforms relevant baselines.
  arXiv  Detail & Related papers  (2022-02-07T08:04:59Z)
• Unbiased Graph Embedding with Biased Graph Observations [52.82841737832561]
  We propose a principled new way for obtaining unbiased representations by learning from an underlying bias-free graph. Based on this new perspective, we propose two complementary methods for uncovering such an underlying graph.
  arXiv  Detail & Related papers  (2021-10-26T18:44:37Z)
• ExplaGraphs: An Explanation Graph Generation Task for Structured Commonsense Reasoning [65.15423587105472]
  We present a new generative and structured commonsense-reasoning task (and an associated dataset) of explanation graph generation for stance prediction. Specifically, given a belief and an argument, a model has to predict whether the argument supports or counters the belief and also generate a commonsense-augmented graph that serves as non-trivial, complete, and unambiguous explanation for the predicted stance. A significant 83% of our graphs contain external commonsense nodes with diverse structures and reasoning depths.
  arXiv  Detail & Related papers  (2021-04-15T17:51:36Z)
• Out-of-Sample Representation Learning for Multi-Relational Graphs [8.956321788625894]
  We study the out-of-sample representation learning problem for non-attributed knowledge graphs. We create benchmark datasets for this task, develop several models and baselines, and provide empirical analyses and comparisons of the proposed models and baselines.
  arXiv  Detail & Related papers  (2020-04-28T00:53:01Z)
• A Survey of Adversarial Learning on Graphs [59.21341359399431]
  We investigate and summarize the existing works on graph adversarial learning tasks. Specifically, we survey and unify the existing works w.r.t. attack and defense in graph analysis tasks. We emphasize the importance of related evaluation metrics, investigate and summarize them comprehensively.
  arXiv  Detail & Related papers  (2020-03-10T12:48:00Z)

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.