Iterative conditional fitting for Gaussian ancestral graph models

Authors:
Mathias Drton;Thomas S. Richardson
Affiliations:
University of Washington, Seattle, WA;University of Washington, Seattle, WA
Venue:
UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
Year:
2004

Citing 4
Cited 3

Conditional iterative proportional fitting for Gaussian distributions

Journal of Multivariate Analysis
Normal linear regression models with recursive graphical Markov structure

Journal of Multivariate Analysis
Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference

Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference
A new algorithm for maximum likelihood estimation in gaussian graphical models for marginal independence

UAI'03 Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence

Graphical Methods for Efficient Likelihood Inference in Gaussian Covariance Models

The Journal of Machine Learning Research
On the completeness of orientation rules for causal discovery in the presence of latent confounders and selection bias

Artificial Intelligence
Marginal parameterizations of discrete models defined by a set of conditional independencies

Journal of Multivariate Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

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-known Iterative Proportional Fitting algorithm, in which marginal distributions are fitted while conditional distributions are held fixed.