Sciweavers

339 search results - page 17 / 68
» Approximate Inference in Probabilistic Graphical Models with...
Sort
View
66
Voted
CG
2006
Springer
15 years 1 months ago
A Retrograde Approximation Algorithm for One-Player Can't Stop
Abstract. A one-player, finite, probabilistic game with perfect information can be presented as a bipartite graph. For one-player Can't Stop, the graph is cyclic and the chall...
James Glenn, Haw-ren Fang, Clyde P. Kruskal
UAI
2004
14 years 11 months ago
Graph Partition Strategies for Generalized Mean Field Inference
An autonomous variational inference algorithm for arbitrary graphical models requires the ability to optimize variational approximations over the space of model parameters as well...
Eric P. Xing, Michael I. Jordan
ICMI
2005
Springer
215views Biometrics» more  ICMI 2005»
15 years 3 months ago
Multimodal multispeaker probabilistic tracking in meetings
Tracking speakers in multiparty conversations constitutes a fundamental task for automatic meeting analysis. In this paper, we present a probabilistic approach to jointly track th...
Daniel Gatica-Perez, Guillaume Lathoud, Jean-Marc ...
AAAI
2004
14 years 11 months ago
Bayesian Inference on Principal Component Analysis Using Reversible Jump Markov Chain Monte Carlo
Based on the probabilistic reformulation of principal component analysis (PCA), we consider the problem of determining the number of principal components as a model selection prob...
Zhihua Zhang, Kap Luk Chan, James T. Kwok, Dit-Yan...
NIPS
2003
14 years 11 months ago
Sample Propagation
Rao–Blackwellization is an approximation technique for probabilistic inference that flexibly combines exact inference with sampling. It is useful in models where conditioning o...
Mark A. Paskin