Characterization of essential graphs by means of an operation of legal component merging.
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985556%3A_____%2F02%3A16020195" target="_blank" >RIV/67985556:_____/02:16020195 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Characterization of essential graphs by means of an operation of legal component merging.
Original language description
The essential graph is known as a representative of an equivalence class of Bayesian networks. In the contribution an alternative characterization of essential graphs is presented. The characterization is based on a special operation with chain graphs without flags which is called the legal component merging. The operation leads to an algorithm for finding the essential graph on basis of any graph in the equivalence class of chain graphs without flags, in particular on basis of any Bayesian network.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2002
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the First European Workshop on Probabilistic Graphical Models.
ISBN
—
ISSN
—
e-ISSN
—
Number of pages
8
Pages from-to
161-168
Publisher name
University of Castilla
Place of publication
Cuenca
Event location
Cuenca [ES]
Event date
Nov 6, 2002
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—