Probabilistic Inference in Influence Diagrams
Nevin Lianwen Zhang:
N. L. Zhang
Hong Kong University of Science and Technology
Clear Water Bay Road
Kowloon, Hong Kong
e-mail: EMAIL ADDRESS
Phone: (+852)-2358-7015
FAX : (+852)-2358-1477
Abstract:
This paper is about reducing influence diagram (ID) evaluation
into Bayesian network (BN) inference problems.
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.
Keywords:
Decision analysis, influence diagrams,
Bayesian networks, inference.
Availability:
This paper is also available in
PostScript
format.
