We deal with conditional independencies, which have a fundamental role in probability and multivariate statistics. The structure of probabilistic independencies is described by semigraphoids or, for strictly positive probabilities, by graphoids. In this paper, given a set of independencies compatible with a probability, the attention is focused toward the problem of computing efficiently the closure with respect to the semigraphoid and graphoid structures. We introduce a suitable notion of projection in order to provide a new method which properly uses conditional independence statements. (C) 2010 Elsevier Inc. All rights reserved.
Exploiting independencies to compute semigraphoid and graphoid structures / Marco, Baioletti; Busanello, Giuseppe; Vantaggi, Barbara. - In: INTERNATIONAL JOURNAL OF APPROXIMATE REASONING. - ISSN 0888-613X. - STAMPA. - 52:5(2011), pp. 565-579. (Intervento presentato al convegno 8th Workshop on Uncertainty Processing (WUPES 09) tenutosi a Liblice, CZECH REPUBLIC nel 2009) [10.1016/j.ijar.2010.11.001].
Exploiting independencies to compute semigraphoid and graphoid structures
BUSANELLO, GIUSEPPE;VANTAGGI, Barbara
2011
Abstract
We deal with conditional independencies, which have a fundamental role in probability and multivariate statistics. The structure of probabilistic independencies is described by semigraphoids or, for strictly positive probabilities, by graphoids. In this paper, given a set of independencies compatible with a probability, the attention is focused toward the problem of computing efficiently the closure with respect to the semigraphoid and graphoid structures. We introduce a suitable notion of projection in order to provide a new method which properly uses conditional independence statements. (C) 2010 Elsevier Inc. All rights reserved.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
