Abstract
In this paper we consider conditional independence models closed under graphoid properties. We investigate their representation by means of acyclic directed graphs (DAG). A new algorithm to build a DAG, given an ordering among random variables, is described and peculiarities and advantages of this approach are discussed. Finally, some properties ensuring the existence of perfect maps are provided. These conditions can be used to define a procedure able to find a perfect map for some classes of independence models. © 2009 Springer Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Baioletti, M., Busanello, G., & Vantaggi, B. (2009). Acyclic directed graphs to represent conditional independence models. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5590 LNAI, pp. 530–541). https://doi.org/10.1007/978-3-642-02906-6_46
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
