By Topic

Evaluating Bayes nets with concurrent process networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Tick, E. ; Dept. of Comput. Sci., Oregon Univ., Eugene, OR, USA ; D'Ambrosio, B.

The computation complexity of the total probability mass of a leaf node of a general Bayes network can be exponential in the number of ancestor nodes of that leaf. It is a well known result that for a large class of networks, a number of minterms only linear in the number of ancestor nodes contributes about 67% of the total probability mass. The problem of Bayes net search is to generate only these high mass minterms. We introduce a concurrent algorithm for attempting this, based on converting the net into a concurrent process network. Each parent node sends messages containing partial minterms to child nodes. The novel idea is to prioritize these messages to give higher weight to partial terms that are likely candidates for inclusion in the final high mass minterms. We have implemented this algorithm in KL1 and discuss its attributes

Published in:

Parallel Processing Symposium, 1995. Proceedings., 9th International

Date of Conference:

25-28 Apr 1995