Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
An algorithm for deciding if a set of observed independencies has a causal explanation
UAI '92 Proceedings of the eighth conference on Uncertainty in Artificial Intelligence
Chain graphs: semantics and expressiveness
ECSQARU '95 Proceedings of the European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty
Causal networks: semantics and expressiveness
UAI '88 Proceedings of the Fourth Annual Conference on Uncertainty in Artificial Intelligence
UAI '88 Proceedings of the Fourth Annual Conference on Uncertainty in Artificial Intelligence
Equivalence and synthesis of causal models
UAI '90 Proceedings of the Sixth Annual Conference on Uncertainty in Artificial Intelligence
UAI'95 Proceedings of the Eleventh conference on Uncertainty in artificial intelligence
Causal inference and causal explanation with background knowledge
UAI'95 Proceedings of the Eleventh conference on Uncertainty in artificial intelligence
Epistemic irrelevance on sets of desirable gambles
Annals of Mathematics and Artificial Intelligence
A graphical characterization of the largest chain graphs
International Journal of Approximate Reasoning
Bayesian networks from the point of view of chain graphs
UAI'98 Proceedings of the Fourteenth conference on Uncertainty in artificial intelligence
Hi-index | 0.00 |
Chain graphs (CGs) give a natural unifying point of view on Markov and Bayesian networks and enlarge the potential of graphical models for description of conditional independence structures. In the paper a direct graphical separation criterion for CGs which generalizes the d-separation criterion for Bayesian networks is introduced (recalled). It is equivalent to the classic moralization criterion for CGs and complete in the sense that for every CG there exists a probability distribution satisfying exactly independencies derivable from the CG by the separation criterion. Every class of Markov equivalent CGs can be uniquely described by a natural representative, called the largest CG. A recovery algorithm, which on basis of the (conditional) dependency model given by a CG finds the corresponding largest CG, is presented.