Computational Complexity Reduction for BN2O Networks Using Similarity of States

by   Alexander V. Kozlov, et al.

Although probabilistic inference in a general Bayesian belief network is an NP-hard problem, computation time for inference can be reduced in most practical cases by exploiting domain knowledge and by making approximations in the knowledge representation. In this paper we introduce the property of similarity of states and a new method for approximate knowledge representation and inference which is based on this property. We define two or more states of a node to be similar when the ratio of their probabilities, the likelihood ratio, does not depend on the instantiations of the other nodes in the network. We show that the similarity of states exposes redundancies in the joint probability distribution which can be exploited to reduce the computation time of probabilistic inference in networks with multiple similar states, and that the computational complexity in the networks with exponentially many similar states might be polynomial. We demonstrate our ideas on the example of a BN2O network -- a two layer network often used in diagnostic problems -- by reducing it to a very close network with multiple similar states. We show that the answers to practical queries converge very fast to the answers obtained with the original network. The maximum error is as low as 5 only 10



There are no comments yet.


page 1

page 2

page 6

page 8


Optimal Decomposition of Belief Networks

In this paper, optimum decomposition of belief networks is discussed. So...

Marginalization in Bayesian Networks: Integrating Exact and Approximate Inference

Bayesian Networks are probabilistic graphical models that can compactly ...

A Differential Approach to Inference in Bayesian Networks

We present a new approach for inference in Bayesian networks, which is m...

An Empirical Evaluation of a Randomized Algorithm for Probabilistic Inference

In recent years, researchers in decision analysis and artificial intelli...

Manipulating Node Similarity Measures in Network

Node similarity measures quantify how similar a pair of nodes are in a n...

Tractable Inference for Complex Stochastic Processes

The monitoring and control of any dynamic system depends crucially on th...

Approaching Adaptation Guided Retrieval in Case-Based Reasoning through Inference in Undirected Graphical Models

In Case-Based Reasoning, when the similarity assumption does not hold, t...
This week in AI

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