bibtype C - Conference Paper (international conference)
ARLID 0410981
utime 20240103182253.4
mtime 20060210235959.9
title (primary) (eng) Characterization of essential graphs by means of an operation of legal component merging
publisher
place Cuenca
name University of Castilla
pub_time 2002
specification
page_count 8 s.
serial
title Proceedings of the First European Workshop on Probabilistic Graphical Models
page_num 161-168
editor
name1 Gamez
name2 J. A.
editor
name1 Salmeron
name2 A.
keyword essential graphs
keyword chain graphs without flags
keyword legal merging
author (primary)
ARLID cav_un_auth*0101202
name1 Studený
name2 Milan
institution UTIA-B
full_dept Department of Decision Making Theory
fullinstit Ústav teorie informace a automatizace AV ČR, v. v. i.
COSATI 12A
cas_special
project
project_id GA201/01/1482
agency GA ČR
ARLID cav_un_auth*0005723
project
project_id IAA1075104
agency GA AV ČR
ARLID cav_un_auth*0001799
research CEZ:AV0Z1075907
abstract (eng) 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.
action
ARLID cav_un_auth*0212985
name European Workshop on Probabilistic Graphical Models /1./ PGM'02
place Cuenca
country ES
dates 06.11.2002-08.11.2002
RIV BA
department MTR
permalink http://hdl.handle.net/11104/0131068
ID_orig UTIA-B 20020195
arlyear 2002
mrcbU10 2002
mrcbU10 Cuenca University of Castilla
mrcbU63 Proceedings of the First European Workshop on Probabilistic Graphical Models 161 168
mrcbU67 Gamez J. A. 340
mrcbU67 Salmeron A. 340