Learning recursive probability trees from probabilistic potentials

DOI10.1016/j.ijar.2012.06.026zbMath1266.68154WikidataQ57551164 ScholiaQ57551164MaRDI QIDQ2375334

Andrés Cano, Antonio Salmerón, Serafín Moral, Cora B. Pérez-Ariza, Manuel Gómez-Olmedo

Publication date: 13 June 2013

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

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

zbMATH Keywords

Bayesian networks; probability trees; recursive probability trees

Mathematics Subject Classification ID

68T05: Learning and adaptive systems in artificial intelligence

68P05: Data structures

Related Items

New strategies for finding multiplicative decompositions of probability trees, Refining a Bayesian network using a chain event graph

Cites Work

• Unnamed Item
• Conditional independence and chain event graphs
• Mixtures of truncated basis functions
• Approximate inference in Bayesian networks using binary probability trees
• Hill-climbing and branch-and-bound algorithms for exact and approximate inference in credal networks
• Using probability trees to compute marginals with imprecise probabilities
• Importance sampling in Bayesian networks using probability trees.
• Dynamic importance sampling in Bayesian networks based on probability trees
• Symbolic and Quantitative Approaches to Reasoning with Uncertainty
• PROBABILISTIC DECISION GRAPHS — COMBINING VERIFICATION AND AI TECHNIQUES FOR PROBABILISTIC INFERENCE