Cost-Sharing in Bayesian Knowledge Bases

02/06/2013
by   Solomon Eyal Shimony, et al.
0

Bayesian knowledge bases (BKBs) are a generalization of Bayes networks and weighted proof graphs (WAODAGs), that allow cycles in the causal graph. Reasoning in BKBs requires finding the most probable inferences consistent with the evidence. The cost-sharing heuristic for finding least-cost explanations in WAODAGs was presented and shown to be effective by Charniak and Husain. However, the cycles in BKBs would make the definition of cost-sharing cyclic as well, if applied directly to BKBs. By treating the defining equations of cost-sharing as a system of equations, one can properly define an admissible cost-sharing heuristic for BKBs. Empirical evaluation shows that cost-sharing improves performance significantly when applied to BKBs.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

01/05/2013

Knowledge Sharing: A Model

We know anything because we learn about it, there is anything we ever sh...
03/27/2013

Uncertainty and Incompleteness

Two major difficulties in using default logics are their intractability ...
10/16/2012

An Improved Admissible Heuristic for Learning Optimal Bayesian Networks

Recently two search algorithms, A* and breadth-first branch and bound (B...
05/21/2021

Finding All Bounded-Length Simple Cycles in a Directed Graph

A new efficient algorithm is presented for finding all simple cycles tha...
12/02/2019

Implicit Priors for Knowledge Sharing in Bayesian Neural Networks

Bayesian interpretations of neural network have a long history, dating b...
11/15/2021

Bayesian modelling and computation utilising cycles in multiple network data

Modelling multiple network data is crucial for addressing a wide range o...
This week in AI

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