Name
Abstract | ||
|---|---|---|
We present a new framework for evaluation of belief networks (BNs). It 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. Whenever new evidence is incorporated, the posterior probability of the query node is re-calculated, 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. Using a best-first method, we can to increase the rate of convergence of the anytime result. |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1007/BFb0035634 | ECSQARU-FAPR |
Keywords | Field | DocType |
practical reasoning,belief networks,anytime algorithms,bayesian networks,graphical models.,uncertainty,anytime evaluation,tree structure,posterior probability,belief network,rate of convergence,graphical model,bayesian network | Polytree,Inference,Computer science,Algorithm,Posterior probability,Bayesian network,Artificial intelligence,Tree structure,Graphical model,Search problem,Machine learning,Qualitative reasoning | Conference |
Volume | ISSN | ISBN |
1244 | 0302-9743 | 3-540-63095-3 |
Citations | PageRank | References |
3 | 0.45 | 14 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nathalie Jitnah | 1 | 63 | 7.98 |
| Ann E. Nicholson | 2 | 692 | 88.01 |