Sciweavers

IJAR
2006
125views more  IJAR 2006»
13 years 11 months ago
Compiling relational Bayesian networks for exact inference
We describe in this paper a system for exact inference with relational Bayesian networks as defined in the publicly available Primula tool. The system is based on compiling propos...
Mark Chavira, Adnan Darwiche, Manfred Jaeger
IJCAI
2003
14 years 7 days ago
First-order probabilistic inference
Most probabilistic inference algorithms are specified and processed on a propositional level. In the last decade, many proposals for algorithms accepting first-order specificat...
David Poole
IJCAI
2003
14 years 7 days ago
Optimal Time-Space Tradeoff in Probabilistic Inference
Recursive Conditioning, RC, is an any-space algorithm lor exact inference in Bayesian networks, which can trade space for time in increments of the size of a floating point number...
David Allen, Adnan Darwiche
AAAI
2006
14 years 8 days ago
An Edge Deletion Semantics for Belief Propagation and its Practical Impact on Approximation Quality
We show in this paper that the influential algorithm of iterative belief propagation can be understood in terms of exact inference on a polytree, which results from deleting enoug...
Arthur Choi, Adnan Darwiche
UAI
2008
14 years 8 days ago
Efficient Inference in Persistent Dynamic Bayesian Networks
Numerous temporal inference tasks such as fault monitoring and anomaly detection exhibit a persistence property: for example, if something breaks, it stays broken until an interve...
Tomás Singliar, Denver Dash
NIPS
2007
14 years 8 days ago
Discovering Weakly-Interacting Factors in a Complex Stochastic Process
Dynamic Bayesian networks are structured representations of stochastic processes. Despite their structure, exact inference in DBNs is generally intractable. One approach to approx...
Charlie Frogner, Avi Pfeffer
NIPS
2008
14 years 8 days ago
The Recurrent Temporal Restricted Boltzmann Machine
The Temporal Restricted Boltzmann Machine (TRBM) is a probabilistic model for sequences that is able to successfully model (i.e., generate nice-looking samples of) several very hi...
Ilya Sutskever, Geoffrey E. Hinton, Graham W. Tayl...
ACL
2008
14 years 9 days ago
Forest Reranking: Discriminative Parsing with Non-Local Features
Conventional n-best reranking techniques often suffer from the limited scope of the nbest list, which rules out many potentially good alternatives. We instead propose forest reran...
Liang Huang
AI
2006
Springer
14 years 2 months ago
An Improved LAZY-AR Approach to Bayesian Network Inference
We propose LAZY arc-reversal with variable elimination (LAZY-ARVE) as a new approach to probabilistic inference in Bayesian networks (BNs). LAZY-ARVE is an improvement upon LAZY ar...
Cory J. Butz, Shan Hua
AI
1998
Springer
14 years 3 months ago
Temporally Invariant Junction Tree for Inference in Dynamic Bayesian Network
Abstract. Dynamic Bayesian networks (DBNs) extend Bayesian networks from static domains to dynamic domains. The only known generic method for exact inference in DBNs is based on dy...
Yang Xiang