Efficient Sampling and Structure Learning of Bayesian Networks
From MaRDI portal
Publication:5057075
DOI10.1080/10618600.2021.2020127OpenAlexW3002588292MaRDI QIDQ5057075FDOQ5057075
Authors: Jack Kuipers, Polina Suter, Giusi Moffa 
Publication date: 15 December 2022
Published in: Journal of Computational and Graphical Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1803.07859
Cites Work
- Parameter priors for directed acyclic graphical models and the characterization of several probability distributions
- Improving the structure MCMC sampler for Bayesian networks by introducing a new edge reversal move
- A characterization of Markov equivalence classes for acyclic digraphs
- Being Bayesian about network structure. A Bayesian approach to structure discovery in Bayesian networks
- Improving Markov chain Monte Carlo model search for data mining
- Exact Bayesian structure discovery in Bayesian networks
- Estimating high-dimensional directed acyclic graphs with the PC-algorithm
- Title not available (Why is that?)
- 10.1162/153244302760200696
- Bayesian Graphical Models for Discrete Data
- The max-min hill-climbing Bayesian network structure learning algorithm
- Probabilistic graphical models.
- Estimating high-dimensional intervention effects from observational data
- Bayesian Network Structure Learning with Integer Programming: Polytopes, Facets and Complexity
- Geometry of the faithfulness assumption in causal inference
- Causal diagrams for empirical research
- 10.1162/153244303321897717
- Title not available (Why is that?)
- Addendum on the scoring of Gaussian directed acyclic graphical models
- Title not available (Why is that?)
- High-dimensional consistency in score-based and hybrid structure learning
- A Gibbs sampler for learning DAGs
- Uniform random generation of large acyclic digraphs
- A BIRTH AND DEATH PROCESS FOR BAYESIAN NETWORK STRUCTURE INFERENCE
Cited In (10)
- Bayesian Multi-Task Variable Selection with an Application to Differential DAG Analysis
- Title not available (Why is that?)
- The dual PC algorithm and the role of Gaussianity for structure learning of Bayesian networks
- Being Bayesian about learning Bayesian networks from ordinal data
- Toric ideals of characteristic imsets via quasi-independence gluing
- A Gibbs sampler for learning DAGs
- Title not available (Why is that?)
- Being Bayesian about learning Gaussian Bayesian networks from incomplete data
- A Bayesian approach for learning Bayesian network structures
- Bayesian networks: regenerative Gibbs samplings
Uses Software
This page was built for publication: Efficient Sampling and Structure Learning of Bayesian Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5057075)
