An optimal approximation algorithm for Bayesian inference

1997/06/01 by Paul Dagum, Michael Luby · 4 citations
Computer Science · Mathematics · #Algorithm #Approximate inference #Artificial intelligence #Bayesian Modeling and Causal Inference #Bayesian network #Bounded function #Computer science #Conditional probability #Conditional variance #Explainable Artificial Intelligence (XAI) #Inference #Machine Learning and Algorithms #Mathematics #Randomized algorithm #Statistics

paper · pdf · doi:10.1016/s0004-3702(97)00013-1

crossref issued 1997/06/01 · crossref published 1997/06/01 · crossref published-print 1997/06/01 · openalex publication_date 1997/06/01 · crossref created 2002/07/25 · crossref deposited 2025/09/13 · openalex created_date 2025/10/10 · crossref indexed 2026/06/30 · openalex updated_date 2026/08/01

Citations

• Optimal Monte Carlo Estimation of Belief Network Inference
• A New Algorithm for Finding MAP Assignments to Belief Networks
• Efficient Search-Based Inference for Noisy-OR Belief Networks:\n TopEpsilon
• The computational complexity of probabilistic inference using bayesian belief networks
• Approximating probabilistic inference in Bayesian belief networks is NP-hard

Cited by

• Measuring the Hardness of Stochastic Sampling on Bayesian Networks with Deterministic Causalities: the k-Test
• Bounding probabilistic relationships in Bayesian networks using qualitative influences: methods and applications
• Evaluation of Bayesian networks with flexible state-space abstraction methods
• Bayesian network [wikipedia]