The Graphical Condition for Identifying Arrows in Recovering Causal Structure
نویسندگان
چکیده
This paper deals with problems of recovering a causal structure by using not only conditional independence relationships but also prior knowledge when data are generated according to the causal structure among variables. Although some algorithms for recovering a causal structure based on independencies have been developed, the influence of prior knowledge on the recovery algorithms has not been clarified. In this paper, a necessary and sufficient condition for the existence of unidentified arrows in a recovered diagram is given in terms of graph structure. Also, it is shown that a causal structure such that a recovered diagram is a forest can be recovered by recognizing exogenous variables in a causal diagram completely. The result enables us to elucidate enough prior information to determine a causal diagram uniquely.
منابع مشابه
Graphical Models for Recovering Probabilistic and Causal Queries from Missing Data
We address the problem of deciding whether a causal or probabilistic query is estimable from data corrupted by missing entries, given a model of missingness process. We extend the results of Mohan et al. [2013] by presenting more general conditions for recovering probabilistic queries of the form P (y|x) and P (y, x) as well as causal queries of the form P (y|do(x)). We show that causal queries...
متن کاملRecovering from Selection Bias in Causal and Statistical Inference
Selection bias is caused by preferential exclusion of units from the samples and represents a major obstacle to valid causal and statistical inferences; it cannot be removed by randomized experiments and can rarely be detected in either experimental or observational studies. In this paper, we provide complete graphical and algorithmic conditions for recovering conditional probabilities from sel...
متن کاملCausal commutative arrows
Arrows are a popular form of abstract computation. Being more general than monads, they are more broadly applicable, and, in particular, are a good abstraction for signal processing and dataflow computations. Most notably, arrows form the basis for a domain-specific language called Yampa, which has been used in a variety of concrete applications, including animation, robotics, sound synthesis, ...
متن کاملLearning Bayesian Network Structure using Markov Blanket in K2 Algorithm
A Bayesian network is a graphical model that represents a set of random variables and their causal relationship via a Directed Acyclic Graph (DAG). There are basically two methods used for learning Bayesian network: parameter-learning and structure-learning. One of the most effective structure-learning methods is K2 algorithm. Because the performance of the K2 algorithm depends on node...
متن کاملFoundations for Bayesian Networks
structures, 3accidentally correlated, 6adding-arrows, 36ancestrally, 31atomic states, 37 background knowledge, 26Bayesian network, 2Bayesian Networks Maximise En-tropy, 30 causal extension, 6causal irrelevance, 28causal Markov condition, 1, 3causal restriction, 8, 9conditional mutual information, 40constrained network, 40correlation restrictio...
متن کامل