A Gibbs sampler for learning DAG: a unification for discrete and Gaussian domains
From MaRDI portal
Publication:3389643
DOI10.1080/00949655.2021.1909026OpenAlexW3201538716MaRDI QIDQ3389643
D. Plewczyński, Vahid Rezaei Tabar, Hamid Zareifard
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
directed acyclic graphordinal dataBayesian graph selectionhierarchical mixture priorhigh-dimensional continuous data
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parameter priors for directed acyclic graphical models and the characterization of several probability distributions
- Penalized likelihood methods for estimation of sparse high-dimensional directed acyclic graphs
- Being Bayesian about network structure. A Bayesian approach to structure discovery in Bayesian networks
- Improving Markov chain Monte Carlo model search for data mining
- Posterior graph selection and estimation consistency for high-dimensional Bayesian DAG models
- Learning Bayesian networks: The combination of knowledge and statistical data
- Bayesian structure learning in graphical models
- Wishart distributions for decomposable covariance graph models
- Bayesian graphical Lasso models and efficient posterior computation
- Wishart distributions for decomposable graphs
- The Calculation of Posterior Distributions by Data Augmentation
- Bayesian Variable Selection in Linear Regression
- Analysis of multivariate probit models
- Bayesian Graphical Models for Discrete Data
- An empirical Bayes approach for learning directed acyclic graph using MCMC algorithm
- Bayesian Analysis of Binary and Polychotomous Response Data
This page was built for publication: A Gibbs sampler for learning DAG: a unification for discrete and Gaussian domains