A reconstruction algorithm for the essential graph

A standard graphical representative of a Bayesian network structure is a special chain graph, 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 di...

Full description

Saved in:
Bibliographic Details
Published in:International journal of approximate reasoning 2009-02, Vol.50 (2), p.385-413
Main Authors: Studený, Milan, Vomlel, Jiří
Format: Article
Language:English
Subjects:
Applied sciences
Artificial intelligence
Bayesian network structure
Chain graph
Computer science
control theory
systems
Essential graph
Exact sciences and technology
Learning and adaptive systems
Standard imset
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A standard graphical representative of a Bayesian network structure is a special chain graph, 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 this paper is the proof of the correctness of the algorithm.
ISSN:0888-613X
1873-4731
DOI:10.1016/j.ijar.2008.09.001