DocumentCode :
874689
Title :
An approximate nonmyopic computation for value of information
Author :
Heckerman, David ; Horvitz, Eric ; Middleton, Blackford
Author_Institution :
Dept. of Comput. Sci., California Univ., Los Angeles, CA, USA
Volume :
15
Issue :
3
fYear :
1993
fDate :
3/1/1993 12:00:00 AM
Firstpage :
292
Lastpage :
298
Abstract :
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
Keywords :
belief maintenance; decision theory; information theory; probability; approximate nonmyopic computation; belief networks; decision theory; information value; probability; Computer science; Diagnostic expert systems; Diseases; Information analysis; Laboratories; Medical diagnostic imaging; Performance analysis; Performance evaluation; System testing; Uncertainty;
fLanguage :
English
Journal_Title :
Pattern Analysis and Machine Intelligence, IEEE Transactions on
Publisher :
ieee
ISSN :
0162-8828
Type :
jour
DOI :
10.1109/34.204912
Filename :
204912
Link To Document :
بازگشت