Estimation of Gaussian directed acyclic graphs using partial ordering information with applications to DREAM3 networks and dairy cattle data
From MaRDI portal
Publication:6104082
DOI10.1214/22-aoas1636arXiv1902.05173OpenAlexW4367598605MaRDI QIDQ6104082
No author found.
Publication date: 5 June 2023
Published in: The Annals of Applied Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1902.05173
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Penalized likelihood methods for estimation of sparse high-dimensional directed acyclic graphs
- Causal inference using invariant prediction: identification and confidence intervals
- \(\ell_{0}\)-penalized maximum likelihood for sparse directed acyclic graphs
- Learning Bayesian networks by hill climbing: efficient methods based on progressive restriction of the neighborhood
- The max-min hill-climbing Bayesian network structure learning algorithm
- Posterior graph selection and estimation consistency for high-dimensional Bayesian DAG models
- Learning Bayesian networks: The combination of knowledge and statistical data
- High-dimensional consistency in score-based and hybrid structure learning
- A scalable sparse Cholesky based approach for learning high-dimensional covariance matrices in ordered data
- Objective Bayesian Search of Gaussian Directed Acyclic Graphical Models for Ordered Variables with Non‐Local Priors
- SparseNet: Coordinate Descent With Nonconvex Penalties
- Multi-Domain Sampling With Applications to Structural Inference of Bayesian Networks
- Learning Causal Bayesian Network Structures From Experimental Data
- 10.1162/153244303321897717
- Likelihood Ratio Tests for a Large Directed Acyclic Graph
- Objective Bayes Covariate‐Adjusted Sparse Graphical Model Selection
- A Convex Pseudolikelihood Framework for High Dimensional Partial Correlation Estimation with Convergence Guarantees
- Characterization and Greedy Learning of Interventional Markov Equivalence Classes of Directed Acyclic Graphs
- Covariance matrix selection and estimation via penalised normal likelihood
- Convergence of a block coordinate descent method for nondifferentiable minimization
This page was built for publication: Estimation of Gaussian directed acyclic graphs using partial ordering information with applications to DREAM3 networks and dairy cattle data
