We propose penalized likelihood methods for estimating the concentration matrix in the Gaussian graphical model. The methods lead to a sparse and shrinkage estimator of the concentration matrix that is positive definite, and thus conduct model selection and estimation simultaneously. The implementation of the methods is nontrivial because of the positive definite constraint on the concentration matrix, but we show that the computation can be done effectively by taking advantage of the efficient maxdet algorithm developed in convex optimization. We propose a BIC -type criterion for the selection of the tuning parameter in the penalized likelihood methods. The connection between our methods and existing methods is illustrated. Simulations and...
<div><p>We propose a model selection algorithm for high-dimensional clustered data. Our algorithm co...
Latent Gaussian graphical models are very useful in probabilistic modeling to measure the statistica...
AbstractA method for constructing priors is proposed that allows the off-diagonal elements of the co...
We propose penalized likelihood methods for estimating the concentration matrix in the Gaussian grap...
A Gaussian graphical model is a graph representation of conditional independence relations among Gau...
We consider the problem of estimating the parameters of a Gaussian or binary distribution in such a ...
In this paper we introduce restricted concentration models (RCMs) as a class of graphical models for...
We wish to congratulate the authors for their innovative contribution, which is bound to inspire muc...
We consider the problem of estimating a sparse dynamic Gaussian graphical model with L1 penalized ma...
We consider the problem of fitting a large-scale covariance matrix to multivariate Gaussian data in ...
Penalized inference of Gaussian graphical models is a way to assess the conditional independence str...
Our concern is selecting the concentration matrix's nonzero coefficients for a sparse Gaussian graph...
We describe algorithms for maximum likelihood estimation of Gaussian graphical models with condition...
We consider distributed estimation of the inverse covariance matrix, also called the concentration o...
We consider distributed estimation of the inverse co-variance matrix, also called the concentration ...
<div><p>We propose a model selection algorithm for high-dimensional clustered data. Our algorithm co...
Latent Gaussian graphical models are very useful in probabilistic modeling to measure the statistica...
AbstractA method for constructing priors is proposed that allows the off-diagonal elements of the co...
We propose penalized likelihood methods for estimating the concentration matrix in the Gaussian grap...
A Gaussian graphical model is a graph representation of conditional independence relations among Gau...
We consider the problem of estimating the parameters of a Gaussian or binary distribution in such a ...
In this paper we introduce restricted concentration models (RCMs) as a class of graphical models for...
We wish to congratulate the authors for their innovative contribution, which is bound to inspire muc...
We consider the problem of estimating a sparse dynamic Gaussian graphical model with L1 penalized ma...
We consider the problem of fitting a large-scale covariance matrix to multivariate Gaussian data in ...
Penalized inference of Gaussian graphical models is a way to assess the conditional independence str...
Our concern is selecting the concentration matrix's nonzero coefficients for a sparse Gaussian graph...
We describe algorithms for maximum likelihood estimation of Gaussian graphical models with condition...
We consider distributed estimation of the inverse covariance matrix, also called the concentration o...
We consider distributed estimation of the inverse co-variance matrix, also called the concentration ...
<div><p>We propose a model selection algorithm for high-dimensional clustered data. Our algorithm co...
Latent Gaussian graphical models are very useful in probabilistic modeling to measure the statistica...
AbstractA method for constructing priors is proposed that allows the off-diagonal elements of the co...