Lazy propagation: A junction tree inference algorithm based on lazy evaluation

DOI10.1016/S0004-3702(99)00062-4zbMATH Open0939.68848OpenAlexW2078712199MaRDI QIDQ1978384FDOQ1978384

Yanyan Li

Publication date: 4 June 2000

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0004-3702(99)00062-4

Recommendations

• On the tree structure used by lazy propagation for inference in Bayesian networks
• scientific article; zbMATH DE number 1222281
• scientific article
• A FACTORIZED REPRESENTATION OF INDEPENDENCE OF CAUSAL INFLUENCE AND LAZY PROPAGATION

zbMATH Keywords

Bayesian networksprobabilistic inferencejunction trees

Mathematics Subject Classification ID

Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)

Cited In (37)

• Novel strategies to approximate probability trees in penniless propagation
• An approach to hybrid probabilistic models
• Improvements to variable elimination and symbolic probabilistic inference for evaluating influence diagrams
• LEARNING BAYESIAN NETWORK PARAMETERS FROM SOFT DATA
• A greedy approach for a rolling stock management problem using multi-interval constraint propagation. A greedy approach for a rolling stock management problem using multi-interval constraint propagation, ROADEF/EURO challenge 2014
• Title not available (Why is that?)
• Title not available (Why is that?)
• Incremental Junction Tree Inference
• Efficient probabilistic inference in Bayesian networks with multi-valued NIN-AND tree local models
• Belief update in CLG Bayesian networks with lazy propagation
• Probabilistic inference with noisy-threshold models based on a CP tensor decomposition
• A comparison of different marginalization operations in simple propagation
• Compression of General Bayesian Net CPTs
• Speeding-up structured probabilistic inference using pattern mining
• On-line alert systems for production plants: A conflict based approach
• A simple graphical approach for understanding probabilistic inference in Bayesian networks
• On Directed and Undirected Propagation Algorithms for Bayesian Networks
• Solving linear-quadratic conditional Gaussian influence diagrams
• Solution Enumeration by Optimality in Answer Set Programming
• Computational social choice for coordination in agent networks
• An extended depth-first search algorithm for optimal triangulation of Bayesian networks
• Scalable importance sampling estimation of Gaussian mixture posteriors in Bayesian networks
• Bayesian network inference using marginal trees
• Forensic science and how statistics can help it
• Efficient computation for the noisy MAX
• Fast factorisation of probabilistic potentials and its application to approximate inference in Bayesian networks
• An empirical study of Bayesian network inference with simple propagation
• On conditional truncated densities Bayesian networks
• Lazy evaluation in penniless propagation over join trees
• Structured probabilistic inference
• BAYESIAN NETWORK REVISION WITH PROBABILISTIC CONSTRAINTS
• Using Four Cost Measures to Determine Arc Reversal Orderings
• Estimating mixtures of truncated exponentials in hybrid Bayesian networks
• PRM inference using Jaffray \& Faÿ's local conditioning
• HYBRID PROBABILISTIC SYSTEMS
• Approximate probability propagation with mixtures of truncated exponentials
• Operating with potentials of discrete variables

This page was built for publication: Lazy propagation: A junction tree inference algorithm based on lazy evaluation

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