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 Tegnér

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 Tegnér

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-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 language	English
Title of host publication	Proceedings of the 3rd European Workshop on Probabilistic Graphical Models, PGM 2006
Pages	247-254
Number of pages	8
State	Published - 2006
Externally published	Yes
Event	3rd European Workshop on Probabilistic Graphical Models, PGM 2006 - Prague, Czech Republic Duration: 12 Sep 2006 → 15 Sep 2006

Publication series

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

Conference

Conference	3rd European Workshop on Probabilistic Graphical Models, PGM 2006
Country/Territory	Czech Republic
City	Prague
Period	12/09/06 → 15/09/06

Cite this

Peña, J. M., Roland Nilsson, N., Björkegren, J., & Tegnér, J. (2006). Reading dependencies from the minimal undirected independence map of a graphoid that satisfies weak transitivity. In Proceedings of the 3rd European Workshop on Probabilistic Graphical Models, PGM 2006 (pp. 247-254). (Proceedings of the 3rd European Workshop on Probabilistic Graphical Models, PGM 2006).

Peña, Jose M. ; Roland Nilsson, Nilsson ; Björkegren, Johan et al. / Reading dependencies from the minimal undirected independence map of a graphoid that satisfies weak transitivity. Proceedings of the 3rd European Workshop on Probabilistic Graphical Models, PGM 2006. 2006. pp. 247-254 (Proceedings of the 3rd European Workshop on Probabilistic Graphical Models, PGM 2006).

@inproceedings{2fca997f019f48c2a85a0641cbf442fd,

title = "Reading dependencies from the minimal undirected independence map of a graphoid that satisfies weak transitivity",

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.",

author = "Pe{\~n}a, {Jose M.} and {Roland Nilsson}, Nilsson and Johan Bj{\"o}rkegren and Jesper Tegn{\'e}r",

year = "2006",

language = "English",

isbn = "8086742148",

series = "Proceedings of the 3rd European Workshop on Probabilistic Graphical Models, PGM 2006",

pages = "247--254",

booktitle = "Proceedings of the 3rd European Workshop on Probabilistic Graphical Models, PGM 2006",

note = "3rd European Workshop on Probabilistic Graphical Models, PGM 2006 ; Conference date: 12-09-2006 Through 15-09-2006",

}

Peña, JM, Roland Nilsson, N, Björkegren, J & Tegnér, J 2006, Reading dependencies from the minimal undirected independence map of a graphoid that satisfies weak transitivity. in Proceedings of the 3rd European Workshop on Probabilistic Graphical Models, PGM 2006. Proceedings of the 3rd European Workshop on Probabilistic Graphical Models, PGM 2006, pp. 247-254, 3rd European Workshop on Probabilistic Graphical Models, PGM 2006, Prague, Czech Republic, 12/09/06.

Reading dependencies from the minimal undirected independence map of a graphoid that satisfies weak transitivity. / Peña, Jose M.; Roland Nilsson, Nilsson; Björkegren, Johan et al.
Proceedings of the 3rd European Workshop on Probabilistic Graphical Models, PGM 2006. 2006. p. 247-254 (Proceedings of the 3rd European Workshop on Probabilistic Graphical Models, PGM 2006).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

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

AU - Peña, Jose M.

AU - Roland Nilsson, Nilsson

AU - Björkegren, Johan

AU - Tegnér, Jesper

PY - 2006

Y1 - 2006

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=47249108644&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:47249108644

SN - 8086742148

SN - 9788086742144

T3 - Proceedings of the 3rd European Workshop on Probabilistic Graphical Models, PGM 2006

SP - 247

EP - 254

BT - Proceedings of the 3rd European Workshop on Probabilistic Graphical Models, PGM 2006

T2 - 3rd European Workshop on Probabilistic Graphical Models, PGM 2006

Y2 - 12 September 2006 through 15 September 2006

ER -

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

Abstract

Publication series

Conference

Fingerprint

Cite this