Maximum Likelihood Estimation Over Directed Acyclic Gaussian Graphs
From MaRDI portal
Publication:4969868
DOI10.1002/SAM.11168OpenAlexW1975807959WikidataQ42025636 ScholiaQ42025636MaRDI QIDQ4969868FDOQ4969868
Authors: Yiping Yuan, Xiaotong Shen, Wei Pan 
Publication date: 14 October 2020
Published in: Statistical Analysis and Data Mining: The ASA Data Science Journal (Search for Journal in Brave)
Full work available at URL: http://europepmc.org/articles/pmc3866136
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)
- Iterative maximum likelihood on networks
- Estimation of Sparse Directional Connectivity With Expectation Maximization
- Addendum on the scoring of Gaussian directed acyclic graphical models
- Maximizing Complex Likelihoods via Directed Stochastic Searching Algorithm
- Penalized likelihood methods for estimation of sparse high-dimensional directed acyclic graphs
- Identifiability of directed Gaussian graphical models with one latent source
- Constrained likelihood for reconstructing a directed acyclic Gaussian graph
Uses Software
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)
