2 search results - page 1 / 1 » Learning Sparse Gaussian Markov Networks Using a Greedy Coor... |
PKDD
2010
Springer
13 years 3 months ago
2010
Springer
In this paper, we introduce a simple but efficient greedy algorithm, called SINCO, for the Sparse INverse COvariance selection problem, which is equivalent to learning a sparse Ga...
UAI
2008
13 years 6 months ago
2008
Gaussian Markov random fields (GMRFs) are useful in a broad range of applications. In this paper we tackle the problem of learning a sparse GMRF in a high-dimensional space. Our a...