An Algorithm for Computing Probabilistic Propositions

03/27/2013
by   Gregory F. Cooper, et al.
0

A method for computing probabilistic propositions is presented. It assumes the availability of a single external routine for computing the probability of one instantiated variable, given a conjunction of other instantiated variables. In particular, the method allows belief network algorithms to calculate general probabilistic propositions over nodes in the network. Although in the worst case the time complexity of the method is exponential in the size of a query, it is polynomial in the size of a number of common types of queries.

READ FULL TEXT

page 1

page 4

research
01/30/2013

Dynamic Jointrees

It is well known that one can ignore parts of a belief network when comp...
research
01/30/2013

Logarithmic Time Parallel Bayesian Inference

I present a parallel algorithm for exact probabilistic inference in Baye...
research
08/01/2020

Fast Classical and Quantum Algorithms for Online k-server Problem on Trees

We consider online algorithms for the k-server problem on trees. Chrobak...
research
03/27/2013

A Tractable Inference Algorithm for Diagnosing Multiple Diseases

We examine a probabilistic model for the diagnosis of multiple diseases....
research
10/05/2021

Segre-Driven Radicality Testing

We present a probabilistic algorithm to test if a homogeneous polynomial...
research
08/07/2014

Query DAGs: A Practical Paradigm for Implementing Belief Network Inference

We describe a new paradigm for implementing inference in belief networks...
research
10/19/2012

Approximate Decomposition: A Method for Bounding and Estimating Probabilistic and Deterministic Queries

In this paper, we introduce a method for approximating the solution to i...

Please sign up or login with your details

Forgot password? Click here to reset