The representation problem of independence models is studied by focusing on acyclic directed graph (DAG). We present the algorithm PC* in order to look for a perfect map. However, when a perfect map does not exist, so that PC* fails, it is interesting to find a minimal I-map, which represents as many triples as possible in J *. Therefore we describe an algorithm which finds such a map by means of a backtracking procedure. © 2011 Springer-Verlag Berlin Heidelberg.
Finding P-maps and I-maps to represent conditional independencies / Marco, Baioletti; Busanello, Giuseppe; Vantaggi, Barbara. - ELETTRONICO. - 6717 LNAI(2011), pp. 239-250. ((Intervento presentato al convegno 11th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty, ECSQARU 2011 tenutosi a Belfast nel 29 June 2011 through 1 July 2011. - LECTURE NOTES IN COMPUTER SCIENCE. [10.1007/978-3-642-22152-1_21].
Finding P-maps and I-maps to represent conditional independencies
BUSANELLO, GIUSEPPE;VANTAGGI, Barbara
2011
Abstract
The representation problem of independence models is studied by focusing on acyclic directed graph (DAG). We present the algorithm PC* in order to look for a perfect map. However, when a perfect map does not exist, so that PC* fails, it is interesting to find a minimal I-map, which represents as many triples as possible in J *. Therefore we describe an algorithm which finds such a map by means of a backtracking procedure. © 2011 Springer-Verlag Berlin Heidelberg.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
