Name
Abstract | ||
|---|---|---|
In previous work we have introduced dynamic limited-memory influence diagrams (DLIM- IDs) as an extension of LIMIDs aimed at representing infinite-horizon decision processes. If a DLIMID respects the first-order Markov assumption then it can be represented by 2TLIMIDS. Given that the treatment selection algorithm for LIMIDs, called single policy updating (SPU), can be infeasible even for small finite-horizon models, we propose two alternative algorithms for treatment selection with 2TLIMIDS. First, single rule updating (SRU) is a hill-climbing method inspired upon SPU which needs not iterate exhaustively over all possible policies at each decision node. Second, a simulated annealing algorithm can be used to avoid the local-maximum policies found by SPU and SRU. |
Year | Venue | Keywords |
|---|---|---|
2006 | Probabilistic Graphical Models | hill climbing,simulated annealing algorithm,influence diagram,first order |
DocType | Citations | PageRank |
Conference | 1 | 0.36 |
References | Authors | |
3 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Marcel Van Gerven | 1 | 321 | 39.35 |
| Francisco Javier Díez | 2 | 150 | 18.73 |