Number of the records: 1
A reconstruction algorithm for the essential graph
- 1.
SYSNO ASEP 0322545 Document Type J - Journal Article R&D Document Type Journal Article Subsidiary J Článek ve WOS Title A reconstruction algorithm for the essential graph Title Rekonstrukční algoritmus pro esenciální graf Author(s) Studený, Milan (UTIA-B) RID, ORCID
Vomlel, Jiří (UTIA-B) RID, ORCIDSource Title International Journal of Approximate Reasoning. - : Elsevier - ISSN 0888-613X
Roč. 50, č. 2 (2009), s. 385-413Number of pages 28 s. Publication form www - www Language eng - English Country US - United States Keywords Bayesian network structure ; chain graph ; essential graph ; standard imset Subject RIV BA - General Mathematics R&D Projects IAA100750603 GA AV ČR - Academy of Sciences of the Czech Republic (AV ČR) 1M0572 GA MŠMT - Ministry of Education, Youth and Sports (MEYS) GA201/08/0539 GA ČR - Czech Science Foundation (CSF) GA201/04/0393 GA ČR - Czech Science Foundation (CSF) CEZ AV0Z10750506 - UTIA-B (2005-2011) UT WOS 000264359500016 DOI 10.1016/j.ijar.2008.09.001 Annotation 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. Workplace Institute of Information Theory and Automation Contact Markéta Votavová, votavova@utia.cas.cz, Tel.: 266 052 201. Year of Publishing 2014
Number of the records: 1