Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

An Implementation of a Method for Computing the Uncertainty in Inferred Probabilities in Belief Networks (1303.1489v1)

Published 6 Mar 2013 in cs.AI

Abstract: In recent years the belief network has been used increasingly to model systems in Al that must perform uncertain inference. The development of efficient algorithms for probabilistic inference in belief networks has been a focus of much research in AI. Efficient algorithms for certain classes of belief networks have been developed, but the problem of reporting the uncertainty in inferred probabilities has received little attention. A system should not only be capable of reporting the values of inferred probabilities and/or the favorable choices of a decision; it should report the range of possible error in the inferred probabilities and/or choices. Two methods have been developed and implemented for determining the variance in inferred probabilities in belief networks. These methods, the Approximate Propagation Method and the Monte Carlo Integration Method are discussed and compared in this paper.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (4)
  1. Peter Che (1 paper)
  2. Richard E. Neapolitan (5 papers)
  3. James Kenevan (4 papers)
  4. Martha Evens (1 paper)
Citations (5)

Summary

We haven't generated a summary for this paper yet.