On some algorithms for estimation in Gaussian graphical models
From MaRDI portal
Cites work
- A localization approach to improve iterative proportional scaling in Gaussian graphical models
- An improved Hara-Takamura procedure by sharing computations on junction tree in Gaussian graphical models
- Enlargement Methods for Computing the Inverse Matrix
- Gaussian graphical models
- Gaussian Markov distributions over finite graphs
- scientific article; zbMATH DE number 4211299 (Why is no real title available?)
- scientific article; zbMATH DE number 1134987 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 6125590 (Why is no real title available?)
- Locally associated graphical models and mixed convex exponential families
- Model selection and estimation in the Gaussian graphical model
- Model selection through sparse maximum likelihood estimation for multivariate Gaussian or binary data
- On chromatic number of graphs and set-systems
- On the effective implementation of the iterative proportional fitting procedure
- Positive definite completions of partial Hermitian matrices
- RcppArmadillo: accelerating R with high-performance C++ linear algebra
- Sharp lower and upper bounds for the Gaussian rank of a graph
- Smallest-last ordering and clustering and graph coloring algorithms
- Sparse inverse covariance estimation with the graphical lasso
- The maximum likelihood threshold of a graph
- The non-singularity of generalized sample covariance matrices
This page was built for publication: On some algorithms for estimation in Gaussian graphical models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7010971)
