On a hypergraph probabilistic graphical model

From MaRDI portal
Publication:2023886

DOI10.1007/S10472-020-09701-7zbMATH Open1465.62112arXiv1811.08372OpenAlexW3040946540MaRDI QIDQ2023886FDOQ2023886


Authors: Mohammad Ali Javidian, Zhiyu Wang, Linyuan Lu, Marco Valtorta Edit this on Wikidata


Publication date: 3 May 2021

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1811.08372




Recommendations




Cites Work


Cited In (2)

Uses Software





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)