235 search results - page 1 / 47 » Compiling Bayesian Networks Using Variable Elimination |
IJCAI
2007
13 years 6 months ago
2007
Compiling Bayesian networks has proven an effective approach for inference that can utilize both global and local network structure. In this paper, we define a new method of comp...
AAAI
2006
13 years 6 months ago
2006
The MAP (maximum a posteriori hypothesis) problem in Bayesian networks is to find the most likely states of a set of variables given partial evidence on the complement of that set...
FLAIRS
2009
13 years 2 months ago
2009
We compare two approaches to Bayesian network inference, called variable elimination (VE) and arc reversal (AR). It is established that VE never requires more space than AR, and n...
CL
2000
Springer
13 years 8 months ago
2000
Springer
We use Kleene algebra with tests to verify a wide assortment of common compiler optimizations, including dead code elimination, common subexpression elimination, copy propagation,...
ECSQARU
2007
Springer
13 years 10 months ago
2007
Springer
This paper presents a new approach to inference in Bayesian networks. The principal idea is to encode the network by logical sentences and to compile the resulting encoding into an...