On Characterizing Inclusion of Bayesian Networks
Abstract
The inclusion problem deals with how to characterize (in graphical terms) whether all independence statements in the model induced by a DAG K are in the model induced by a second DAG L. Meek (1997) conjectured that this inclusion holds iff there exists a sequence of DAGs from L to K such that only certain 'legal' arrow reversal and 'legal' arrow adding operations are performed to get the next DAG in the sequence. In this paper we give several characterizations of inclusion of DAG models and verify Meek's conjecture in the case that the DAGs K and L differ in at most one adjacency. As a warming up a rigorous proof of graphical characterizations of equivalence of DAGs is given.
Cite
Text
Kocka et al. "On Characterizing Inclusion of Bayesian Networks." Conference on Uncertainty in Artificial Intelligence, 2001.Markdown
[Kocka et al. "On Characterizing Inclusion of Bayesian Networks." Conference on Uncertainty in Artificial Intelligence, 2001.](https://mlanthology.org/uai/2001/kocka2001uai-characterizing/)BibTeX
@inproceedings{kocka2001uai-characterizing,
title = {{On Characterizing Inclusion of Bayesian Networks}},
author = {Kocka, Tomás and Bouckaert, Remco R. and Studený, Milan},
booktitle = {Conference on Uncertainty in Artificial Intelligence},
year = {2001},
pages = {261-268},
url = {https://mlanthology.org/uai/2001/kocka2001uai-characterizing/}
}