Redirigiendo al acceso original de articulo en 21 segundos...
Inicio  /  Algorithms  /  Vol: 17 Par: 3 (2024)  /  Artículo
ARTÍCULO
TITULO

What Is a Causal Graph?

Philip Dawid    

Resumen

This article surveys the variety of ways in which a directed acyclic graph (DAG) can be used to represent a problem of probabilistic causality. For each of these ways, we describe the relevant formal or informal semantics governing that representation. It is suggested that the cleanest such representation is that embodied in an augmented DAG, which contains nodes for non-stochastic intervention indicators in addition to the usual nodes for domain variables.