Gaussian graphical models parallel estimation via coordinate descent neighborhood selection

DOI10.13232/J.CNKI.JNJU.2016.02.013MaRDI QIDQ2824149zbMATH OpenFDO

Authors Ming Zhou, Xiao-Tong Yuan, Qi Luo, Qingshan Liu, XiaoYu Li

Publication date 6 October 2016

Published in Journal of Nanjing University. Natural Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.13232/J.CNKI.JNJU.2016.02.013

zbMATH Keywords

coordinate descentGaussian graphical modelsLassoparallel estimation

Mathematics Subject Classification ID

Graphical methods in statistics (62A09) Ridge regression; shrinkage estimators (Lasso) (62J07) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Model selection through sparse maximum likelihood estimation for multivariate Gaussian or binary data
• Sparse inverse covariance estimation with the graphical lasso
• Bayesian structure learning in sparse Gaussian graphical models
• Fitting very large sparse Gaussian graphical models
• The cluster graphical Lasso for improved estimation of Gaussian graphical models

Cited in

(2)

• Parallel probabilistic graphical model approach for nonparametric Bayesian inference
• An efficient parallel block coordinate descent algorithm for large-scale precision matrix estimation using graphics processing units

This page was built for publication: Gaussian graphical models parallel estimation via coordinate descent neighborhood selection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2824149)