ANCESTRAL GRAPH MARKOV MODELS

ANCESTRAL GRAPH MARKOV MODELS (2002)

by Thomas Richardson , Peter Spirtes

Citations:

58 - 16 self

User correction supplied by mph

Datum	Value	Source
TITLE	ANCESTRAL GRAPH MARKOV MODELS	user correction
AUTHOR NAME	Thomas Richardson	user correction
AUTHOR AFFIL	University of Washington and Carnegie Mellon University	user correction
AUTHOR NAME	Peter Spirtes	user correction
AUTHOR AFFIL	University of Washington and Carnegie Mellon University	user correction
ABSTRACT	This paper introduces a class of graphical independence models that is closed under marginalization and conditioning but that contains all DAG independence models. This class of graphs, called maximal ancestral graphs, has two attractive features: there is at most one edge between each pair of vertices; every missing edge corresponds to an independence relation. These features lead to a simple parameterization of the corresponding set of distributions in the Gaussian case.	user correction
YEAR	2002	user correction
CITATIONS	44 found	ParsCit 1.0