723 search results - page 43 / 145 » Learning a Hidden Subgraph |
ICML
2007
IEEE
14 years 9 months ago
2007
IEEE
We generalize the Winnow algorithm for learning disjunctions to learning subspaces of low rank. Subspaces are represented by symmetric projection matrices. The online algorithm ma...
ICML
2010
IEEE
13 years 9 months ago
2010
IEEE
Restricted Boltzmann machines were developed using binary stochastic hidden units. These can be generalized by replacing each binary unit by an infinite number of copies that all ...
ICML
2010
IEEE
13 years 9 months ago
2010
IEEE
We introduce a natural generalization of submodular set cover and exact active learning with a finite hypothesis class (query learning). We call this new problem interactive submo...
ICPR
2010
IEEE
14 years 1 months ago
2010
IEEE
We present a fast and robust graph matching approach for 2D specific object recognition in images. From a small number of training images, a model graph of the object to learn is a...
ECML
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. In this paper we consider latent variable models and introduce a new U-likelihood concept for estimating the distribution over hidden variables. One can derive an estimat...