Structure learning of sparse directed acyclic graphs incorporating the scale-free property
DOI10.1007/S00180-018-0841-8zbMATH Open1417.62183OpenAlexW2893346624MaRDI QIDQ2418068FDOQ2418068
Authors: Xiao Guo, Hai Zhang, Yao Wang, Yong Liang 
Publication date: 3 June 2019
Published in: Computational Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00180-018-0841-8
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
Computational methods for problems pertaining to statistics (62-08) Asymptotic properties of parametric estimators (62F12) Multivariate analysis (62H99) Applications of graph theory (05C90) Ridge regression; shrinkage estimators (Lasso) (62J07)
Cites Work
- Causation, prediction, and search
- Introduction to Graphical Modelling
- Pathwise coordinate optimization
- Coordinate descent algorithms for lasso penalized regression
- Statistical mechanics of complex networks
- Simultaneous analysis of Lasso and Dantzig selector
- High-dimensional graphs and variable selection with the Lasso
- A unified framework for high-dimensional analysis of \(M\)-estimators with decomposable regularizers
- A Bayesian method for the induction of probabilistic networks from data
- Sparse inverse covariance estimation with the graphical lasso
- Emergence of Scaling in Random Networks
- Estimating high-dimensional directed acyclic graphs with the PC-algorithm
- Title not available (Why is that?)
- Model selection and estimation in the Gaussian graphical model
- \(\ell_{0}\)-penalized maximum likelihood for sparse directed acyclic graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Partial correlation estimation by joint sparse regression models
- Penalized likelihood methods for estimation of sparse high-dimensional directed acyclic graphs
- High-dimensional covariance estimation by minimizing \(\ell _{1}\)-penalized log-determinant divergence
- Learning Sparse Causal Gaussian Networks With Experimental Intervention: Regularization and Coordinate Descent
- Concave penalized estimation of sparse Gaussian Bayesian networks
- Hub Discovery in Partial Correlation Graphs
- Support recovery without incoherence: a case for nonconvex regularization
- Learning graphical models with hubs
- Estimation of graphical models through structured norm minimization
Cited In (2)
Uses Software
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)
