Efficient local updates for undirected graphical models
From MaRDI portal
Publication:5963562
Recommendations
- Introduction to ``Efficient local updates for undirected graphical models by F. Stingo, G. Marchetti
- Local update algorithms for random graphs
- Local structure learning in graphical models
- Foundations of tree-like local model updates
- Efficient and effective Bayesian network local structure learning
- scientific article; zbMATH DE number 4178809
- Efficient local representations of graphs
- Local conditional and marginal approach to parameter estimation in discrete graphical models
- Efficient learning of discrete graphical models*
- Updating of the Gaussian graphical model through targeted penalized estimation
Cites work
- scientific article; zbMATH DE number 1134987 (Why is no real title available?)
- A Monte Carlo method for computing the marginal likelihood in nondecomposable Gaussian graphical models
- A characterization of Markov equivalence classes for acyclic digraphs
- Bayesian graphical Lasso models and efficient posterior computation
- Bayesian inference for general Gaussian graphical models with application to multivariate lattice data
- Cholesky decomposition of a hyper inverse Wishart matrix
- Decomposable graphical Gaussian model determination
- Decomposition of maximum likelihood in mixed graphical interaction models
- Efficient Gaussian graphical model determination under G-Wishart prior distributions
- Enumerating the decomposable neighbors of a decomposable graph under a simple perturbation scheme
- Experiments in stochastic computation for high-dimensional graphical models
- Fully dynamic algorithms for chordal graphs and split graphs
- Hyper Inverse Wishart Distribution for Non-decomposable Graphs and its Application to Bayesian Inference for Gaussian Graphical Models
- Hyper Markov laws in the statistical analysis of decomposable graphical models
- Linear Recursive Equations, Covariance Selection, and Path Analysis
- Model uncertainty
- Parameter priors for directed acyclic graphical models and the characterization of several probability distributions
- Positive definite completions of partial Hermitian matrices
- Sampling decomposable graphs using a Markov chain on junction trees
- Schur products and matrix completions
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Sparse graphical models for exploring gene expression data
- The Joint Graphical Lasso for Inverse Covariance Estimation Across Multiple Classes
Cited in
(12)- A junction tree framework for undirected graphical model selection
- Bayesian approaches for large biological networks
- Bayesian graphical models for modern biological applications
- Bayesian graphical regression
- A localization approach to improve iterative proportional scaling in Gaussian graphical models
- On a wider class of prior distributions for graphical models
- Efficient Computation of the Well-Founded Model Using Update Propagation
- Bayesian Structure Learning in Undirected Gaussian Graphical Models: Literature Review with Empirical Comparison
- Updating of the Gaussian graphical model through targeted penalized estimation
- Learning Gaussian graphical models with fractional marginal pseudo-likelihood
- Bayesian learning of weakly structural Markov graph laws using sequential Monte Carlo methods
- A loss‐based prior for Gaussian graphical models
This page was built for publication: Efficient local updates for undirected graphical models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963562)
