Robust methods for inferring sparse network structures
From MaRDI portal
Publication:1615086
DOI10.1016/j.csda.2013.05.004zbMath1471.62201OpenAlexW2130885595MaRDI QIDQ1615086
Hussein Hashem, Veronica Vinciotti
Publication date: 2 November 2018
Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)
Full work available at URL: http://bura.brunel.ac.uk/handle/2438/8941
Computational methods for problems pertaining to statistics (62-08) Robustness and adaptive procedures (parametric inference) (62F35) Probabilistic graphical models (62H22)
Related Items (7)
Statistical procedures for the market graph construction ⋮ Covariance structure regularization via entropy loss function ⋮ Solving norm constrained portfolio optimization via coordinate-wise descent algorithms ⋮ Robust sparse Gaussian graphical modeling ⋮ Dependence in elliptical partial correlation graphs ⋮ Covariance structure regularization via Frobenius-norm discrepancy ⋮ Dynamic and robust Bayesian graphical models
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sparse inverse covariance estimation with the graphical lasso
- Weighted LAD-LASSO method for robust parameter estimation and variable selection in regression
- Statistics for high-dimensional data. Methods, theory and applications.
- Robust graphical modeling of gene networks using classical and alternative \(t\)-distributions
- Simultaneous estimation and variable selection in median regression using Lasso-type penalty
- Robust regression through the Huber's criterion and adaptive lasso penalty
- Robust concentration graph model selection
- Robust Gaussian graphical modeling
- High-dimensional graphs and variable selection with the Lasso
- Piecewise linear regularized solution paths
- Elliptical graphical modelling
- Robustness and efficiency properties of scatter matrices
- Penalized Composite Quasi-Likelihood for Ultrahigh Dimensional Variable Selection
- Robust Statistics
This page was built for publication: Robust methods for inferring sparse network structures