Approximating probabilistic inference in Bayesian belief networks is NP-hard
نویسندگان
چکیده
منابع مشابه
Approximating Probabilistic Inference in Bayesian Belief Networks
A belief network comprises a graphical representation of dependencies between variables of a domain and a set of conditional probabilities associated with each dependency. Unless P=NP, an efficient, exact algorithm does not exist to compute probabilistic inference in belief networks. Stochastic simulation methods, which often improve run times, provide an alternative to exact inference algorith...
متن کاملLearning Bayesian Networks is NP-Hard
Algorithms for learning Bayesian networks from data have two components: a scoring metric and a search procedure. The scoring metric computes a score reeecting the goodness-of-t of the structure to the data. The search procedure tries to identify network structures with high scores. Heckerman et al. (1994) introduced a Bayesian metric, called the BDe metric, that computes the relative posterior...
متن کاملApproximating MAPs for Belief Networks is NP-Hard and Other Theorems
Finding rna.ximum a posteriori (MAP) assignments, also called Most Probable Explanations, is an important problem on Bayesian belief networks. Shimony has shown that finding MAPS is NPhard. In this paper, we show that approximating MAPS with a constant ratio bound is also NP-hard. In addition. we examine the complexity of two related problems which have been mentioned in the literature. We show...
متن کاملApproximating MAX-E3LIN is NP-Hard
This lecture focuses on the MAX-E3LIN problem. We prove that approximating it is NP-hard by a reduction from LABEL-COVER. In the MAX-E3LIN problem, our input is a series of linear equations (mod 2) in n binary variables, each with three terms. Equivalently, one can think of this as ±1 variables and ternary products. The objective is to maximize the fraction of satisfied equations.
متن کاملFinding MAPs for Belief Networks is NP-Hard
Given a probabilistic world model, an important problem is to find the maximum a-posteriori probability (MAP) instantiation of all the random variables given the evidence. Numerous researchers using such models employ some graph representation for the distributions, such as a Bayesian belief network. This representation simplifies the complexity of specifying the distributions from exponential ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 1993
ISSN: 0004-3702
DOI: 10.1016/0004-3702(93)90036-b