Reading dependencies from the minimal undirected independence map of a graphoid that satisfies weak transitivity

Jose M. Peña*, Nilsson Roland Nilsson, Johan Björkegren, Jesper Tegner

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Scopus citations

Abstract

We present a sound and complete graphical criterion for reading dependencies from the minimal undirected independence map of a graphoid that satisfies weak transitivity. We argue that assuming weak transitivity is not too restrictive.

Original languageEnglish (US)
Title of host publicationProceedings of the 3rd European Workshop on Probabilistic Graphical Models, PGM 2006
Pages247-254
Number of pages8
StatePublished - Dec 1 2006
Event3rd European Workshop on Probabilistic Graphical Models, PGM 2006 - Prague, Czech Republic
Duration: Sep 12 2006Sep 15 2006

Publication series

NameProceedings of the 3rd European Workshop on Probabilistic Graphical Models, PGM 2006

Other

Other3rd European Workshop on Probabilistic Graphical Models, PGM 2006
CountryCzech Republic
CityPrague
Period09/12/0609/15/06

ASJC Scopus subject areas

  • Statistics and Probability

Fingerprint

Dive into the research topics of 'Reading dependencies from the minimal undirected independence map of a graphoid that satisfies weak transitivity'. Together they form a unique fingerprint.

Cite this