1988
DOI: 10.1287/opre.36.4.589
|View full text |Cite
|
Sign up to set email alerts
|

Probabilistic Inference and Influence Diagrams

Abstract: An influence diagram is a network representation for probabilistic and decision analysis models. The nodes correspond to variables which can be constants, uncertain quantities, decisions, or objectives. The arcs reveal the probabilistic dependence of the uncertain quantities and the information available at the time of the decisions. The detailed data about the variables are stored within the nodes, so the diagram graph is compact and focuses attention on the relationships among the variables. Influence diagra… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
232
0
9

Year Published

1992
1992
2009
2009

Publication Types

Select...
3
3
3

Relationship

0
9

Authors

Journals

citations
Cited by 403 publications
(241 citation statements)
references
References 9 publications
0
232
0
9
Order By: Relevance
“…This system is based on the Context-based Influence Diagram model (CID model) [13], which is supported by Influence Diagrams and Bayesian networks [14,15]. These are probabilistic graphical models specially designed for decision problems in uncertain environments.…”
Section: The Search Engine: Garnatamentioning
confidence: 99%
See 1 more Smart Citation
“…This system is based on the Context-based Influence Diagram model (CID model) [13], which is supported by Influence Diagrams and Bayesian networks [14,15]. These are probabilistic graphical models specially designed for decision problems in uncertain environments.…”
Section: The Search Engine: Garnatamentioning
confidence: 99%
“…This is the case of our search engine, Garnata [4]. This piece of software is based on Probabilistic Graphical Models, more precisely on Influence Diagram and the corresponding underlying Bayesian networks [14,15]. This paper is devoted to the development of an RF module for Garnata, and is focused on the simplest case of XML RF, namely CO-CO.…”
Section: Introductionmentioning
confidence: 99%
“…Among the most popular are Shachter's [1988] method of node elimination, Lauritzen and Spiegelhalter's [1988] method of clique-tree propagation, and the method of loop-cut conditioning [Pearl 1988, Ch. 4.3].…”
Section: Inference Algorithmsmentioning
confidence: 99%
“…Like in the past year, we have participated in the Ad hoc Track with an experimental platform to perform structured retrieval using Probabilistic Graphical Models [5,8,10], called Garnata [4].…”
Section: Introductionmentioning
confidence: 99%