Any Time Probabilistic
- ContentsAbstract ixAcknowledgements xi
We present a new framework for implementing evaluation of belief networks (BNs), which consists of two steps: (1) transforming a belief network into a tree structure called a treeNet (2) performing anytime inference by searching the treeNet. The root of the treeNet represents the query node. Once the treeNet has been constructed, whenever new evidence is incorporated, the posterior probability of the query node is recalculated , using a variation of the polytree message-passing algorithm. The treeNet framework is geared towards anytime evaluation. Evaluating the treeNet is a tree search problem and we investigate different tree search strategies. By using a best-rst method, we are able to increase the rate of convergence of the anytime result.