Efficient local updates for undirected graphical models
From MaRDI portal
Publication:5963562
DOI10.1007/s11222-014-9541-6zbMath1331.62166OpenAlexW2045972011MaRDI QIDQ5963562
Francesco C. Stingo, Giovanni M. Marchetti
Publication date: 22 February 2016
Published in: Statistics and Computing (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2158/956938
Markov chain Monte Carlomixture priorsgraphical model determinationlocal updatesperfect elimination order
Random fields; image analysis (62M40) Bayesian inference (62F15) Genetics and epigenetics (92D10) Graphical methods in statistics (62A09)
Related Items
Bayesian graphical models for modern biological applications ⋮ A loss‐based prior for Gaussian graphical models ⋮ On a wider class of prior distributions for graphical models ⋮ Learning Gaussian graphical models with fractional marginal pseudo-likelihood ⋮ Bayesian Approaches for Large Biological Networks ⋮ Bayesian Graphical Regression ⋮ Bayesian learning of weakly structural Markov graph laws using sequential Monte Carlo methods
Uses Software
Cites Work
- Unnamed Item
- Parameter priors for directed acyclic graphical models and the characterization of several probability distributions
- Positive definite completions of partial Hermitian matrices
- Enumerating the decomposable neighbors of a decomposable graph under a simple perturbation scheme
- Schur products and matrix completions
- Hyper Markov laws in the statistical analysis of decomposable graphical models
- A characterization of Markov equivalence classes for acyclic digraphs
- Model uncertainty
- Sparse graphical models for exploring gene expression data
- Efficient Gaussian graphical model determination under \(G\)-Wishart prior distributions
- Experiments in stochastic computation for high-dimensional graphical models
- Bayesian graphical Lasso models and efficient posterior computation
- Bayesian Inference for General Gaussian Graphical Models With Application to Multivariate Lattice Data
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Decomposition of maximum likelihood in mixed graphical interaction models
- Linear Recursive Equations, Covariance Selection, and Path Analysis
- Hyper Inverse Wishart Distribution for Non-decomposable Graphs and its Application to Bayesian Inference for Gaussian Graphical Models
- Decomposable graphical Gaussian model determination
- Cholesky decomposition of a hyper inverse Wishart matrix
- Fully dynamic algorithms for chordal graphs and split graphs
- The Joint Graphical Lasso for Inverse Covariance Estimation Across Multiple Classes
- Sampling decomposable graphs using a Markov chain on junction trees
- A Monte Carlo method for computing the marginal likelihood in nondecomposable Gaussian graphical models
