Sciweavers

Share
UAI
2004

Iterative Conditional Fitting for Gaussian Ancestral Graph Models

11 years 6 months ago
Iterative Conditional Fitting for Gaussian Ancestral Graph Models
Ancestral graph models, introduced by Richardson and Spirtes (2002), generalize both Markov random fields and Bayesian networks to a class of graphs with a global Markov property that is closed under conditioning and marginalization. By design, ancestral graphs encode precisely the conditional independence structures that can arise from Bayesian networks with selection and unobserved (hidden/latent) variables. Thus, ancestral graph models provide a potentially very useful framework for exploratory model selection when unobserved variables might be involved in the data-generating process but no particular hidden structure can be specified. In this paper, we present the Iterative Conditional Fitting (ICF) algorithm for maximum likelihood estimation in Gaussian ancestral graph models. The name reflects that in each step of the procedure a conditional distribution is estimated, subject to constraints, while a marginal distribution is held fixed. This approach is in duality to the well-kno...
Mathias Drton, Thomas S. Richardson
Added 31 Oct 2010
Updated 31 Oct 2010
Type Conference
Year 2004
Where UAI
Authors Mathias Drton, Thomas S. Richardson
Comments (0)
books