Every LWF and AMP Chain Graph Originates from a Set of Causal Models
2015 (English)In: SYMBOLIC AND QUANTITATIVE APPROACHES TO REASONING WITH UNCERTAINTY, ECSQARU 2015, SPRINGER-VERLAG BERLIN , 2015, Vol. 9161, 325-334 p.Conference paper (Refereed)Text
This paper aims at justifying LWF and AMP chain graphs by showing that they do not represent arbitrary independence models. Specifically, we show that every chain graph is inclusion optimal wrt the intersection of the independence models represented by a set of directed and acyclic graphs under conditioning. This implies that the independence model represented by the chain graph can be accounted for by a set of causal models that are subject to selection bias, which in turn can be accounted for by a system that switches between different regimes or configurations.
Place, publisher, year, edition, pages
SPRINGER-VERLAG BERLIN , 2015. Vol. 9161, 325-334 p.
Lecture Notes in Computer Science, ISSN 0302-9743 (print), 1611-3349 (online) ; 9161
Computer and Information Science
IdentifiersURN: urn:nbn:se:liu:diva-123537DOI: 10.1007/978-3-319-20807-7_29ISI: 000364847800029ISBN: 978-3-319-20807-7; 978-3-319-20806-0OAI: oai:DiVA.org:liu-123537DiVA: diva2:886133
13th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU)