In this paper we study the problem of representing probabilistic independence models, in particular those closed under graphoid properties. We focus on acyclic directed graph (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. Moreover, we provide a necessary and sufficient condition for the existence of a perfect map representing an independence model and we describe an algorithm based on this characterization. (C) 2010 Elsevier Inc. All rights reserved.
Acyclic directed graphs representing independence models / Marco, Baioletti; Giuseppe, Busanello; Vantaggi, Barbara. - In: INTERNATIONAL JOURNAL OF APPROXIMATE REASONING. - ISSN 0888-613X. - STAMPA. - 52:1(2011), pp. 2-18. (Intervento presentato al convegno 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty tenutosi a Verona, ITALY nel JUL 01-03, 2009) [10.1016/j.ijar.2010.09.005].
Acyclic directed graphs representing independence models
VANTAGGI, Barbara
2011
Abstract
In this paper we study the problem of representing probabilistic independence models, in particular those closed under graphoid properties. We focus on acyclic directed graph (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. Moreover, we provide a necessary and sufficient condition for the existence of a perfect map representing an independence model and we describe an algorithm based on this characterization. (C) 2010 Elsevier Inc. All rights reserved.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
