scientific article; zbMATH DE number 1553119
From MaRDI portal
Publication:4525198
zbMath0960.68152MaRDI QIDQ4525198
Serafín Moral, Antonio Salmerón, Andrés Cano
Publication date: 16 January 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (19)
New strategies for finding multiplicative decompositions of probability trees ⋮ FAST FACTORISATION OF PROBABILISTIC POTENTIALS AND ITS APPLICATION TO APPROXIMATE INFERENCE IN BAYESIAN NETWORKS ⋮ Ordered valuation algebras: A generic framework for approximating inference ⋮ Learning recursive probability trees from probabilistic potentials ⋮ Using probability trees to compute marginals with imprecise probabilities ⋮ Hill-climbing and branch-and-bound algorithms for exact and approximate inference in credal networks ⋮ Estimating mixtures of truncated exponentials in hybrid Bayesian networks ⋮ Weighted positive binary decision diagrams for exact probabilistic inference ⋮ Approximate inference in Bayesian networks using binary probability trees ⋮ Probabilistic inference with noisy-threshold models based on a CP tensor decomposition ⋮ PROBABILISTIC DECISION GRAPHS — COMBINING VERIFICATION AND AI TECHNIQUES FOR PROBABILISTIC INFERENCE ⋮ Operating with potentials of discrete variables ⋮ Dynamic importance sampling in Bayesian networks based on probability trees ⋮ Structural-EM for learning PDG models from incomplete data ⋮ Novel strategies to approximate probability trees in penniless propagation ⋮ Approximate probability propagation with mixtures of truncated exponentials ⋮ Computing probability intervals with simulated annealing and probability trees ⋮ Binary Probability Trees for Bayesian Networks Inference ⋮ Lazy evaluation in penniless propagation over join trees
Cites Work
This page was built for publication:
