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

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985556%3A_____%2F03%3A16030169" target="_blank" >RIV/67985556:_____/03:16030169 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Characterization of inclusion neighbourhood in terms of the essential graph: Lower neighbours.
Original language description
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.
Czech name
—
Czech description
—

Project
<a href="/en/project/GA201%2F01%2F1482" target="_blank" >GA201/01/1482: Conditional independence structures: information-theoretical approach II</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year
2003
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
Proceedings of the 6th Workshop on Uncertainty Processing.
ISBN
80-245-0546-0
ISSN
—
e-ISSN
—
Number of pages
20
Pages from-to
243-262
Publisher name
University of Economics
Place of publication
Prague
Event location
Hejnice [CZ]
Event date
Sep 24, 2003
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)