Using binary trees for the evaluation of influence diagrams

DOI10.1142/S0218488516500045MaRDI QIDQ4600507zbMATH OpenOpenAlexFDO

Authors Rafael Cabañas, Manuel Gómez-Olmedo, Andrés Cano

Publication date 11 January 2018

Published in International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0218488516500045

zbMATH Keywords

probabilistic graphical modelsapproximate computationinfluence diagramsvariable eliminationcontext-specific independencies

Mathematics Subject Classification ID

Decision theory (91B06) Trees (05C05)

Recommendations

• Binary Probability Trees for Bayesian Networks Inference
• Approximate inference in Bayesian networks using binary probability trees
• Improvements to variable elimination and symbolic probabilistic inference for evaluating influence diagrams
• Applying numerical trees to evaluate asymmetric decision problems
• A forward-backward Monte Carlo method for solving influence diagrams

Cited in

(6)

• On SPI for evaluating influence diagrams
• Strategy Graphs for Influence Diagrams
• Influence measures for CART classification trees
• An improved method for solving hybrid influence diagrams
• Approximate inference in Bayesian networks using binary probability trees
• Binary Probability Trees for Bayesian Networks Inference

This page was built for publication: Using binary trees for the evaluation of influence diagrams

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