By Topic

Parallel MCE reasoning and Boltzmann-Jeffrey machine 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
$33 $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

1 Author(s)
W. X. Wen ; Dept. of Comput. Sci., Melbourne Univ., Parkville, Vic., Australia

A parallel computational model reasoning under uncertainty, i.e. a network of Boltzmann-Jeffrey machines, is proposed based on an application of the principle of minimum cross entropy (MCE) to recursive causal models. The efficiency of the proposed model is analyzed, and a simple comparison is given for this model and some other similar models, such as Bayesian networks and connectionist networks. The proposed model can be used not only in conventional RCNets (recursive causal networks) but also in some more general networks. There may be even some small directed cycles included inside each RCNDL (recursive causal network description language) clause if only they do not violate the conditional independence among the clauses. In addition to Jeffrey's rule, some more general minimum cross entropy techniques can also be included. Reasoning in all directions is allowed. The result obtained by this method can be guaranteed to be as accurate as that obtained with the Bayesian method. The method is quite efficient for applications with large sparse probabilistic spaces if sufficient hardware resources are available

Published in:

Intelligent Control, 1988. Proceedings., IEEE International Symposium on

Date of Conference:

24-26 Aug 1988