Abstraction for Ef ciently Computing Most Probable Explanations in Bayesian Networks
نویسنده
چکیده
ion for Ef ciently Computing Most Probable Explanations in Bayesian Networks Ole J. Mengshoel Carnegie Mellon University NASA Ames Research Center Mail Stop 269-3 Moffett Field, CA 94035 [email protected]
منابع مشابه
DisTriB: Distributed Trust Management Model Based on Gossip Learning and Bayesian Networks in Collaborative Computing Systems
The interactions among peers in Peer-to-Peer systems as a distributed collaborative system are based on asynchronous and unreliable communications. Trust is an essential and facilitating component in these interactions specially in such uncertain environments. Various attacks are possible due to large-scale nature and openness of these systems that affects the trust. Peers has not enough inform...
متن کاملDisTriB: Distributed Trust Management Model Based on Gossip Learning and Bayesian Networks in Collaborative Computing Systems
The interactions among peers in Peer-to-Peer systems as a distributed collaborative system are based on asynchronous and unreliable communications. Trust is an essential and facilitating component in these interactions specially in such uncertain environments. Various attacks are possible due to large-scale nature and openness of these systems that affects the trust. Peers has not enough inform...
متن کاملA Computational Model of Motor Areas Based on Bayesian Networks and Most Probable Explanations
We describe a computational model of motor areas of the cerebral cortex. The model combines Bayesian networks, competitive learning and reinforcement learning. We found that decision-making using MPE (Most Probable Explanation) approximates the ideal decisionmaking in this model, which suggests that MPE calculation is a promising model of not only sensory-cortex recognition, already addressed b...
متن کاملMost probable explanations in Bayesian networks: Complexity and tractability
An overview is given of definitions and complexity results of a number of variants of the problem of probabilistic inference of the most probable explanation of a set of hypotheses given observed phenomena.
متن کاملSimplifying Explanations in Bayesian Belief Networks
Abductive inference in Bayesian belief networks is intended as the process of generating the K most probable conngurations given an observed evidence. These conngurations are called explanations and in most of the approaches found in the literature, all the explanations have the same number of literals. In this paper we study how to simplify the explanations in such a way that the resulting con...
متن کامل