| bibtype |
J -
Journal Article
|
| ARLID |
0322545 |
| utime |
20240111140716.9 |
| mtime |
20090326235959.9 |
| WOS |
000264359500016 |
| DOI |
10.1016/j.ijar.2008.09.001 |
| title
(primary) (eng) |
A reconstruction algorithm for the essential graph |
| specification |
| page_count |
28 s. |
| media_type |
www |
|
| serial |
| ARLID |
cav_un_epca*0256774 |
| ISSN |
0888-613X |
| title
|
International Journal of Approximate Reasoning |
| volume_id |
50 |
| volume |
2 (2009) |
| page_num |
385-413 |
| publisher |
|
|
| title
(cze) |
Rekonstrukční algoritmus pro esenciální graf |
| keyword |
Bayesian network structure |
| keyword |
chain graph |
| keyword |
essential graph |
| keyword |
standard imset |
| author
(primary) |
| ARLID |
cav_un_auth*0101202 |
| full_dept |
Department of Decision Making Theory |
| name1 |
Studený |
| name2 |
Milan |
| institution |
UTIA-B |
| fullinstit |
Ústav teorie informace a automatizace AV ČR, v. v. i. |
|
| author
|
| ARLID |
cav_un_auth*0101228 |
| full_dept |
Department of Decision Making Theory |
| name1 |
Vomlel |
| name2 |
Jiří |
| institution |
UTIA-B |
| fullinstit |
Ústav teorie informace a automatizace AV ČR, v. v. i. |
|
| source |
|
| cas_special |
| project |
| ARLID |
cav_un_auth*0216427 |
| project_id |
IAA100750603 |
| agency |
GA AV ČR |
| country |
CZ |
|
| project |
| ARLID |
cav_un_auth*0001814 |
| project_id |
1M0572 |
| agency |
GA MŠk |
|
| project |
| ARLID |
cav_un_auth*0239648 |
| project_id |
GA201/08/0539 |
| agency |
GA ČR |
|
| project |
| ARLID |
cav_un_auth*0001808 |
| project_id |
GA201/04/0393 |
| agency |
GA ČR |
|
| research |
CEZ:AV0Z10750506 |
| abstract
(eng) |
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. |
| abstract
(cze) |
Stadardní grafický representant struktury Bayesovké sítě je speciální řetězcový graf, nazývaný esenciální graf. Alternativní algebraický přístup k matematickému popisu tohoto statistického modelu namísto toho používá jistý celočíselný vektor, nazývaný stadardní imset. Uvádíme přímý vzorec pro překlad jakéhokoliv řetězcového grafu popisující strukturu Bayesovké sítě do standardního imsetu. Navíc, navrhujeme dvojfázový algoritmus který umožnuje rekonstruovat esenciální graf na základě standardního imsetu. Podstatou článku je důkaz korektnosti tohoto algoritmu. |
| RIV |
BA |
| reportyear |
2014 |
| permalink |
http://hdl.handle.net/11104/0170769 |
| mrcbT16-f |
2.248 |
| mrcbT16-g |
0.275 |
| mrcbT16-h |
6.6 |
| mrcbT16-i |
0.00422 |
| mrcbT16-j |
0.606 |
| mrcbT16-k |
1686 |
| mrcbT16-l |
109 |
| arlyear |
2009 |
| mrcbU34 |
000264359500016 WOS |
| mrcbU56 |
pdf |
| mrcbU63 |
cav_un_epca*0256774 International Journal of Approximate Reasoning 0888-613X 1873-4731 Roč. 50 č. 2 2009 385 413 Elsevier |
|