Estimation of Gaussian directed acyclic graphs using partial ordering information with applications to DREAM3 networks and dairy cattle data
From MaRDI portal
Publication:6104082
Abstract: Estimating a directed acyclic graph (DAG) from observational data represents a canonical learning problem and has generated a lot of interest in recent years. Research has focused mostly on the following two cases: when no information regarding the ordering of the nodes in the DAG is available, and when a domain-specific complete ordering of the nodes is available. In this paper, motivated by a recent application in dairy science, we develop a method for DAG estimation for the middle scenario, where partition based partial ordering of the nodes is known based on domain specific knowledge.We develop an efficient algorithm that solves the posited problem, coined Partition-DAG. Through extensive simulations using the DREAM3 Yeast data, we illustrate that Partition-DAG effectively incorporates the partial ordering information to improve both speed and accuracy. We then illustrate the usefulness of Partition-DAG by applying it to recently collected dairy cattle data, and inferring relationships between various variables involved in dairy agroecosystems.
Cites work
- 10.1162/153244303321897717
- A convex pseudolikelihood framework for high dimensional partial correlation estimation with convergence guarantees
- A linear non-Gaussian acyclic model for causal discovery
- A scalable sparse Cholesky based approach for learning high-dimensional covariance matrices in ordered data
- Causal inference by using invariant prediction: identification and confidence intervals. With discussion and authors' reply
- Causation, prediction, and search. With additional material by David Heckerman, Christopher Meek, Gregory F. Cooper and Thomas Richardson.
- Characterization and greedy learning of interventional Markov equivalence classes of directed acyclic graphs
- Concave penalized estimation of sparse Gaussian Bayesian networks
- Convergence of a block coordinate descent method for nondifferentiable minimization
- Covariance matrix selection and estimation via penalised normal likelihood
- DirectLiNGAM: a direct method for learning a linear non-Gaussian structural equation model
- Estimating high-dimensional directed acyclic graphs with the PC-algorithm
- High-dimensional consistency in score-based and hybrid structure learning
- Learning Bayesian networks by hill climbing: efficient methods based on progressive restriction of the neighborhood
- Learning Bayesian networks: The combination of knowledge and statistical data
- Learning Causal Bayesian Network Structures From Experimental Data
- Likelihood ratio tests for a large directed acyclic graph
- Multi-domain sampling with applications to structural inference of Bayesian networks
- Objective Bayes Covariate‐Adjusted Sparse Graphical Model Selection
- Objective Bayesian search of Gaussian directed acyclic graphical models for ordered variables with non-local priors
- Order-independent constraint-based causal structure learning
- Penalized likelihood methods for estimation of sparse high-dimensional directed acyclic graphs
- Posterior graph selection and estimation consistency for high-dimensional Bayesian DAG models
- SparseNet: coordinate descent with nonconvex penalties
- The max-min hill-climbing Bayesian network structure learning algorithm
- \(\ell_{0}\)-penalized maximum likelihood for sparse directed acyclic graphs
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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6104082)
