Please use this identifier to cite or link to this item:
|Title:||Towards characterizing Markov equivalence classes for directed acyclic graphs with latent variables|
|Authors:||Ali, R.A. |
Maximal ancestral graph
|Citation:||Ali, R.A.,Richardson, T.S.,Spirtes, P.,Zhang, J. (2005). Towards characterizing Markov equivalence classes for directed acyclic graphs with latent variables. Proceedings of the 21st Conference on Uncertainty in Artificial Intelligence, UAI 2005 : 10-17. ScholarBank@NUS Repository.|
|Abstract:||It is well known that there may be many causal explanations that are consistent with a given set of data. Recent work has been done to represent the common aspects of these explanations into one representation. In this paper, we address what is less well known: how do the relationships common to every causal explanation among the observed variables of some DAG process change in the presence of latent variables? Ancestral graphs provide a class of graphs that can encode conditional independence relations that arise in DAG models with latent and selection variables. In this paper we present a set of orientation rules that construct the Markov equivalence class representative for ancestral graphs, given a member of the equivalence class. These rules are sound and complete. We also show that when the equivalence class includes a DAG, the equivalence class representative is the essential graph for the said DAG.|
|Source Title:||Proceedings of the 21st Conference on Uncertainty in Artificial Intelligence, UAI 2005|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Sep 21, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.