An improved Hara-Takamura procedure by sharing computations on junction tree in Gaussian graphical models
From MaRDI portal
Publication:693348
DOI10.1007/s11222-011-9286-4zbMath1252.62060OpenAlexW2081486278MaRDI QIDQ693348
Jian-hua Guo, Ping-feng Xu, Man-Lai Tang
Publication date: 7 December 2012
Published in: Statistics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11222-011-9286-4
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
Local computations of the iterative proportional scaling procedure for hierarchical models ⋮ Multiplicity adjustment for temporal and spatial scan statistics using Markov property
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the effective implementation of the iterative proportional fitting procedure
- Gaussian Markov distributions over finite graphs
- An implementation of the iterative proportional fitting procedure by propagation trees.
- Maximum cardinality search for computing minimal triangulations of graphs
- Optimal decomposition by clique separators
- A Localization Approach to Improve Iterative Proportional Scaling in Gaussian Graphical Models
- Modeling and Reasoning with Bayesian Networks
- Probabilistic Networks and Expert Systems
- Partial Correlation Estimation by Joint Sparse Regression Models
- An Iterative Procedure for Estimation in Contingency Tables
- Generalized Iterative Scaling for Log-Linear Models
- Algorithm 457: finding all cliques of an undirected graph
- On a Least Squares Adjustment of a Sampled Frequency Table When the Expected Marginal Totals are Known
This page was built for publication: An improved Hara-Takamura procedure by sharing computations on junction tree in Gaussian graphical models
