Fitting very large sparse Gaussian graphical models
From MaRDI portal
Publication:1927038
Recommendations
- Model selection through sparse maximum likelihood estimation for multivariate Gaussian or binary data
- Model selection and estimation in the Gaussian graphical model
- Sparse inverse covariance estimation with the graphical lasso
- Efficient estimation of covariance selection models
- Quasi-Bayesian estimation of large Gaussian graphical models
Cites work
- scientific article; zbMATH DE number 4199988 (Why is no real title available?)
- scientific article; zbMATH DE number 3816913 (Why is no real title available?)
- scientific article; zbMATH DE number 3602484 (Why is no real title available?)
- scientific article; zbMATH DE number 469396 (Why is no real title available?)
- scientific article; zbMATH DE number 1134987 (Why is no real title available?)
- scientific article; zbMATH DE number 194668 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 3383914 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- A survey of truncated-Newton methods
- Covariance selection for nonchordal graphs via chordal embedding
- Differentiation of matrix functionals using triangular factorization
- Extended Bayesian information criteria for model selection with large model spaces
- Function minimization by conjugate gradients
- Gaussian Markov distributions over finite graphs
- Graphical Gaussian Models With Edge and Vertex Symmetries
- High-dimensional graphs and variable selection with the Lasso
- Least angle regression. (With discussion)
- Linear Models and Empirical Bayes Methods for Assessing Differential Expression in Microarray Experiments
- Linear Recursive Equations, Covariance Selection, and Path Analysis
- Methods of conjugate gradients for solving linear systems
- Model selection through sparse maximum likelihood estimation for multivariate Gaussian or binary data
- On computing certain elements of the inverse of a sparse matrix
- On the consistency of feature selection using greedy least squares regression
- On the limited memory BFGS method for large scale optimization
- Quasi-Newton Methods, Motivation and Theory
- Sparse inverse covariance estimation with the graphical lasso
- Triangulated graphs and the elimination process
- Updating Quasi-Newton Matrices with Limited Storage
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Vec and vech operators for matrices, with some uses in jacobians and multivariate statistics
Cited in
(21)- Inferring sparse Gaussian graphical models with latent structure
- Model selection through sparse maximum likelihood estimation for multivariate Gaussian or binary data
- Experiments in stochastic computation for high-dimensional graphical models
- An improved Hara-Takamura procedure by sharing computations on junction tree in Gaussian graphical models
- The cost of using decomposable Gaussian graphical models for computational convenience
- Robust sparse Gaussian graphical modeling
- Scale-space module detection for random fields observed on a graph non-embedded in a metric space
- Generalized Sparse Precision Matrix Selection for Fitting Multivariate Gaussian Random Fields to Large Data Sets
- Accuracy and computational efficiency of a graphical modeling approach to linkage disequilibrium estimation
- A sparse matrix approach to Bayesian computation in large linear models
- Quasi-Bayesian estimation of large Gaussian graphical models
- Covariance selection for nonchordal graphs via chordal embedding
- Gaussian graphical models parallel estimation via coordinate descent neighborhood selection
- Structural learning of Gaussian graphical models from microarray data with \(p\) larger than \(n\)
- Model selection and estimation in the Gaussian graphical model
- A robust procedure for Gaussian graphical model search from microarray data with \(p\) larger than \(n\)
- A sparse linear algebra algorithm for fast computation of prediction variances with Gaussian Markov random fields
- Sparse Gaussian graphical mixture model
- Sparse Matrix Graphical Models
- Sparse nonparametric graphical models
- Graphical models for sparse data: graphical Gaussian models with vertex and edge symmetries
This page was built for publication: Fitting very large sparse Gaussian graphical models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1927038)
