Complexity of probabilistic reasoning in directed-path singly-connected Bayes networks
نویسندگان
چکیده
منابع مشابه
On the Complexity of Probabilistic Inference in Singly Connected Bayesian Networks
In this paper, we revisit the consensus of computational complexity on exact inference in Bayesian networks. We point out that even in singly connected Bayesian networks, which conventionally are believed to have efficient inference algorithms, the computational complexity is still NP-hard.
متن کاملIndependency Relationships in Singly Connected Networks
Graphical structures such as causal networks or Markov networks are very useful tools for representing irrelevance or independency relationships. Singly connected networks are important speciic cases where there is no more than one undirected path connecting each pair of variables. The aim of this paper is to investigate the kind of properties that a dependency model must verify in order to be ...
متن کاملProbabilistic Reasoning with Naïve Bayes and Bayesian Networks
Bayesian (also called Belief) Networks (BN) are a powerful knowledge representation and reasoning mechanism. BN represent events and causal relationships between them as conditional probabilities involving random variables. Given the values of a subset of these variables (evidence variables) BN can compute the probabilities of another subset of variables (query variables). BN can be created aut...
متن کاملIndependency relationships and learning algorithms for singly connected networks
Graphical structures such as Bayesian networks or Markov networks are very useful tools for representing irrelevance or independency relationships, and they may be used to e ciently perform reasoning tasks. Singly connected networks are important speci ® c cases where there is no more than one undirected path connecting each pair of variables. The aim of this paper is to investigate the kind o...
متن کاملOn Probabilistic Completeness and Expected Complexity of Probabilistic Path Planning
The probabilistic path planner (PPP) is a general planning scheme that yields fast robot path planners for a wide variety of problems, involving, e.g., high degree of freedom articulated robots, nonholonomic robots, and multiple robots. In this paper we go into theoretical aspects regarding the behaviour of PPP. We formulate general properties that guarantee probabilistic completeness of PPP, a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 2003
ISSN: 0004-3702
DOI: 10.1016/s0004-3702(03)00110-3