Myopic value of information in influence diagrams

  • Authors:
  • Søren L. Dittmer;Finn V. Jensen

  • Affiliations:
  • DINA Skejby, The Danish Agricultural Advisory Centre, Skejby, Denmark;Department of Computer Science, Aalborg University, Denmark

  • Venue:
  • UAI'97 Proceedings of the Thirteenth conference on Uncertainty in artificial intelligence
  • Year:
  • 1997

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present a method for calculation of myopic value of information in influence diagrams (Howard & Matheson, 1981) based on the strong junction tree framework (Jensen et al., 1994). An influence diagram specifies a certain order of observations and decisions through its structure. This order is reflected in the corresponding junction trees by the order in which the nodes are marginalized. This order of marginalization can be changed by table expansion and use of control structures, and this facilitates for calculating the expected value of information for different information scenarios within the same junction tree. In effect, a strong junction tree with expanded tables may be used for calculating the value of information between several scenarios with different observation-decision order. We compare our method to other methods for calculating the value of information in influence diagrams.