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...
Chandrasekaran, Parrilo, andWillsky (2012) proposed a convex optimization problem for graphical mode...
A method for constructing priors is proposed that allows the off-diagonal elements of the concentrat...
We propose penalized likelihood methods for estimating the concentration matrix in the Gaussian grap...
We consider the problem of estimating the parameters of a Gaussian or binary distribution in such a ...
A Gaussian graphical model is a graph representation of conditional independence relations among Gau...
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 ...
In this paper we introduce restricted concentration models (RCMs) as a class of graphical models for...
Penalized inference of Gaussian graphical models is a way to assess the conditional independence str...
The majority of methods for sparse precision matrix estimation rely on computationally expensive pro...
Inspired by the success of the Lasso for regression analysis, it seems attractive to estimate the gr...
High-dimensional data refers to the case in which the number of parameters is of one or more order g...
AbstractA method for constructing priors is proposed that allows the off-diagonal elements of the co...
<div><p>We propose a model selection algorithm for high-dimensional clustered data. Our algorithm co...
Chandrasekaran, Parrilo, andWillsky (2012) proposed a convex optimization problem for graphical mode...
A method for constructing priors is proposed that allows the off-diagonal elements of the concentrat...
We propose penalized likelihood methods for estimating the concentration matrix in the Gaussian grap...
We consider the problem of estimating the parameters of a Gaussian or binary distribution in such a ...
A Gaussian graphical model is a graph representation of conditional independence relations among Gau...
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 ...
In this paper we introduce restricted concentration models (RCMs) as a class of graphical models for...
Penalized inference of Gaussian graphical models is a way to assess the conditional independence str...
The majority of methods for sparse precision matrix estimation rely on computationally expensive pro...
Inspired by the success of the Lasso for regression analysis, it seems attractive to estimate the gr...
High-dimensional data refers to the case in which the number of parameters is of one or more order g...
AbstractA method for constructing priors is proposed that allows the off-diagonal elements of the co...
<div><p>We propose a model selection algorithm for high-dimensional clustered data. Our algorithm co...
Chandrasekaran, Parrilo, andWillsky (2012) proposed a convex optimization problem for graphical mode...
A method for constructing priors is proposed that allows the off-diagonal elements of the concentrat...