Probabilistic Inference in Influence Diagrams
arXiv (Cornell University)Published 30 January 2013Open access
Nevin L. Zhang
Citations21
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
This paper is about reducing influence diagram (ID) evaluation into Bayesian network (BN) inference problems. Such reduction is interesting because it enables one to readily use one's favorite BN inference algorithm to efficiently evaluate IDs. Two such reduction methods have been proposed previously (Cooper 1988, Shachter and Peot 1992). This paper proposes a new method. The BN inference problems induced by the mew method are much easier to solve than those induced by the two previous methods.
Keywords
Computer ScienceDecision Sciences
Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference
16,927 Citations1988Judea Pearl
The author provides a coherent explication of probability as a language for reasoning with partial belief and offers a unifying perspective on other AI approaches to uncertainty, such as the Dempster-Shafer formalism, truth maintenance systems, and nonmonotonic logic.
Operations ResearchEvaluating Influence Diagrams
1,276 Citations1986Ross D. Shachter
An algorithm is developed that can evaluate any well-formed influence diagram and determine the optimal policy for its decisions and can be performed using the decision maker's perspective on the problem.
Operations ResearchProbabilistic Inference and Influence Diagrams
498 Citations1988Ross D. Shachter
This work develops algorithms to address questions of inference within a probabilistic model represented as an influence diagram and uses the conditional independence implied by the diagram's structure to determine the information needed to solve a given problem.
Journal of Artificial Intelligence ResearchExploiting Causal Independence in Bayesian Network Inference
438 Citations1996Nevin L. Zhang, David Poole
A notion of causal independence is presented that enables one to further factorize the conditional probabilities into a combination of even smaller factors and consequently obtain a finer-grain factorization of the joint probability.
IEEE Transactions on Systems Man and CyberneticsDynamic programming and influence diagrams
268 Citations1990Joseph A Tatman, R.D. Shachter
By representing value function separability in the structure of the graph of the influence diagram, formulation is simplified and operations on the model can take advantage of the separability, this allows simple exploitation in the value function of a decision problem.
Operations ResearchValuation-Based Systems for Bayesian Decision Analysis
224 Citations1992Prakash P. Shenoy
A new method for representing and solving Bayesian decision problems is proposed, called a valuation-based system and has some similarities to influence diagrams, but unlike influence diagrams which emphasize conditional independence among random variables, valuation- based systems emphasize factorizations of joint probability distributions.
Elsevier eBooksFrom Influence Diagrams to Junction Trees
212 Citations1994Frank Jensen, Finn V. Jensen +1 more
An approach to the solution of decision problems formulated as influence diagrams involves a special triangulation of the underlying graph, the construction of a junction tree with special properties, and a message passing algorithm operating on the junction tree for computation of expected utilities and optimal decision policies.
Uncertainty in Artificial IntelligenceDecision Making Using Probabilistic Inference Methods
160 Citations1992Ross D. Shachter, Mark A. Peot
This paper shows how the developments underlying efficient methods for probabilistic inference can be applied immediately to decision problems, and suggests some simple modifications to the clustering family of algorithms in order to efficiently incorporate decision making capabilities.
International Journal of Approximate ReasoningPotential influence diagrams
50 Citations1994Pierre Ndilikilikesha
This study introduces potential influence diagrams, a generalization of standard influence diagrams in which each chance node is associated with an arbitrary nonnegative function (called a potential) instead of a conditional probability table, and develops a new reduction algorithm for computing optimal strategies.