A Gibbs sampler for learning DAG: a unification for discrete and Gaussian domains
From MaRDI portal
Publication:3389643
DOI10.1080/00949655.2021.1909026OpenAlexW3201538716MaRDI QIDQ3389643FDOQ3389643
Authors: Hamid Zareifard, Vahid Rezaei Tabar, D. Plewczyński
Publication date: 23 March 2022
Published in: Journal of Statistical Computation and Simulation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00949655.2021.1909026
Recommendations
- A Gibbs sampler for learning DAGs
- Gibbs sampling in Bayesian networks
- Bayesian networks: regenerative Gibbs samplings
- A Gaussian mixed model for learning discrete Bayesian networks
- scientific article; zbMATH DE number 6948153
- Sampling hyperparameters in hierarchical models: Improving on Gibbs for high-dimensional latent fields and large datasets
- Gibbs sampler and coordinate ascent variational inference: A set-theoretical review
- The generalized Gibbs sampler and the neigborhood sampler
- Pseudo-Gibbs sampler for discrete conditional distributions
directed acyclic graphordinal dataBayesian graph selectionhierarchical mixture priorhigh-dimensional continuous data
Cites Work
- Parameter priors for directed acyclic graphical models and the characterization of several probability distributions
- The Calculation of Posterior Distributions by Data Augmentation
- Bayesian Analysis of Binary and Polychotomous Response Data
- Being Bayesian about network structure. A Bayesian approach to structure discovery in Bayesian networks
- Improving Markov chain Monte Carlo model search for data mining
- Learning Bayesian networks: The combination of knowledge and statistical data
- Bayesian Variable Selection in Linear Regression
- Title not available (Why is that?)
- Bayesian Graphical Models for Discrete Data
- Penalized likelihood methods for estimation of sparse high-dimensional directed acyclic graphs
- Analysis of multivariate probit models
- Wishart distributions for decomposable covariance graph models
- Wishart distributions for decomposable graphs
- Bayesian graphical Lasso models and efficient posterior computation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Structure discovery in Bayesian networks by sampling partial orders
- Posterior graph selection and estimation consistency for high-dimensional Bayesian DAG models
- Bayesian structure learning in graphical models
- Improving structure MCMC for Bayesian networks through Markov blanket resampling
- A Gibbs sampler for learning DAGs
- An empirical Bayes approach for learning directed acyclic graph using MCMC algorithm
Cited In (2)
This page was built for publication: A Gibbs sampler for learning DAG: a unification for discrete and Gaussian domains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3389643)