Fuzzy Stochastic Timed Petri Nets for Causal properties representation

• URL: http://arxiv.org/abs/2011.12075v1
• Date: Tue, 24 Nov 2020 13:22:34 GMT
• Title: Fuzzy Stochastic Timed Petri Nets for Causal properties representation
• Authors: Alejandro Sobrino and Eduardo C. Garrido-Merchan and Cristina Puente
• Abstract summary: Causal relations are frequently represented by directed graphs, with nodes denoting causes and links denoting causal influence. Common methods used for graphically representing causal scenarios are neurons, truth tables, causal Bayesian networks, cognitive maps and Petri Nets. We will show that, even though the traditional models are able to represent separately some of the properties aforementioned, they fail trying to illustrate indistinctly all of them.
• Score: 68.8204255655161
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Imagery is frequently used to model, represent and communicate knowledge. In particular, graphs are one of the most powerful tools, being able to represent relations between objects. Causal relations are frequently represented by directed graphs, with nodes denoting causes and links denoting causal influence. A causal graph is a skeletal picture, showing causal associations and impact between entities. Common methods used for graphically representing causal scenarios are neurons, truth tables, causal Bayesian networks, cognitive maps and Petri Nets. Causality is often defined in terms of precedence (the cause precedes the effect), concurrency (often, an effect is provoked simultaneously by two or more causes), circularity (a cause provokes the effect and the effect reinforces the cause) and imprecision (the presence of the cause favors the effect, but not necessarily causes it). We will show that, even though the traditional graphical models are able to represent separately some of the properties aforementioned, they fail trying to illustrate indistinctly all of them. To approach that gap, we will introduce Fuzzy Stochastic Timed Petri Nets as a graphical tool able to represent time, co-occurrence, looping and imprecision in causal flow.

Related papers

• Identifiability of total effects from abstractions of time series causal graphs [2.5515299924109858]
  We study the problem of identifiability of the total effect of an intervention from observational time series. We consider two abstractions: the extended summary causal graph and the summary causal graph.
  arXiv  Detail & Related papers  (2023-10-23T08:31:26Z)
• Diagrammatic Modelling of Causality and Causal Relations [0.0]
  This paper concerns diagrammatical (graphic) models of causal relationships. We experiment with using the conceptual language of thinging machines (TMs) as a tool in this context. The results show that the TM depiction of causality is more complete and therefore can provide a foundation for causal graphs.
  arXiv  Detail & Related papers  (2023-10-17T07:17:51Z)
• Identifiability of Direct Effects from Summary Causal Graphs [1.0878040851638]
  This paper characterizes all cases for which the direct effect is graphically identifiable from a summary causal graph. It gives two sound finite adjustment sets that can be used to estimate the direct effect whenever it is identifiable.
  arXiv  Detail & Related papers  (2023-06-29T14:05:35Z)
• DOMINO: Visual Causal Reasoning with Time-Dependent Phenomena [59.291745595756346]
  We propose a set of visual analytics methods that allow humans to participate in the discovery of causal relations associated with windows of time delay. Specifically, we leverage a well-established method, logic-based causality, to enable analysts to test the significance of potential causes. Since an effect can be a cause of other effects, we allow users to aggregate different temporal cause-effect relations found with our method into a visual flow diagram.
  arXiv  Detail & Related papers  (2023-03-12T03:40:21Z)
• Probing Graph Representations [77.7361299039905]
  We use a probing framework to quantify the amount of meaningful information captured in graph representations. Our findings on molecular datasets show the potential of probing for understanding the inductive biases of graph-based models. We advocate for probing as a useful diagnostic tool for evaluating graph-based models.
  arXiv  Detail & Related papers  (2023-03-07T14:58:18Z)
• iCITRIS: Causal Representation Learning for Instantaneous Temporal Effects [36.358968799947924]
  Causal representation learning is the task of identifying the underlying causal variables and their relations from high-dimensional observations. We propose iCITRIS, a causal representation learning method that can handle instantaneous effects in temporal sequences. In experiments on three video datasets, iCITRIS accurately identifies the causal factors and their causal graph.
  arXiv  Detail & Related papers  (2022-06-13T13:56:40Z)
• Counterfactual Fairness with Partially Known Causal Graph [85.15766086381352]
  This paper proposes a general method to achieve the notion of counterfactual fairness when the true causal graph is unknown. We find that counterfactual fairness can be achieved as if the true causal graph were fully known, when specific background knowledge is provided.
  arXiv  Detail & Related papers  (2022-05-27T13:40:50Z)
• Causal Transportability for Visual Recognition [70.13627281087325]
  We show that standard classifiers fail because the association between images and labels is not transportable across settings. We then show that the causal effect, which severs all sources of confounding, remains invariant across domains. This motivates us to develop an algorithm to estimate the causal effect for image classification.
  arXiv  Detail & Related papers  (2022-04-26T15:02:11Z)
• Do learned representations respect causal relationships? [30.36097461828338]
  We introduce NCINet, an approach for observational causal discovery from high-dimensional data. Second, we apply NCINet to identify the causal relations between image representations of different pairs of attributes with known and unknown causal relations between the labels. Third, we analyze the effect on the underlying causal relation between learned representations induced by various design choices in representation learning.
  arXiv  Detail & Related papers  (2022-04-02T04:53:10Z)
• Causal Expectation-Maximisation [70.45873402967297]
  We show that causal inference is NP-hard even in models characterised by polytree-shaped graphs. We introduce the causal EM algorithm to reconstruct the uncertainty about the latent variables from data about categorical manifest variables. We argue that there appears to be an unnoticed limitation to the trending idea that counterfactual bounds can often be computed without knowledge of the structural equations.
  arXiv  Detail & Related papers  (2020-11-04T10:25:13Z)

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.