Optimal decomposition by clique separators
Discrete Mathematics
On the effective implementation of the iterative proportional fitting procedure
Computational Statistics & Data Analysis - Special issue dedicated to Toma´sˇ Havra´nek
Algorithm 457: finding all cliques of an undirected graph
Communications of the ACM
An implementation of the iterative proportional fitting procedure by propagation trees
Computational Statistics & Data Analysis
Probabilistic Networks and Expert Systems
Probabilistic Networks and Expert Systems
Optimal decomposition of belief networks
UAI '90 Proceedings of the Sixth Annual Conference on Uncertainty in Artificial Intelligence
Modeling and Reasoning with Bayesian Networks
Modeling and Reasoning with Bayesian Networks
UAI'94 Proceedings of the Tenth international conference on Uncertainty in artificial intelligence
Hi-index | 0.00 |
In this paper, we propose an improved iterative proportional scaling procedure for maximum likelihood estimation for multivariate Gaussian graphical models. Our proposed procedure allows us to share computations when adjusting different clique marginals on junction trees. This makes our procedure more efficient than existing procedures for maximum likelihood estimation for multivariate Gaussian graphical models. Some numerical experiments are conducted to illustrate the efficiency of our proposed procedure for maximum likelihood estimation of Gaussian graphical models with the number of variables up to the two thousands. We also demonstrate our proposed procedures by two genetic examples.