A comparison of two approaches for solving unconstrained influence diagrams

DOI10.1016/J.IJAR.2008.08.001MaRDI QIDQ962843zbMATH OpenOpenAlexFDO

Authors Kristian S. Ahlmann-Ohlsen, Thomas D. Nielsen, Ole S. Pedersen, Marta Vomlelová, Finn V. Jensen

Publication date 7 April 2010

Published in International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ijar.2008.08.001

zbMATH Keywords

any-space inferencesolution algorithmsunconstrained influence diagramsvariable elimination

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37)

Recommendations

• An ordered examination of influence diagrams
• scientific article; zbMATH DE number 4115795
• Solving limited memory influence diagrams
• Probabilistic Inference and Influence Diagrams
• Influence diagrams for Bayesian decision analysis

Cites work

• A comparison of graphical techniques for decision analysis
• A forward-backward Monte Carlo method for solving influence diagrams
• AN EXTENSION OF LAZY EVALUATION FOR INFLUENCE DIAGRAMS AVOIDING REDUNDANT VARIABLES IN THE POTENTIALS
• Bayesian Networks and Decision Graphs
• scientific article; zbMATH DE number 2014740 (Why is no real title available?)
• Recursive conditioning
• Representing and solving decision problems with limited information
• Valuation-Based Systems for Bayesian Decision Analysis

Cited in

(10)

• Decision analysis networks
• An integrated approach to solving influence diagrams and finite-horizon partially observable decision processes
• Solving influence diagrams with fuzzy chance and value nodes
• Cost-Sensitive Classification with Unconstrained Influence Diagrams
• An efficient exhaustive anytime sampling algorithm for influence diagrams
• Probabilistic decision graphs for optimization under uncertainty
• Probabilistic decision graphs for optimization under uncertainty
• Improvements to variable elimination and symbolic probabilistic inference for evaluating influence diagrams
• Efficient non-myopic value-of-information computation for influence diagrams
• Variable elimination for influence diagrams with super value nodes

This page was built for publication: A comparison of two approaches for solving unconstrained influence diagrams

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q962843)