Sciweavers

791 search results - page 105 / 159
» Learning Probabilistic Ontologies with Distributed Parameter...
Sort
View
ICML
2010
IEEE
13 years 9 months ago
Restricted Boltzmann Machines are Hard to Approximately Evaluate or Simulate
Restricted Boltzmann Machines (RBMs) are a type of probability model over the Boolean cube {-1, 1}n that have recently received much attention. We establish the intractability of ...
Philip M. Long, Rocco A. Servedio
SDM
2003
SIAM
129views Data Mining» more  SDM 2003»
13 years 10 months ago
Approximate Query Answering by Model Averaging
In earlier work we have introduced and explored a variety of different probabilistic models for the problem of answering selectivity queries posed to large sparse binary data set...
Dmitry Pavlov, Padhraic Smyth
ICML
2007
IEEE
14 years 9 months ago
Unsupervised estimation for noisy-channel models
Shannon's Noisy-Channel model, which describes how a corrupted message might be reconstructed, has been the corner stone for much work in statistical language and speech proc...
Markos Mylonakis, Khalil Sima'an, Rebecca Hwa
ICML
2006
IEEE
14 years 9 months ago
A choice model with infinitely many latent features
Elimination by aspects (EBA) is a probabilistic choice model describing how humans decide between several options. The options from which the choice is made are characterized by b...
Carl Edward Rasmussen, Dilan Görür, Fran...
ALT
2003
Springer
14 years 5 months ago
Kernel Trick Embedded Gaussian Mixture Model
In this paper, we present a kernel trick embedded Gaussian Mixture Model (GMM), called kernel GMM. The basic idea is to embed kernel trick into EM algorithm and deduce a parameter ...
Jingdong Wang, Jianguo Lee, Changshui Zhang