We provide a necessary and sufficient condition for the existence of a perfect map representing a conditional independence model. Then we describe a backtracking efficient algorithm for checking this condition and drawing a perfect map, when it exists.
An algorithm to find a perfect map for graphoid structures
BAIOLETTI, Marco;BUSANELLO, GIUSEPPE;
2010
Abstract
We provide a necessary and sufficient condition for the existence of a perfect map representing a conditional independence model. Then we describe a backtracking efficient algorithm for checking this condition and drawing a perfect map, when it exists.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
