Concave penalized estimation of sparse Gaussian Bayesian networks
From MaRDI portal
Publication:5744839
zbMATH Open1351.68203arXiv1401.0852MaRDI QIDQ5744839FDOQ5744839
Authors: Bryon Aragam, Qing Zhou 
Publication date: 19 February 2016
Full work available at URL: https://arxiv.org/abs/1401.0852
Recommendations
- Bayesian structure learning in sparse Gaussian graphical models
- \(\ell_{0}\)-penalized maximum likelihood for sparse directed acyclic graphs
- Penalized estimation of directed acyclic graphs from discrete data
- Bayesian structure learning in graphical models
- Multivariate Gaussian network structure learning
Bayesian networksnonconvex optimizationcoordinate descentdirected acyclic graphsconcave penalization
Learning and adaptive systems in artificial intelligence (68T05) Estimation in multivariate analysis (62H12) Ridge regression; shrinkage estimators (Lasso) (62J07)
Cited In (23)
- Causal network learning with non-invertible functional relationships
- Tests for differential Gaussian Bayesian networks based on quadratic inference functions
- High-dimensional consistency in score-based and hybrid structure learning
- Model selection and local geometry
- Risk spillover network structure learning for correlated financial assets: a directed acyclic graph approach
- Title not available (Why is that?)
- Sparse directed acyclic graphs incorporating the covariates
- A scalable sparse Cholesky based approach for learning high-dimensional covariance matrices in ordered data
- Stationary-sparse causality network learning
- Bayesian network learning via topological order
- A convex pseudolikelihood framework for high dimensional partial correlation estimation with convergence guarantees
- Estimation of sparse binary pairwise Markov networks using pseudo-likelihoods
- High-dimensional covariance estimation for Gaussian directed acyclic graph models with given order
- Corrected score methods for estimating Bayesian networks with error-prone nodes
- Penalized estimation of directed acyclic graphs from discrete data
- \(\ell_{0}\)-penalized maximum likelihood for sparse directed acyclic graphs
- Multivariate Gaussian network structure learning
- Estimation of Gaussian directed acyclic graphs using partial ordering information with applications to DREAM3 networks and dairy cattle data
- A review of Gaussian Markov models for conditional independence
- Structural factor equation models for causal network construction via directed acyclic mixed graphs
- Learning graphical models with hubs
- Structure learning of Bayesian networks with latent variables via sparse and low-rank decomposition
- Structure learning of sparse directed acyclic graphs incorporating the scale-free property
Uses Software
This page was built for publication: Concave penalized estimation of sparse Gaussian Bayesian networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5744839)
