Založeno v roce 2005 s podporou MŠMT ČR (projekt 1M0572)

Publikace

A reconstruction algorithm for the essential graph

Typ:
Článek v odborném periodiku
Autoři publikace:
Název periodika:
International Journal of Approximate Reasoning
Rok:
2009
Číslo:
2 (2009)
Strany:
385-413
ISSN:
0888-613X
Klíčová slova:
Bayesian network structure, chain graph, essential graph, st
Anotace:
A standard graphical representative of a Bayesian network structure is a special chain graphs, known as an essential graph. An alternative algebraic approach to the mathematical description of this statistical model uses instead a certain integer-valued vector, known as a standard imset. We give a direct formula for the translation of any chain graph describing a Bayesian network structure into the standard imset. Moreover, we present a two-stage algorithm which makes it possible to reconstruct the essential graph on the basis of the standard imset. The core of the paper is the proof of correctness of the algorithm.
 
Copyright 2005 DAR XHTML CSS