Issue No. 03 - March (1993 vol. 15)

ISSN: 0162-8828

pp: 292-298

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.204912

ABSTRACT

<p>It is argued that decision analysts and expert-system designers have avoided the intractability of exact computation of the value of information by relying on a myopic assumption that only one additional test will be performed, even when there is an opportunity to make large number of observations. An alternative to the myopic analysis is presented. In particular, an approximate method for computing the value of information of a set of tests, which exploits the statistical properties of large samples, is given. The approximation is linear in the number of tests, in contrast with the exact computation, which is exponential in the number of tests. The approach is not as general as in a complete nonmyopic analysis, in which all possible sequences of observations are considered. In addition, the approximation is limited to specific classes of dependencies among evidence and to binary hypothesis and decision variables. Nonetheless, as demonstrated with a simple application, the approach can offer an improvement over the myopic analysis.</p>

INDEX TERMS

belief networks; decision theory; information value; probability; approximate nonmyopic computation; belief maintenance; decision theory; information theory; probability

CITATION

D. Heckerman, E. Horvitz, B. Middleton, "An Approximate Nonmyopic Computation for Value of Information",

*IEEE Transactions on Pattern Analysis & Machine Intelligence*, vol. 15, no. , pp. 292-298, March 1993, doi:10.1109/34.204912CITATIONS