Characterizations of Decomposable Dependency Models (Research Note)

Abstract

Decomposable dependency models possess a number of interesting and useful properties. This paper presents new characterizations of decomposable models in terms of independence relationships, which are obtained by adding a single axiom to the well-known set characterizing dependency models that are isomorphic to undirected graphs. We also briefly discuss a potential application of our results to the problem of learning graphical models from data.

Cite

Text

de Campos. "Characterizations of Decomposable Dependency Models (Research Note)." Journal of Artificial Intelligence Research, 1996. doi:10.1613/JAIR.329

Markdown

[de Campos. "Characterizations of Decomposable Dependency Models (Research Note)." Journal of Artificial Intelligence Research, 1996.](https://mlanthology.org/jair/1996/decampos1996jair-characterizations/) doi:10.1613/JAIR.329

BibTeX

@article{decampos1996jair-characterizations,
  title     = {{Characterizations of Decomposable Dependency Models (Research Note)}},
  author    = {de Campos, Luis M.},
  journal   = {Journal of Artificial Intelligence Research},
  year      = {1996},
  pages     = {289-300},
  doi       = {10.1613/JAIR.329},
  volume    = {5},
  url       = {https://mlanthology.org/jair/1996/decampos1996jair-characterizations/}
}