The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Identifying independence in bayesian networks
Abstract
An important feature of Bayesian networks is that they facilitate explicit encoding of information about independencies in the domain, information that is indispensable for efficient inferencing. This article characterizes all independence assertions that logically follow from the topology of a network and develops a linear time algorithm that identifies these assertions. The algorithm's correctness is based on the soundness of a graphical criterion, called d‐separation, and its optimality stems from the completeness of d‐separation. An enhanced version of d‐separation, called D‐separation, is defined, extending the algorithm to networks that encode functional dependencies. Finally, the algorithm is shown to work for a broad class of nonprobabilistic independencies.
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
Mathematical Methods of Statistics.
Geary, R. C., & Cramer, H. (1947) · The Economic Journal · doi:10.2307/2226151 · Cited by 5,927
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
Fusion, propagation, and structuring in belief networks
Pearl, J. (1986) · Artificial Intelligence · doi:10.1016/0004-3702(86)90072-x · Cited by 2,127
Self-citationConditional Independence in Statistical Theory
Dawid, A. P. (1979) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1979.tb01052.x · Cited by 1,501
Introduction to Structural Equation Models.
Cherlin, A., & Duncan, O. D. (1976) · Contemporary Sociology · doi:10.2307/2064059 · Cited by 1,190
Multivalued dependencies and a new normal form for relational databases
Fagin, R. (1977) · ACM Transactions on Database Systems · doi:10.1145/320557.320571 · Cited by 712
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
Probabilistic Inference and Influence Diagrams
Shachter, R. D. (1988) · Operations Research · doi:10.1287/opre.36.4.589 · Cited by 494
Causal Networks: Semantics and Expressiveness
(1990) · Machine Intelligence and Pattern Recognition · doi:10.1016/b978-0-444-88650-7.50011-1 · Cited by 357
Cited by
Causation, Prediction, and Search
Spirtes, P., Glymour, C., & Scheines, R. (1993) · Lecture Notes in Statistics · doi:10.1007/978-1-4612-2748-9 · Cited by 4,617
Causal diagrams for empirical research
PEARL, J. (1995) · Biometrika · doi:10.1093/biomet/82.4.669 · Cited by 2,355
Self-citationConfirmatory path analysis in a generalized multilevel context
Shipley, B. (2009) · Ecology · doi:10.1890/08-1034.1 · Cited by 1,083
Equivalence and Synthesis of Causal Models
Verma, T., & Pearl, J. (2022) · Probabilistic and Causal Inference · doi:10.1145/3501714.3501732 · Cited by 964
Self-citationBucket elimination: A unifying framework for reasoning
Dechter, R. (1999) · Artificial Intelligence · doi:10.1016/s0004-3702(99)00059-4 · Cited by 583
A New Inferential Test for Path Models Based on Directed Acyclic Graphs
Shipley, B. (2000) · Structural Equation Modeling: A Multidisciplinary Journal · doi:10.1207/s15328007sem0702_4 · Cited by 490
A guide to the literature on learning probabilistic networks from data
Buntine, W. (1996) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.494161 · Cited by 468
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
Inference in belief networks: A procedural guide
Huang, C., & Darwiche, A. (1996) · International Journal of Approximate Reasoning · doi:10.1016/s0888-613x(96)00069-2 · Cited by 450
A New Criterion for Confounder Selection
VanderWeele, T. J., & Shpitser, I. (2011) · Biometrics · doi:10.1111/j.1541-0420.2011.01619.x · Cited by 434
The structure of interdependence in international stock markets
Bessler, D. A., & Yang, J. (2003) · Journal of International Money and Finance · doi:10.1016/s0261-5606(02)00076-1 · Cited by 413
Multi-agent influence diagrams for representing and solving games
Koller, D., & Milch, B. (2003) · Games and Economic Behavior · doi:10.1016/s0899-8256(02)00544-4 · Cited by 409
Causal inference for time series
Runge, J., Gerhardus, A., Varando, G., Eyring, V., & Camps-Valls, G. (2023) · Nature Reviews Earth & Environment · doi:10.1038/s43017-023-00431-y · Cited by 288
Sensitivity analysis in discrete Bayesian networks
Castillo, E., Gutierrez, J. M., & Hadi, A. S. (1997) · IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans · doi:10.1109/3468.594909 · Cited by 267
Dependent Evidence Combination Based on Shearman Coefficient and Pearson Coefficient
Xu, H., & Deng, Y. (2018) · IEEE Access · doi:10.1109/access.2017.2783320 · Cited by 263
Strong Completeness and Faithfulness in Bayesian Networks
Meek, C. (2013) · arXiv · doi:10.48550/arxiv.1302.4973 · Cited by 194
Principles and Practice of Explainable Machine Learning
Belle, V., & Papantonis, I. (2021) · Frontiers in Big Data · doi:10.3389/fdata.2021.688969 · Cited by 99
Learning Spatiotemporal Failure Dependencies for Resilient Edge Computing Services
Aral, A., & Brandic, I. (2021) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2020.3046188 · Cited by 68
Reasoning about causality in games
Hammond, L., Fox, J., Everitt, T., Carey, R., Abate, A., & Wooldridge, M. (2023) · Artificial Intelligence · doi:10.1016/j.artint.2023.103919 · Cited by 13
Metadata
- Authors
- Geiger, D., Verma, T., & Pearl, J.
- Venue
- Networks
- Publisher
- Wiley
- Published
- 1990-08
- Volume
- 20
- Issue
- 5
- Pages
- 507-534
- ISSN
- 0028-3045 (ISSN-L)
- 1097-0037
- OpenAlex
- W2034009564
- Cited by
- 510
- References
- 19
- FWCI
- 9.10
- 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.