Sciweavers

30 search results - page 1 / 6
» Map approach to learning sparse Gaussian Markov networks
Sort
View
ICASSP
2009
IEEE
13 years 11 months ago
Map approach to learning sparse Gaussian Markov networks
Recently proposed l1-regularized maximum-likelihood optimization methods for learning sparse Markov networks result into convex problems that can be solved optimally and efficien...
Narges Bani Asadi, Irina Rish, Katya Scheinberg, D...
PKDD
2010
Springer
158views Data Mining» more  PKDD 2010»
13 years 2 months ago
Learning Sparse Gaussian Markov Networks Using a Greedy Coordinate Ascent Approach
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...
Katya Scheinberg, Irina Rish
UAI
2008
13 years 5 months ago
Projected Subgradient Methods for Learning Sparse Gaussians
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...
John Duchi, Stephen Gould, Daphne Koller
TSP
2010
12 years 11 months ago
Gaussian multiresolution models: exploiting sparse Markov and covariance structure
We consider the problem of learning Gaussian multiresolution (MR) models in which data are only available at the finest scale and the coarser, hidden variables serve both to captu...
Myung Jin Choi, Venkat Chandrasekaran, Alan S. Wil...
AAAI
2007
13 years 6 months ago
Mapping and Revising Markov Logic Networks for Transfer Learning
Transfer learning addresses the problem of how to leverage knowledge acquired in a source domain to improve the accuracy and speed of learning in a related target domain. This pap...
Lilyana Mihalkova, Tuyen N. Huynh, Raymond J. Moon...