Sciweavers

12 search results - page 2 / 3
» Learning, Regularization and Ill-Posed Inverse Problems
Sort
View
UAI
2008
13 years 11 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
PKDD
2010
Springer
158views Data Mining» more  PKDD 2010»
13 years 8 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
ESANN
2004
13 years 11 months ago
Sparse LS-SVMs using additive regularization with a penalized validation criterion
This paper is based on a new way for determining the regularization trade-off in least squares support vector machines (LS-SVMs) via a mechanism of additive regularization which ha...
Kristiaan Pelckmans, Johan A. K. Suykens, Bart De ...
NIPS
2004
13 years 11 months ago
Surface Reconstruction using Learned Shape Models
We consider the problem of geometrical surface reconstruction from one or several images using learned shape models. While humans can effortlessly retrieve 3D shape information, t...
Jan Erik Solem, Fredrik Kahl
ICML
2005
IEEE
14 years 10 months ago
Harmonic mixtures: combining mixture models and graph-based methods for inductive and scalable semi-supervised learning
Graph-based methods for semi-supervised learning have recently been shown to be promising for combining labeled and unlabeled data in classification problems. However, inference f...
Xiaojin Zhu, John D. Lafferty