An approximate nonmyopic computation for value of information
From Semantic Portal Wiki
{{#vardefine:category|Publication}}{{#vardefine:templatename|i.publication}}{{#vardefine:package|smwbp_instance_templates}}
| Edit |
Reference: {{#vardefine:pagename|an approximate nonmyopic computation for value of information }}
- [[]]
bibtex
{{#vardefine:pagename|An approximate nonmyopic computation for value of information }}{{#vardefine:key| }}
abstract: Value-of-information analyses provide a straightforward means for selecting the best next observation to make, and for determining whether it is better to gather additional information or to act immediately. Determining the next best test to perform, given a state of uncertainty about the world, requires a consideration of the value of making all possible sequences of observations. In practice, decision analysts and expert-system designers have avoided the intractability of exact computation of the value of information by relying on a myopic approximation. Myopic analyses are based on the assumption that only one additional test will be performed, even when there is an opportunity to make a large number of observations. We present a nonmyopic approximation for value of information that bypasses the traditional myopic analyses by exploiting the statistical properties of large samples.
download:
- paper:
- slides:
| Abstract | Value-of-information analyses provide a st … Value-of-information analyses provide a straightforward means for selecting the best next observation to make, and for determining whether it is better to gather additional information or to act immediately. Determining the next best test to perform, given a state of uncertainty about the world, requires a consideration of the value of making all possible sequences of observations. In practice, decision analysts and expert-system designers have avoided the intractability of exact computation of the value of information by relying on a myopic approximation. Myopic analyses are based on the assumption that only one additional test will be performed, even when there is an opportunity to make a large number of observations. We present a nonmyopic approximation for value of information that bypasses the traditional myopic analyses by exploiting the statistical properties of large samples. e statistical properties of large samples. |
| Address | University of California, Los Angeles + |
| Author | David Heckerman +, Eric Horvitz +, and Blackford Middleton + |
| Bibtype | techreport + |
| Institution | Knowledge Systems, AI Laboratory + |
| Key | KSL-91-15 + |
| Number | KSL-91-15 + |
| Tag | Computer science + |
| Title | An Approximate Nonmyopic Computation for Value of Information + |
| Tr id | KSL-91-15 + |
| Year | 1991 + |
