On a hypergraph probabilistic graphical model
From MaRDI portal
Publication:2023886
Abstract: We propose a directed acyclic hypergraph framework for a probabilistic graphical model that we call Bayesian hypergraphs. The space of directed acyclic hypergraphs is much larger than the space of chain graphs. Hence Bayesian hypergraphs can model much finer factorizations than Bayesian networks or LWF chain graphs and provide simpler and more computationally efficient procedures for factorizations and interventions. Bayesian hypergraphs also allow a modeler to represent causal patterns of interaction such as Noisy-OR graphically (without additional annotations). We introduce global, local and pairwise Markov properties of Bayesian hypergraphs and prove under which conditions they are equivalent. We define a projection operator, called shadow, that maps Bayesian hypergraphs to chain graphs, and show that the Markov properties of a Bayesian hypergraph are equivalent to those of its corresponding chain graph. We extend the causal interpretation of LWF chain graphs to Bayesian hypergraphs and provide corresponding formulas and a graphical criterion for intervention.
Recommendations
Cites work
- scientific article; zbMATH DE number 992990 (Why is no real title available?)
- scientific article; zbMATH DE number 4174001 (Why is no real title available?)
- scientific article; zbMATH DE number 3878159 (Why is no real title available?)
- scientific article; zbMATH DE number 3746162 (Why is no real title available?)
- scientific article; zbMATH DE number 176109 (Why is no real title available?)
- scientific article; zbMATH DE number 1134987 (Why is no real title available?)
- scientific article; zbMATH DE number 4121482 (Why is no real title available?)
- Alternative Markov properties for chain graphs
- An Introduction to Spatial Point Processes and Markov Random Fields
- Ancestral graph Markov models.
- Bayesian Networks and Decision Graphs
- Causal diagrams for empirical research
- Causal inference from graphical models
- Causality. Models, reasoning, and inference
- Causation, prediction, and search
- Chain Graph Models and their Causal Interpretations
- Conditional independence for statistical operations
- Discrete chain graph models
- Factor graphs and the sum-product algorithm
- Graphical and Recursive Models for Contingency Tables
- Graphical models for associations between variables, some of which are qualitative and some quantitative
- Independence properties of directed markov fields
- Joint Response Graphs and Separation Induced by Triangular Systems
- Linear dependencies represented by chain graphs. With comments and a rejoinder by the authors
- Local computation with valuations from a commutative semigroup
- Marginal AMP chain graphs
- Markov Properties for Acyclic Directed Mixed Graphs
- Markov fields and log-linear interaction models for contingency tables
- On the Validity of the Markov Interpretation of Path Diagrams of Gaussian Structural Equations Systems with Correlated Errors
- Two operations of merging and splitting components in a chain graph
Cited in
(2)
This page was built for publication: On a hypergraph probabilistic graphical model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2023886)
