Estimating scale-free networks via the exponentiation of minimax concave penalty
From MaRDI portal
Recommendations
- Network exploration via the adaptive LASSO and SCAD penalties
- Structure learning of sparse directed acyclic graphs incorporating the scale-free property
- Estimating sparse networks with hubs
- Sparse inverse covariance estimation with the graphical lasso
- Variable selection and estimation using a continuous approximation to the \(L_0\) penalty
Cited in
(3)
This page was built for publication: Estimating scale-free networks via the exponentiation of minimax concave penalty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2953963)