Ideal Reformulation of Belief Networks
From Tetherless World Wiki
Citation: John S. Breese and Eric Horvitz. (1990) Ideal Reformulation of Belief Networks. In Association for Uncertainty in Artificial Intelligence, 1990.
| Publication inproceedings ( Edit ) | |
| type | InProceedings |
| bibtype | inproceedings |
| Bibtex basics | |
| author | John S. Breese and Eric Horvitz |
| title | Ideal Reformulation of Belief Networks |
| booktitle | Association for Uncertainty in Artificial Intelligence |
| address | Cambridge, MA |
| year | 1990 |
| Bibtex more | |
| Access Paper | |
| abstract | The intelligent reformulation or restructuring of a belief network can greatly increase the efficiency of inference. However, time expended for reformulation is not available for the primary task of performing inference with the network. Thus, given a cost of delay, there is a tradeoff between time dedicated to reformulating the network and time applied to the solution of the formulation. We explore the ideal partition of resources into time for reformulation and time for inference.After describing principles for computing the partition of resources under uncertainty, we discuss empirical work on belief networks. In particular,we determine the ideal amount of time to devote to searching for optimal clusters in belief networks. Given a preference model, describing the value of a solution as a function of the delay needed for its computation,our system selects an ideal time to devote to reformulation. |
| KSL Technical Report ID: KSL-90-28 |
Facts about Ideal Reformulation of Belief NetworksRDF feed
| Abstract | The intelligent reformulation or restructu … The intelligent reformulation or restructuring of a belief network can greatly increase the efficiency of inference. However, time expended for reformulation is not available for the primary task of performing inference with the network. Thus, given a cost of delay, there is a tradeoff between time dedicated to reformulating the network and time applied to the solution of the formulation. We explore the ideal partition of resources into time for reformulation and time for inference.After describing principles for computing the partition of resources under uncertainty, we discuss empirical work on belief networks. In particular,we determine the ideal amount of time to devote to searching for optimal clusters in belief networks. Given a preference model, describing the value of a solution as a function of the delay needed for its computation,our system selects an ideal time to devote to reformulation. an ideal time to devote to reformulation. |
| Address | Cambridge, MA + |
| Author | John S. Breese and Eric Horvitz + |
| Bibtype | inproceedings + |
| Booktitle | Association for Uncertainty in Artificial Intelligence + |
| Has author | John S. Breese and Eric Horvitz + |
| Has identifier | KSL-90-28 + |
| Has publishing details | 1990 + |
| Has title | Ideal Reformulation of Belief Networks + |
| Has where published | Association for Uncertainty in Artificial Intelligence + |
| Has year | 1990 + |
| Ksl tr id | KSL-90-28 + |
| Process note | NO + |
| Title | Ideal Reformulation of Belief Networks + |
| Year | 1990 + |
