0411182 20240103182307.920060210235959.9 80-245-0546-0 Prague University of Economics 2003 20 s. 243-262VejnarováJ. essential graph inclusion neighbourhood Bayesian network cav_un_auth*0101202 Studený Milan UTIA-B Department of Decision Making Theory Ústav teorie informace a automatizace AV ČR, v. v. i. 12A GA201/01/1482 GA ČR cav_un_auth*0005723 CEZ:AV0Z1075907 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. cav_un_auth*0213068 WUPES 2003. Workshop on Uncertainty Processing /6./ Hejnice CZ 24.09.2003-27.09.2003 BA MTR http://hdl.handle.net/11104/0131268 UTIA-B 20030169 2003 2003 Prague University of Economics 80-245-0546-0 Proceedings of the 6th Workshop on Uncertainty Processing 243 262 Vejnarová J. 340