Logarithmic-Time Updates and Queries in Probabilistic Networks

by   Arthur L. Delcher, et al.

In this paper we propose a dynamic data structure that supports efficient algorithms for updating and querying singly connected Bayesian networks (causal trees and polytrees). In the conventional algorithms, new evidence in absorbed in time O(1) and queries are processed in time O(N), where N is the size of the network. We propose a practical algorithm which, after a preprocessing phase, allows us to answer queries in time O(log N) at the expense of O(logn N) time per evidence absorption. The usefulness of sub-linear processing time manifests itself in applications requiring (near) real-time response over large probabilistic databases.



page 1

page 2

page 8


Succinct data structure for dynamic trees with faster queries

Navarro and Sadakane [TALG 2014] gave a dynamic succinct data structure ...

Enumeration on Trees with Tractable Combined Complexity and Efficient Updates

We give an algorithm to enumerate the results on trees of monadic second...

Workload-Aware Materialization of Junction Trees

Bayesian networks are popular probabilistic models that capture the cond...

Query the model: precomputations for efficient inference with Bayesian Networks

We consider a setting where a Bayesian network has been built over a rel...

Dynamic Suffix Array with Polylogarithmic Queries and Updates

The suffix array SA[1..n] of a text T of length n is a permutation of {1...

Exploring Localization in Bayesian Networks for Large Expert Systems

Current Bayesian net representations do not consider structure in the do...

Learning Bayesian Nets that Perform Well

A Bayesian net (BN) is more than a succinct way to encode a probabilisti...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.