Probabilistic inference in influence diagrams (1998) [21 citations — 0 self]
Download:
|
|
by Nevin Lianwen Zhang
Computational Intelligence
http://www.cs.ust.hk/~lzhang/paper/pspdf/ci98.ps.gz
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@INPROCEEDINGS{Zhang98probabilisticinference,author = {Nevin Lianwen Zhang},
title = {Probabilistic inference in influence diagrams},
booktitle = {Computational Intelligence},
year = {1998},
pages = {514--522}
}
Years of Citing Articles
Abstract:
This paper is about reducing influence diagram (ID) evaluation into Bayesian network (BN) inference problems that are as easy to solve as possible. Such reduction is interesting because it enables one to readily use one's favorite BN inference algorithm to efficiently evaluate IDs. Two such reduction methods have been proposed previously (Cooper 1988, Shachter and Peot 1992). This paper proposes a new method. The BN inference problems induced by the mew method are much easier to solve than those induced by the two previous methods.
