Learning Markov equivalence classes of directed acyclic graphs: an objective Bayes approach
From MaRDI portal
Recommendations
- Bayesian model averaging and model selection for markov equivalence classes of acyclic digraphs
- Characterization and greedy learning of interventional Markov equivalence classes of directed acyclic graphs
- A characterization of Markov equivalence classes for acyclic digraphs
- Objective Bayes factors for Gaussian directed acyclic graphical models
- Counting and exploring sizes of Markov equivalence classes of directed acyclic graphs
Cites work
- scientific article; zbMATH DE number 720676 (Why is no real title available?)
- scientific article; zbMATH DE number 1124630 (Why is no real title available?)
- scientific article; zbMATH DE number 1134987 (Why is no real title available?)
- scientific article; zbMATH DE number 1493045 (Why is no real title available?)
- scientific article; zbMATH DE number 1865509 (Why is no real title available?)
- scientific article; zbMATH DE number 1391247 (Why is no real title available?)
- scientific article; zbMATH DE number 3202018 (Why is no real title available?)
- 10.1162/153244302760200696
- A SINful approach to Gaussian graphical model selection
- A characterization of Markov equivalence classes for acyclic digraphs
- Active learning of causal networks with intervention experiments and optimal designs
- Alternative Markov properties for chain graphs
- Bayes Factors
- Bayesian inference of multiple Gaussian graphical models
- Bayesian model averaging and model selection for markov equivalence classes of acyclic digraphs
- Bayesian networks in R. With applications in systems biology
- Bayesian thinking, modeling and computation.
- Causation, prediction, and search
- Characterization and greedy learning of interventional Markov equivalence classes of directed acyclic graphs
- Compatibility of prior specifications across linear models
- Criteria for Bayesian model choice with application to variable selection
- Estimating high-dimensional directed acyclic graphs with the PC-algorithm
- Estimating the dimension of a model
- Expected-posterior prior distributions for model selection
- Extended Bayesian information criteria for model selection with large model spaces
- Hyper Markov laws in the statistical analysis of decomposable graphical models
- Identifiability of Gaussian structural equation models with equal error variances
- Inference from intrinsic Bayes' procedures under model selection and uncertainty
- Information consistency of the Jeffreys power-expected-posterior prior in Gaussian linear models
- Joint high-dimensional Bayesian variable and covariance selection with an application to eQTL analysis
- Jointly interventional and observational data: estimation of interventional Markov equivalence classes of directed acyclic graphs
- Maximum Likelihood Estimation in Gaussian Chain Graph Models under the Alternative Markov Property
- Objective Bayes Covariate‐Adjusted Sparse Graphical Model Selection
- Objective Bayes factors for Gaussian directed acyclic graphical models
- On the Markov Equivalence of Chain Graphs, Undirected Graphs, and Acyclic Digraphs
- Optimal predictive model selection.
- Order-independent constraint-based causal structure learning
- Parameter priors for directed acyclic graphical models and the characterization of several probability distributions
- Power-expected-posterior priors for variable selection in Gaussian linear models
- Probabilistic Networks and Expert Systems
- Probabilistic graphical models.
- Reversible MCMC on Markov equivalence classes of sparse directed acyclic graphs
- Some matrix-variate distribution theory: Notational considerations and a Bayesian application
- Sparse inverse covariance estimation with the graphical lasso
- Statistics and causal inference: A review. (With discussion)
- The Intrinsic Bayes Factor for Model Selection and Prediction
- The formal definition of reference priors
- The size distribution for Markov equivalence classes of acyclic digraph models.
- The whetstone and the alum block: balanced objective Bayesian comparison of nested models for discrete data
Cited in
(20)- Objective methods for graphical structural learning
- Compatible priors for model selection of high-dimensional Gaussian DAGs
- Complexity analysis of Bayesian learning of high-dimensional DAG models and their equivalence classes
- Objective Bayes model selection of Gaussian interventional essential graphs for the identification of signaling pathways
- Bayesian sample size determination for causal discovery
- Individualized causal discovery with latent trajectory embedded Bayesian networks
- Bayesian graphical models for modern biological applications
- Bayesian inference of graph-based dependencies from mixed-type data
- Learning Bayesian networks: a copula approach for mixed-type data
- Structure learning and causal effect estimation from unbalanced groups
- Integrative learning of linear non-Gaussian directed acyclic graphs with application on multisource gene regulatory network analysis
- Objective Bayesian search of Gaussian directed acyclic graphical models for ordered variables with non-local priors
- Counting and exploring sizes of Markov equivalence classes of directed acyclic graphs
- Network Structure Learning Under Uncertain Interventions
- Bayesian Model Selection of Gaussian Directed Acyclic Graph Structures
- Bayesian optimal experimental design for inferring causal structure
- Objective Bayes factors for Gaussian directed acyclic graphical models
- Distributional equivalence and structure learning for bow-free acyclic path diagrams
- Bayesian differential causal directed acyclic graphs for observational zero-inflated counts with an application to two-sample single-cell data
- Reversible MCMC on Markov equivalence classes of sparse directed acyclic graphs
This page was built for publication: Learning Markov equivalence classes of directed acyclic graphs: an objective Bayes approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1631609)
