Name
Abstract | ||
|---|---|---|
In the original formulation of influence diagrams (IDs), each model contained exactly one utility node. In 1990, Tatman and Shachtar introduced the possibility of having super value nodes that represent a combination of their parents' utility functions. They also proposed an arc-reversal algorithm for IDs with super value nodes. In this paper we propose a variable-elimination algorithm for influence diagrams with super value nodes which is faster in most cases, requires less memory in general, introduces much fewer redundant (i.e., unnecessary) variables in the resulting policies, may simplify sensitivity analysis, and can speed up inference in IDs containing canonical models, such as the noisy OR. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1016/j.ijar.2009.11.004 | Int. J. Approx. Reasoning |
Keywords | Field | DocType |
original formulation,utility function,super value nodes,utility node,super value node,variable-elimination algorithm,variable elimination,influence diagram,canonical model,fewer redundant,sensitivity analysis,arc-reversal algorithm,influence diagrams | Variable elimination,Inference,Algorithm,Canonical model,Influence diagram,Redundancy (engineering),Mathematics,Utility theory,Speedup | Journal |
Volume | Issue | ISSN |
51 | 6 | International Journal of Approximate Reasoning |
Citations | PageRank | References |
3 | 0.49 | 21 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Manuel Luque | 1 | 6 | 1.34 |
| Francisco Javier Díez | 2 | 150 | 18.73 |