Characterizations of Decomposable Dependency Models
人工智能
2014-11-17 v1
摘要
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.
引用
@article{arxiv.cs/9612103,
title = {Characterizations of Decomposable Dependency Models},
author = {L. M. deCampos},
journal= {arXiv preprint arXiv:cs/9612103},
year = {2014}
}
备注
See http://www.jair.org/ for any accompanying files