Characterization of inclusion neighbourhood in terms of the essential graph: Lower neighbours

0411182 - UTIA-B 20030169 RIV CZ eng C - Konferenční příspěvek (zahraniční konf.)
Studený, Milan
Characterization of inclusion neighbourhood in terms of the essential graph: Lower neighbours.
Prague: University of Economics, 2003. ISBN 80-245-0546-0. In: Proceedings of the 6th Workshop on Uncertainty Processing. - (Vejnarová, J.), s. 243-262
[WUPES 2003. Workshop on Uncertainty Processing /6./. Hejnice (CZ), 24.09.2003-27.09.2003]
Grant CEP: GA ČR GA201/01/1482
Výzkumný záměr: CEZ:AV0Z1075907
Klíčová slova: essential graph * inclusion neighbourhood * Bayesian network
Kód oboru RIV: BA - Obecná matematika

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.
Trvalý link: http://hdl.handle.net/11104/0131268