The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Exploiting Causal Independence in Bayesian Network Inference
Open accessAbstract
A new method is proposed for exploiting causal independencies in exact Bayesian network inference. A Bayesian network can be viewed as representing a factorization of a joint probability into the multiplication of a set of conditional probabilities. We present a notion of causal independence 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. The new formulation of causal independence lets us specify the conditional probability of a variable given its parents in terms of an associative and commutative operator, such as ``or'', ``sum'' or ``max'', on the contribution of each parent. We start with a simple algorithm VE for Bayesian network inference that, given evidence and a query variable, uses the factorization to find the posterior distribution of the query. We show how this algorithm can be extended to exploit causal independence. Empirical studies, based on the CPCS networks for medical diagnosis, show that this method is more efficient than previous methods and allows for inference in larger networks than previous algorithms.
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
(1988) · Cited by 16,582
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
The computational complexity of probabilistic inference using bayesian belief networks
Cooper, G. F. (1990) · Artificial Intelligence · doi:10.1016/0004-3702(90)90060-d · Cited by 1,937
A model of inexact reasoning in medicine
Shortliffe, E. H., & Buchanan, B. G. (1975) · Mathematical Biosciences · doi:10.1016/0025-5564(75)90047-4 · Cited by 1,447
Complexity of Finding Embeddings in a k-Tree
Arnborg, S., Corneil, D. G., & Proskurowski, A. (1987) · SIAM Journal on Algebraic Discrete Methods · doi:10.1137/0608024 · Cited by 1,206
Tarjan, R. E., & Yannakakis, M. (1984) · SIAM Journal on Computing · doi:10.1137/0213035 · Cited by 1,058
Bayesian updating in causal probabilistic networks by local computations
Jensen, F. V., Lauritzen, S. L., & Olesen, K. G. (1990) · VBN Forskningsportal (Aalborg Universitet) · Cited by 601
Probabilistic Horn abduction and Bayesian networks
Poole, D. (1993) · Artificial Intelligence · doi:10.1016/0004-3702(93)90061-f · Cited by 576
Self-citationContext-Specific Independence in Bayesian Networks
Boutilier, C. E., Friedman, N., Goldszmidt, M., & Koller, D. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1302.3562 · Cited by 568
Subjective bayesian methods for rule-based inference systems
Duda, R. O., Hart, P. E., & Nilsson, N. J. (1976) · AFIPS National Computer Conference and Exposition (NCC) · doi:10.1145/1499799.1499948 · Cited by 539
Independence properties of directed markov fields
Lauritzen, S. L., Dawid, A. P., Larsen, B. N., & Leimer, H. ‐. (1990) · Networks · doi:10.1002/net.3230200503 · Cited by 515
Bucket Elimination: A Unifying Framework for Probabilistic Inference
Dechter, R. (1998) · Learning in Graphical Models · doi:10.1007/978-94-011-5014-9_4 · Cited by 452
(1972) · Mathematics in Science and Engineering · doi:10.1016/s0076-5392(08)x6010-2 · Cited by 341
A simple approach to Bayesian network computations
Zhang, N. L., & Poole, D. (1994) · Cited by 330
Self-citationSome Practical Issues in Constructing Belief Networks.
Henrion, M. (1987) · Uncertainty in Artificial Intelligence · Cited by 252
On non-serial dynamic programming
Bertelè, U., & Brioschi, F. (1973) · Journal of Combinatorial Theory, Series A · doi:10.1016/0097-3165(73)90016-2 · Cited by 229
Knowledge representation and inference in similarity networks and Bayesian multinets
Geiger, D., & Heckerman, D. (1996) · Artificial Intelligence · doi:10.1016/0004-3702(95)00014-3 · Cited by 228
d-Separation: From Theorems to Algorithms
Geiger, D., Verma, T. S., & Pearl, J. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1304.1505 · Cited by 180
Shafer, G. R., & Shenoy, P. P. (1990) · Annals of Mathematics and Artificial Intelligence · doi:10.1007/bf01531015 · Cited by 179
GOOD, I. J. (1961) · The British Journal for the Philosophy of Science · doi:10.1093/bjps/xii.45.43 · Cited by 176
Knowledge Engineering for Large Belief Networks
Pradhan, M., Provan, G. M., Middleton, B., & Henrion, M. (1994) · Elsevier eBooks · doi:10.1016/b978-1-55860-332-5.50066-3 · Cited by 155
Symbolic probabilistic inference in belief networks
Shachter, R. D., D’Ambrosio, B., & Favero, B. A. D. (1990) · National Conference on Artificial Intelligence · Cited by 133
Cited by
Decision-Theoretic Planning: Structural Assumptions and Computational Leverage
Boutilier, C., Dean, T., & Hanks, S. (1999) · Journal of Artificial Intelligence Research · doi:10.1613/jair.575 · Cited by 1,074
Improving the analysis of dependable systems by mapping fault trees into Bayesian networks
Bobbio, A., Portinale, L., Minichino, M., & Ciancamerla, E. (2001) · Reliability Engineering & System Safety · doi:10.1016/s0951-8320(00)00077-6 · Cited by 933
Marcot, B. G., Steventon, J. D., Sutherland, G. D., & McCann, R. K. (2006) · Canadian Journal of Forest Research · doi:10.1139/x06-135 · Cited by 667
Bayesian networks in environmental modelling
Aguilera, P. A., Fernández, A., Fernández, R., Rumí, R., & Salmerón, A. (2011) · Environmental Modelling & Software · doi:10.1016/j.envsoft.2011.06.004 · Cited by 666
Bucket elimination: A unifying framework for reasoning
Dechter, R. (1999) · Artificial Intelligence · doi:10.1016/s0004-3702(99)00059-4 · Cited by 583
Metadata
- Authors
- Zhang, N. L., & Poole, D.
- Venue
- Journal of Artificial Intelligence Research
- Publisher
- AI Access Foundation
- Published
- 1996-12-01
- Volume
- 5
- Pages
- 301-328
- ISSN
- 1076-9757 (ISSN-L)
- OpenAlex
- W2126653228
- Cited by
- 433
- References
- 22
- FWCI
- 9.61
- Type
- journal article
- Language
- en
- Open access
- diamond
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.