Learning Block Structured Graphs in Gaussian Graphical Models
From MaRDI portal
(Redirected from Publication:6552531)
Cites work
- scientific article; zbMATH DE number 6114088 (Why is no real title available?)
- scientific article; zbMATH DE number 5769726 (Why is no real title available?)
- 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 direct sampler for G-Wishart variates
- A unified framework for structured graph learning via spectral constraints
- Bayesian Graphical Models for Discrete Data
- Bayesian inference for general Gaussian graphical models with application to multivariate lattice data
- Bayesian inference for multiple Gaussian graphical models with application to metabolic association networks
- Bayesian inference of multiple Gaussian graphical models
- Bayesian learning of multiple directed networks from observational data
- Bayesian structure learning in sparse Gaussian graphical models
- Decomposable graphical Gaussian model determination
- Efficient Gaussian graphical model determination under G-Wishart prior distributions
- Exact formulas for the normalizing constants of Wishart distributions for graphical models
- Experiments in stochastic computation for high-dimensional graphical models
- Gaussian graphical modeling for spectrometric data analysis
- Hierarchical normalized completely random measures for robust graphical modeling
- 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
- Improving Markov chain Monte Carlo model search for data mining
- Inferring sparse Gaussian graphical models with latent structure
- Informed proposals for local MCMC in discrete spaces
- On the prior and posterior distributions used in graphical modelling
- Optimal predictive model selection.
- Scaling it up: stochastic search structure learning in graphical models
- The G-Wishart Weighted Proposal Algorithm: Efficient Posterior Computation for Gaussian Graphical Models
- The cluster graphical Lasso for improved estimation of Gaussian graphical models
- The max-min hill-climbing Bayesian network structure learning algorithm
- Unbiased approximation of posteriors via coupled particle Markov chain Monte Carlo
This page was built for publication: Learning Block Structured Graphs in Gaussian Graphical Models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6552531)
