Maximum Likelihood Estimation Over Directed Acyclic Gaussian Graphs

DOI10.1002/sam.11168OpenAlexW1975807959WikidataQ42025636 ScholiaQ42025636MaRDI QIDQ4969868

Xiaotong Shen, Wei Pan, Yiping Yuan

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

zbMATH Keywords

nonconvex constraintscollapsed networkspairwise coordinate descent

Mathematics Subject Classification ID

Statistics (62-XX) Computer science (68-XX)

Uses Software

• glasso
• TETRAD

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Estimating time-varying networks
• Causation, prediction, and search
• Bayesian analysis in expert systems. With comments and a rejoinder by the authors
• Learning Bayesian networks from data: An information-theory based approach
• Learning Bayesian networks: The combination of knowledge and statistical data
• Pathwise coordinate optimization
• Coordinate descent algorithms for lasso penalized regression
• High-dimensional graphs and variable selection with the Lasso
• Joint estimation of multiple graphical models
• Model selection and estimation in the Gaussian graphical model
• 10.1162/153244303321897717
• Likelihood-Based Selection and Sharp Parameter Estimation