Exact estimation of multiple directed acyclic graphs
From MaRDI portal
Publication:2628883
Abstract: This paper considers the problem of estimating the structure of multiple related directed acyclic graph (DAG) models. Building on recent developments in exact estimation of DAGs using integer linear programming (ILP), we present an ILP approach for joint estimation over multiple DAGs, that does not require that the vertices in each DAG share a common ordering. Furthermore, we allow also for (potentially unknown) dependency structure between the DAGs. Results are presented on both simulated data and fMRI data obtained from multiple subjects.
Recommendations
- High-dimensional joint estimation of multiple directed Gaussian graphical models
- Toward a multisubject analysis of neural connectivity
- Structural learning about directed acyclic graphs from multiple databases
- Bayesian joint inference for multiple directed acyclic graphs
- Joint skeleton estimation of multiple directed acyclic graphs for heterogeneous population
Cites work
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 1312984 (Why is no real title available?)
- scientific article; zbMATH DE number 472978 (Why is no real title available?)
- scientific article; zbMATH DE number 1522721 (Why is no real title available?)
- 10.1162/153244303321897717
- A geometric view on learning Bayesian network structures
- Being Bayesian about network structure. A Bayesian approach to structure discovery in Bayesian networks
- Efficient maximum likelihood pedigree reconstruction
- Efficient structure learning of Bayesian networks using constraints
- High-dimensional graphs and variable selection with the Lasso
- Identifiability of Gaussian structural equation models with equal error variances
- Improved maximum likelihood reconstruction of complex multi-generational pedigrees
- Inductive transfer for learning Bayesian networks
- Joint estimation of multiple related biological networks
- Learning Bayesian networks: The combination of knowledge and statistical data
- Learning Causal Bayesian Network Structures From Experimental Data
- Learning optimal Bayesian networks: a shortest path perspective
- On polyhedral approximations of polytopes for learning Bayesian networks
- Reversible MCMC on Markov equivalence classes of sparse directed acyclic graphs
- SCIP: solving constraint integer programs
- Searching multiregression dynamic models of resting-state fMRI networks using integer programming
- Sparse inverse covariance estimation with the graphical lasso
- Structural Equation Modeling
- Structure estimation for discrete graphical models: generalized covariance matrices and their inverses
- The Joint Graphical Lasso for Inverse Covariance Estimation Across Multiple Classes
- The max-min hill-climbing Bayesian network structure learning algorithm
- Toward a multisubject analysis of neural connectivity
Cited in
(13)- Bayesian learning of multiple directed networks from observational data
- Joint skeleton estimation of multiple directed acyclic graphs for heterogeneous population
- Bayesian graphical models for modern biological applications
- Structural learning about directed acyclic graphs from multiple databases
- Hierarchical subspace identification of directed acyclic graphs
- A group analysis using the multiregression dynamic models for fMRI networked time series
- A random covariance model for bi‐level graphical modeling with application to resting‐state fMRI data
- Bayesian joint inference for multiple directed acyclic graphs
- Toward a multisubject analysis of neural connectivity
- scientific article; zbMATH DE number 7255130 (Why is no real title available?)
- Hierarchical estimation of parameters in Bayesian networks
- A Bayesian hierarchical score for structure learning from related data sets
- Gaussian Bayesian network comparisons with graph ordering unknown
This page was built for publication: Exact estimation of multiple directed acyclic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2628883)