Original title: Characterization of inclusion neighbourhood in terms of the essential graph: Lower neighbours
Authors: Studený, Milan
Document type: Papers
Conference/Event: WUPES 2003. Workshop on Uncertainty Processing /6./, Hejnice (CZ), 2003-09-24 / 2003-09-27
Year: 2003
Language: eng
Abstract: 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.
Keywords: Bayesian network; essential graph; inclusion neighbourhood
Project no.: CEZ:AV0Z1075907 (CEP), GA201/01/1482 (CEP)
Funding provider: GA ČR
Host item entry: Proceedings of the 6th Workshop on Uncertainty Processing

Institution: Institute of Information Theory and Automation AS ČR (web)
Document availability information: Fulltext is available at the institute of the Academy of Sciences.
Original record: http://hdl.handle.net/11104/0131268

Permalink: http://www.nusl.cz/ntk/nusl-35007


The record appears in these collections:
Research > Institutes ASCR > Institute of Information Theory and Automation
Conference materials > Papers