CoChat

Bayesian model averaging and model selection for markov equivalence classes of acyclic digraphs

Madigan, David, Andersson, Steen A., Perlman, Michael D., Volinsky, Chris T. · 1996 · Communications in Statistics - Theory and Methods
Cited by 118

The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.

Abstract

Acyclic digraphs (ADGs) are widely used to describe dependences among variables in multivariate distributions. In particular, the likelihood functions of ADG models admit convenient recursive factorizations that often allow explicit maximum likelihood estimates and that are well suited to building Bayesian networks for expert systems. There may, however, be many ADGs that determine the same dependence (= Markov) model. Thus, the family of all ADGs with a given set of vertices is naturally partitioned into Markov-equivalence classes, each class being associated with a unique statistical model. Statistical procedures, such as model selection or model averaging, that fail to take into account these equivalence classes, may incur substantial computational or other inefficiencies. Recent results have shown that each Markov-equivalence class is uniquely determined by a single chain graph, the essential graph, that is itself Markov-equivalent simultaneously to all ADGs in the equivalence class. Here we propose two stochastic Bayesian model averaging and selection algorithms for essential graphs and apply them to the analysis of three discrete-variable data sets.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1080/03610929608831853

Cites

9 of 9 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 9 references

Research works printed but not linked: 28

  1. 10.1080/02664769100000012 · DOI
  2. Andersson , S. A. , Madigan , D. and Perlman , M. D. 1995a . On the Markov equivalence of chain graphs, undirected graphs, and acyclic digraphs . Scandinavian Journal of Statistics , 18
  3. 10.1111/j.2517-6161.1993.tb01467.x · DOI · Paper page
  4. 10.1613/jair.62 · DOI · Paper page
  5. Chickering , D. M. 1995 . “ A transformational characterization of equivalent Bayesian network structures ” . In In Uncertainty in Artificial Intelligence, Proceedings of the Eleventh Conference , Edited by: Besnard , P. and Hanks , S. 87 – 98 . San Francisco : Morgan Kaufman .
  6. 10.1023/A:1022649401552 · doi:10.1023/a:1022649401552 · Paper page
  7. 10.1214/aos/1176349260 · DOI · Paper page
  8. 10.1093/biomet/72.2.339 · DOI · Paper page
  9. 10.1080/01621459.1988.10478640 · DOI
  10. Frydenberg , M. 1990 . The chain graph Markov property . Scandinavian Journal of Statistics , 17 : 333 – 353 .
  11. Geiger , D. and Heckerman , D. 1995 . “ A characterization of the Dirichlet distribution with applications to learning Bayesian networks ” . In In Uncertainty in Artificial Intelligence, Proceedings of the Eleventh Conference , Edited by: Besnard , P. and Hanks , S. 196 – 207 . San Francisco : Morgan Kaufman .
  12. Hansen , J.F. 1980 . The clinical diagnosis of ischaemic heart disease due to coronary artery disease . Danish Medical Bulletin , 27 : 280 – 186 .
  13. 10.1055/s-0038-1634867 · DOI · Paper page
  14. Heckerman , D. , Geiger , D. and Chickering , D. M. 1994 . “ Learning Bayesian networks: the combination of knowledge and statistical data ” . In In Uncertainty in Artificial Intelligence, Proceedings of the Tenth Conference , Edited by: Lopez de Mantaras , B. and Poole , D. 293 – 301 . San Francisco : Morgan Kaufman .
  15. 10.1016/0167-9473(93)E0054-8 · DOI
  16. 10.1002/net.3230200503 · DOI · Paper page
  17. 10.1111/j.2517-6161.1988.tb01721.x · DOI · Paper page
  18. 10.1080/03610929508831616 · DOI · Paper page
  19. Madigan , D. , Raftery , A. E. , York , J.C. , Bradshaw , J.M. and Almond , R.G. 1994 . “ Strategies for graphical model selection ” . In In Selecting Models from Data: Artificial Intelligence and Statistics IV , Edited by: Cheeseman , P. and Oldford , W. 91 – 100 . Springer Verlag . · DOI
  20. Meek , C. 1995 . “ Causal inference and causal explanation with background knowledge ” . In In Uncertainty in Artificial Intelligence, Proceedings of the Eleventh Conference , Edited by: Besnard , P. and Hanks , S. 403 – 410 . San Francisco : Morgan Kaufman .
  21. Neapolitan , R. E. 1990 . Probabilistic Reasoning in Expert Systems , New York : Wiley .
  22. Pearl , J. 1988 . Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference , San Mateo, CA : Morgan Kaufmann .
  23. 10.1214/ss/1177010888 · DOI · Paper page
  24. 10.1007/978-1-4612-2748-9 · DOI · Paper page
  25. 10.1214/aos/1176325750 · DOI · Paper page
  26. Verma , T. and Pearl , J. 1992 . “ An algorithm for deciding if a set of observed independencies has a causal explanation ” . In In Uncertainty in Artificial Intelligence, Proceedings of the Eighth Conference , Edited by: Dubois , D. , Wellman , M. P. , D'Ambrosio , B. and Smets , P. 323 – 330 . San Francisco : Morgan Kaufman .
  27. Whittaker , J. L. 1990 . Graphical Models in Applied Multivariate Statistics , New York : Wiley .
  28. Wright , S. 1921 . Correlation and causation . Journal of Agricultural Research , 20 : 557 – 585 .

Cited by

See all 118

Metadata

Authors
Madigan, D., Andersson, S. A., Perlman, M. D., & Volinsky, C. T.
Venue
Communications in Statistics - Theory and Methods
Published
1996-01
Volume
25
Issue
11
Pages
2493-2519
ISSN
  • 0361-0926 (ISSN-L)
  • 1532-415X
OpenAlex
W1971989560
Cited by
118
References
9
FWCI
4.81
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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Bayesian model averaging and model selection for markov equivalence classes of acyclic digraphs. https://app.cochat.ai/papers/10.1080/03610929608831853
The paper
Madigan, D., Andersson, S. A., Perlman, M. D., & Volinsky, C. T. (1996). Bayesian model averaging and model selection for markov equivalence classes of acyclic digraphs. Communications in Statistics - Theory and Methods. https://doi.org/10.1080/03610929608831853

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.