Unifying DAGs and UGs
Abstract
We introduce a new class of graphical models that generalizes Lauritzen-Wermuth-Frydenberg chain graphs by relaxing the semi-directed acyclity constraint so that only directed cycles are forbidden. Moreover, up to two edges are allowed between any pair of nodes. Specifically, we present local, pairwise and global Markov properties for the new graphical models and prove their equivalence. We also present an equivalent factorization property.
Cite
Text
Peña. "Unifying DAGs and UGs." Proceedings of the Ninth International Conference on Probabilistic Graphical Models, 2018.Markdown
[Peña. "Unifying DAGs and UGs." Proceedings of the Ninth International Conference on Probabilistic Graphical Models, 2018.](https://mlanthology.org/pgm/2018/pena2018pgm-unifying/)BibTeX
@inproceedings{pena2018pgm-unifying,
title = {{Unifying DAGs and UGs}},
author = {Peña, Jose M.},
booktitle = {Proceedings of the Ninth International Conference on Probabilistic Graphical Models},
year = {2018},
pages = {308-319},
volume = {72},
url = {https://mlanthology.org/pgm/2018/pena2018pgm-unifying/}
}