Maximum Likelihood Estimation Over Directed Acyclic Gaussian Graphs
From MaRDI portal
Publication:4969868
Cites work
- scientific article; zbMATH DE number 1493045 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- 10.1162/153244303321897717
- Bayesian analysis in expert systems. With comments and a rejoinder by the authors
- Causation, prediction, and search
- Coordinate descent algorithms for lasso penalized regression
- Estimating high-dimensional directed acyclic graphs with the PC-algorithm
- Estimating time-varying networks
- High-dimensional graphs and variable selection with the Lasso
- Joint estimation of multiple graphical models
- Learning Bayesian networks from data: An information-theory based approach
- Learning Bayesian networks: The combination of knowledge and statistical data
- Likelihood-based selection and sharp parameter estimation
- Model selection and estimation in the Gaussian graphical model
- Pathwise coordinate optimization
- Penalized likelihood methods for estimation of sparse high-dimensional directed acyclic graphs
- Sparse inverse covariance estimation with the graphical lasso
- The max-min hill-climbing Bayesian network structure learning algorithm
Cited in
(7)- Addendum on the scoring of Gaussian directed acyclic graphical models
- Constrained likelihood for reconstructing a directed acyclic Gaussian graph
- Maximizing Complex Likelihoods via Directed Stochastic Searching Algorithm
- Penalized likelihood methods for estimation of sparse high-dimensional directed acyclic graphs
- Estimation of Sparse Directional Connectivity With Expectation Maximization
- Iterative maximum likelihood on networks
- Identifiability of directed Gaussian graphical models with one latent source
This page was built for publication: Maximum Likelihood Estimation Over Directed Acyclic Gaussian Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4969868)
