On Chain Graph Models For Description Of Conditional Independence Structures

On Chain Graph Models For Description Of Conditional Independence Structures (1998)

Cached

Download Links

[ftp.utia.cas.cz]

by Milan Studeny , Remco R. Bouckaert

Venue:	Ann. Statist
Citations:	16 - 2 self

Versions

Version History

Metadata Version 2

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	On Chain Graph Models For Description Of Conditional Independence Structures	user correction - Legacy Corrections
AUTHOR NAME	Milan Studeny	user correction - Legacy Corrections
AUTHOR NAME	Remco R. Bouckaert	user correction - Legacy Corrections
ABSTRACT	This paper deals with chain graphs (CGs) which allow both directed and undirected edges. This class of graphs, introduced by Lauritzen and Wermuth [15], generalizes both UGs and DAGs. To establish the semantics of CGs one should associate an independency model to every CG. Some steps were already made. Lauritzen and Wermuth [16] intended to use CGs to describe independency models for strictly positive probability distributions and introduced the concept of the chain Markov property which is analogous to the concept of causal input list for DAGs. Lauritzen and Frydenberg [17, 9] generalized the concept of moral graph and introduced a moralization criterion for reading independency statements from a CG. Frydenberg [9] characterized CGs with the same Markov ON CHAIN GRAPH MODELS 3 property (that is producing the same CG-model) and Andersson, Madigan and Perlman [3] used special CGs to represent uniquely classes of Markov equivalent DAGs. Whittaker [31] in his book gave several examples of the use of CGs, and other recent works also deal with them [6, 20, 23, 30], the most comprehensive account is provided by the book [19]. Several results proved here were already presented (without proof) in our previous conference contribution [5]. An alternative approach to the generalization of UGs and DAGs was started by Cox and Wermuth [7] who introduced a wider class of joint-response chain graphs which allow also 'dashed' directed and undirected edges in addition to the classic 'solid' directed and undirected edges treated in this paper. Andersson, Madigan and Perlman [1] introduced an alternative Markov property to give an interpretation to those joint-response CGs which combine dashed directed edges with solid undirected edges (of course, another independency model is associated...	user correction - Legacy Corrections
YEAR	1998	INFERENCE
VENUE	Ann. Statist	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	1434--1495	INFERENCE
VOLUME	26	INFERENCE
CITATIONS	31 found	ParsCit 1.0