- Aktuality
- Předmět a cíle výzkumu
- Rada Centra a výroční zprávy
- Pracoviště a kontakty
- Přednášky
- Konference a semináře
- Publikace
- Ukázky aplikací
- Zahraniční cesty
- Hosté centra
- Minulé události
- Vstup do Synergy
VYHLEDÁVÁNÍ
PRACOVIŠTĚ CENTRA
Výzkumné centrum
Data - Algoritmy - Rozhodování
Data - Algoritmy - Rozhodování
Založeno v roce 2005 s podporou MŠMT ČR (projekt 1M0572)
Přednášky
On Markov Equivalence of Chain Graphs.
Přednášející:
Alberto Roverato (Univ. of Modena and Reggio Emilia)
Od:
Apr. 19 2005 2:00PM
Do:
Apr. 19 2005 3:30PM
Místo:
ÚTIA AV ČR
Popis:
souhrn:
A Markov property associates a set of conditional independencies to a graph. Two alternative Markov properties are available for chain graphs, the LWF and the AMP Markov property, which are different in general but coincide for the subclass of chain graphs with no flags. Markov equivalence induces partition of the class of chain graphs into equivalence classes. We consider the problem of the graphical characterization of equivalence classes of chain graphs by means of a suitable representative and, in particular, provide an unified approach to the problem that encompasses several existing results, providing in this way a unified view to the subject.
A Markov property associates a set of conditional independencies to a graph. Two alternative Markov properties are available for chain graphs, the LWF and the AMP Markov property, which are different in general but coincide for the subclass of chain graphs with no flags. Markov equivalence induces partition of the class of chain graphs into equivalence classes. We consider the problem of the graphical characterization of equivalence classes of chain graphs by means of a suitable representative and, in particular, provide an unified approach to the problem that encompasses several existing results, providing in this way a unified view to the subject.
Kontaktní osoba:
V rámci akce:
Pravidelný seminář Inteligentní systémy (Kontaktní osoba: Tomáš Kroupa)