697 search results - page 45 / 140 » Learning a Hidden Hypergraph |
ICML
2010
IEEE
14 years 11 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
14 years 11 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...
123
click to vote
SDM
2012
SIAM
13 years 5 days ago
2012
SIAM
Objects linking with many other objects in an information network may imply various semantic relationships. Uncovering such knowledge is essential for role discovery, data cleanin...
ECML
2005
Springer
15 years 3 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...
109
click to vote
NIPS
1993
14 years 11 months ago
1993
The non-linear complexities of neural networks make network solutions difficult to understand. Sanger's contribution analysis is here extended to the analysis of networks aut...