Structure learning of sparse directed acyclic graphs incorporating the scale-free property
From MaRDI portal
Publication:2418068
Recommendations
- Penalized likelihood methods for estimation of sparse high-dimensional directed acyclic graphs
- Sparse directed acyclic graphs incorporating the covariates
- Penalized estimation of directed acyclic graphs from discrete data
- Estimating scale-free networks via the exponentiation of minimax concave penalty
- Inferring large graphs using \(\ell_1\)-penalized likelihood
Cites work
- \(\ell_{0}\)-penalized maximum likelihood for sparse directed acyclic graphs
- A Bayesian method for the induction of probabilistic networks from data
- A unified framework for high-dimensional analysis of M-estimators with decomposable regularizers
- Causation, prediction, and search
- Concave penalized estimation of sparse Gaussian Bayesian networks
- Coordinate descent algorithms for lasso penalized regression
- Emergence of Scaling in Random Networks
- Estimating high-dimensional directed acyclic graphs with the PC-algorithm
- Estimation of graphical models through structured norm minimization
- High-dimensional covariance estimation by minimizing \(\ell _{1}\)-penalized log-determinant divergence
- High-dimensional graphs and variable selection with the Lasso
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- scientific article; zbMATH DE number 1134987 (Why is no real title available?)
- scientific article; zbMATH DE number 1493045 (Why is no real title available?)
- Hub Discovery in Partial Correlation Graphs
- Introduction to Graphical Modelling
- Learning graphical models with hubs
- Learning Sparse Causal Gaussian Networks With Experimental Intervention: Regularization and Coordinate Descent
- Model selection and estimation in the Gaussian graphical model
- Partial correlation estimation by joint sparse regression models
- Pathwise coordinate optimization
- Penalized likelihood methods for estimation of sparse high-dimensional directed acyclic graphs
- Simultaneous analysis of Lasso and Dantzig selector
- Sparse inverse covariance estimation with the graphical lasso
- Statistical mechanics of complex networks
- Support recovery without incoherence: a case for nonconvex regularization
Cited in
(2)
This page was built for publication: Structure learning of sparse directed acyclic graphs incorporating the scale-free property
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2418068)
