Name
Abstract | ||
|---|---|---|
An Influence Diagram is a probabilistic graphical model used to represent and solve decision problems under uncertainty. Its evaluation requires to perform a series of combinations and marginalizations with the potentials attached to the Influence Diagram. Finding an optimal order for these operations, which is NP-hard, is an element of crucial importance for the efficiency of the evaluation. The SPI algorithm considers the evaluation as a combinatorial factorization problem. In this paper, we describe how the principles of SPI can be used to solve Influence Diagrams. We also include an evaluation of different combination selection heuristics and a comparison with the variable elimination algorithm. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1007/978-3-319-08795-5_52 | Communications in Computer and Information Science |
Keywords | Field | DocType |
Influence Diagrams,Combinatorial Factorization Problem,Exact Evaluation,Heuristic Algorithm | Mathematical optimization,Decision problem,Variable elimination,Heuristic (computer science),Computer science,Heuristics,Influence diagram,Factorization,Probabilistic logic,Graphical model | Conference |
Volume | ISSN | Citations |
442 | 1865-0929 | 2 |
PageRank | References | Authors |
0.38 | 10 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rafael Cabañas | 1 | 16 | 5.09 |
| Anders L. Madsen | 2 | 384 | 40.41 |
| Andrés Cano | 3 | 193 | 20.06 |
| Manuel Gómez-Olmedo | 4 | 61 | 11.98 |