| bibtype |
C -
Conference Paper (international conference)
|
| ARLID |
0411182 |
| utime |
20240103182307.9 |
| mtime |
20060210235959.9 |
| ISBN |
80-245-0546-0 |
| title
(primary) (eng) |
Characterization of inclusion neighbourhood in terms of the essential graph: Lower neighbours |
| publisher |
| place |
Prague |
| name |
University of Economics |
| pub_time |
2003 |
|
| specification |
|
| serial |
| title
|
Proceedings of the 6th Workshop on Uncertainty Processing |
| page_num |
243-262 |
| editor |
|
|
| keyword |
essential graph |
| keyword |
inclusion neighbourhood |
| keyword |
Bayesian network |
| author
(primary) |
| ARLID |
cav_un_auth*0101202 |
| name1 |
Studený |
| name2 |
Milan |
| institution |
UTIA-B |
| full_dept |
Department of Decision Making Theory |
| fullinstit |
Ústav teorie informace a automatizace AV ČR, v. v. i. |
|
| COSATI |
12A |
| cas_special |
| project |
| project_id |
GA201/01/1482 |
| agency |
GA ČR |
| ARLID |
cav_un_auth*0005723 |
|
| research |
CEZ:AV0Z1075907 |
| abstract
(eng) |
The topic of the paper is to characterize inclusion neighbourhood of a given equivalence class of Bayesian networks in terms of the respective essential graph. It is shown that every inclusion neighbour is uniquely described by a pair ([a,b],C) where [a,b] is a pair of distict nodes which is not an edge and C is a disjoint set of nodes. Given such [a,b] the collection of respective sets C is the union of two tufts. The least and maximal sets of these tufts can be read from the essential graph. |
| action |
| ARLID |
cav_un_auth*0213068 |
| name |
WUPES 2003. Workshop on Uncertainty Processing /6./ |
| place |
Hejnice |
| country |
CZ |
| dates |
24.09.2003-27.09.2003 |
|
| RIV |
BA |
| department |
MTR |
| permalink |
http://hdl.handle.net/11104/0131268 |
| ID_orig |
UTIA-B 20030169 |
| arlyear |
2003 |
| mrcbU10 |
2003 |
| mrcbU10 |
Prague University of Economics |
| mrcbU12 |
80-245-0546-0 |
| mrcbU63 |
Proceedings of the 6th Workshop on Uncertainty Processing 243 262 |
| mrcbU67 |
Vejnarová J. 340 |
|