The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
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 diagrams are effective communication tools and recent developments also allow them to be used for analysis. We develop algorithms to address questions of inference within a probabilistic model represented as an influence diagram. We use the conditional independence implied by the diagram's structure to determine the information needed to solve a given problem. When there is enough information we can solve it, exploiting that conditional independence. These same results are applied to problems of decision analysis. This methodology allows the construction of computer tools to maintain and evaluate complex models.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Bellman, R. E. (2010) · doi:10.1515/9781400835386 · Cited by 14,588
Combinatorial optimization: networks and matroids
Lawler, E. L. (2021) · Cited by 3,310
Fusion, propagation, and structuring in belief networks
Pearl, J. (1986) · Artificial Intelligence · doi:10.1016/0004-3702(86)90072-x · Cited by 2,127
Shachter, R. D. (1986) · Operations Research · doi:10.1287/opre.34.6.871 · Cited by 1,250
Self-citationPropagating Uncertainty in Bayesian Networks by Probabilistic Logic Sampling
(1988) · Machine Intelligence and Pattern Recognition · doi:10.1016/b978-0-444-70396-5.50019-4 · Cited by 548
Rational Descriptions, Decisions and Designs
(1969) · Elsevier eBooks · doi:10.1016/c2013-0-01558-7 · Cited by 470
Holtzman, S. (1989) · European Journal of Operational Research · doi:10.1016/0377-2217(89)90415-3 · Cited by 271
Development of Automated Aids for Decision Analysis
Miller, A. C., Merkhofer, I. I. I., Howard Miley, W., Matheson Ronald, A., Rice James, E., & Thomas, R. (1976) · Defense Technical Information Center (DTIC) · doi:10.21236/ada026379 · Cited by 74
Cited by
A Bayesian method for the induction of probabilistic networks from data
Cooper, G. F., & Herskovits, E. (1992) · Machine Learning · doi:10.1007/bf00994110 · Cited by 4,204
Lauritzen, S. L., & Spiegelhalter, D. J. (1988) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1988.tb01721.x · Cited by 3,902
A Tutorial on Learning with Bayesian Networks
Heckerman, D. (2008) · Studies in Computational Intelligence · doi:10.1007/978-3-540-85066-3_3 · Cited by 1,693
Adaptive Computation and Machine Learning
(2012) · Boosting · doi:10.7551/mitpress/8291.003.0026 · Cited by 1,402
A Tutorial on Learning with Bayesian Networks
Heckerman, D. (1998) · Learning in Graphical Models · doi:10.1007/978-94-011-5014-9_11 · Cited by 1,220
Metadata
- Authors
- Shachter, R. D.
- Venue
- Operations Research
- Published
- 1988-08
- Volume
- 36
- Issue
- 4
- Pages
- 589-604
- ISSN
- 0030-364X (ISSN-L)
- 1526-5463
- OpenAlex
- W2114307208
- Cited by
- 494
- References
- 8
- FWCI
- 21.12
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.