An Alternative Markov Property for Chain Graphs
arXiv (Cornell University)Published 13 February 2013Open access
Steen A. Andersson, David Madigan, Michael D. Perlman
Citations45
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
An alternative Markov property (AMP) for chain graphs is introduced, which in some ways is a more direct extension of the ADG Markovproperty than is the LWF property for chain graph.
Abstract
Graphical Markov models use graphs, either undirected, directed, or mixed, to represent possible dependences among statistical variables. Applications of undirected graphs (UDGs) include models for spatial dependence and image analysis, while acyclic directed graphs (ADGs), which are especially convenient for statistical analysis, arise in such fields as genetics and psychometrics and as models for expert systems and Bayesian belief networks. Lauritzen, Wermuth and Frydenberg (LWF) introduced a Markov property for chain graphs, which are mixed graphs that can be used to represent simultaneously both causal and associative dependencies and which include both UDGs and ADGs as special cases. In this paper an alternative Markov property (AMP) for chain graphs is introduced, which in some ways is a more direct extension of the ADG Markov property than is the LWF property for chain graph.
Keywords
Computer Science
Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference
16,927 Citations1988Judea Pearl
The author provides a coherent explication of probability as a language for reasoning with partial belief and offers a unifying perspective on other AI approaches to uncertainty, such as the Dempster-Shafer formalism, truth maintenance systems, and nonmonotonic logic.
Journal of the Royal Statistical Society Series B (Statistical Methodology)Local Computations with Probabilities on Graphical Structures and Their Application to Expert Systems
3,970 Citations1988Steffen L. Lauritzen, David J. Spiegelhalter
This work exploits a range of local representations for the joint probability distribution, combined with topological changes to the original network termed 'marrying' and 'filling-in', which allows efficient algorithms for transfer between representations, providing rapid absorption and propagation of evidence.
TechnometricsGraphical Models in Applied Multivariate Statistics
1,827 Citations1991Colin Goodall, Joe Whittaker
Statistical ScienceBayesian Analysis in Expert Systems
687 Citations1993David Spiegelhalter, A. P. Dawid +2 more
Using a real, moderately complex, medical example, it is illustrated how qualitative and quantitative knowledge can be represented within a directed graphical model, generally known as a belief network in this context.
The Annals of StatisticsGraphical Models for Associations between Variables, some of which are Qualitative and some Quantitative
673 Citations1989Steffen L. Lauritzen, Nanny Wermuth
NetworksIndependence properties of directed markov fields
521 Citations1990Steffen L. Lauritzen, A. P. Dawid +2 more
A criterion for conditional independence of two groups of variables given a third is given and named as the directed, global Markov property and it is argued that this criterion is easy to use, it is sharper than that given by Kiiveri, Speed, and Carlin and equivalent to that of Pearl.
BiometricsMultivariate Dependencies: Models, Analysis and Interpretation.
492 Citations1998Susan A. Murphy, D. R. Cox +1 more
The Annals of StatisticsHyper Markov Laws in the Statistical Analysis of Decomposable Graphical Models
475 Citations1993A. P. Dawid, Steffen L. Lauritzen
Management ScienceGaussian Influence Diagrams
316 Citations1989Ross D. Shachter, C. Robert Kenley
This paper develops the framework for assessment and analysis of linear-quadratic-Gaussian models within the influence diagram representation, and provides algorithms to translate between the Gaussian influence diagram and covariance matrix representations for the normal distribution.
Statistical ScienceLinear Dependencies Represented by Chain Graphs
257 Citations1993D. R. Cox, Nanny Wermuth
Journal of the Royal Statistical Society Series B (Statistical Methodology)On Substantive Research Hypotheses, Conditional Independence Graphs and Graphical Chain Models
225 Citations1990Nanny Wermuth, Steffen L. Lauritzen
The Annals of StatisticsConditional Independence for Statistical Operations
150 Citations1980A. P. Dawid
arXiv (Cornell University)Directed Cyclic Graphical Representations of Feedback Models
143 Citations2013Peter Spirtes
For linear systems associated with DCGs with independent errors, a characterisation of conditional independence constraints is obtained, and it is shown that the result generalizes in a natural way to systems in which the error variables or noises are statistically dependent.
Communication in Statistics- Theory and MethodsBayesian model averaging and model selection for markov equivalence classes of acyclic digraphs
121 Citations1996David Madigan, Steen A. Andersson +2 more
Acyclic digraphs are widely used to describe dependences among variables in multivariate distributions, and recent results have shown that each Markov-equivalence class is uniquely determined by a single chain graph, the essential graph, that is itself MarkOV-equivalent simultaneously to all ADGs in the equivalence class.
The Annals of StatisticsMarkov properties of nonrecursive causal models
110 Citations1996Jan T. A. Koster
arXiv (Cornell University)Chain Graphs for Learning
51 Citations2013Wray Buntine
This paper gives a simplified definition of chain graphs based on a hierarchical combination of Bayesian (directed) and Markov (undirected) networks so that samples and data analysis problems can be represented in a graphical model as well.
Computational Statistics & Data AnalysisBIFROST — Block recursive models induced from relevant knowledge, observations, and statistical techniques
44 Citations1995Søren Højsgaard, Bo Thiesson
The theoretical background for a program for establishing expert systems on the basis of observations and expert knowledge and various model selection methods for automatic model selection are presented.
Lecture notes in computer scienceChain graphs: Semantics and expressiveness
23 Citations1995Remco Bouckaert, Milan Studený
A chain graph (CG) is a graph admitting both directed and undirected edges with forbidden directed cycles and can be used efficiently to store graphoids obeying a set of five properties (axioms).
Probability in the Engineering and Informational SciencesA Note on Equivalence Classes of Directed Acyclic Independence Graphs
7 Citations1993David Madigan
It is shown that DAIGs can usefully be grouped into equivalence classes where the members of a single class share identical Markov properties.