Bayesian model averaging and model selection for markov equivalence classes of acyclic digraphs
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.
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
Lauritzen, S. L. (1996) · doi:10.1093/oso/9780198522195.001.0001 · Cited by 2,976
Variable Selection via Gibbs Sampling
George, E. I., & McCulloch, R. E. (1993) · Journal of the American Statistical Association · doi:10.1080/01621459.1993.10476353 · Cited by 2,828
Bernardo, J. M., & Smith, A. F. M. (1994) · Wiley Series in Probability and Statistics · doi:10.1002/9780470316870 · Cited by 2,178
Bayesian computation via the Gibbs sampler and related Markov chain Monte Carlo methods
Smith, A. F. M., & Roberts, G. O. (1993) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1993.tb01466.x · Cited by 1,713 · cited 2×
“We use Markov chain methods to draw from both conditional distributions (Tierney, 1995, Smith and Roberts, 1993); we devise Hastings-Metropolis algorithms for each one.”
BackgroundMethodModel Selection and Accounting for Model Uncertainty in Graphical Models Using Occam's Window
Madigan, D., & Raftery, A. E. (1994) · Journal of the American Statistical Association · doi:10.1080/01621459.1994.10476894 · Cited by 1,205 · cited 19×
“6 shows the four ADG models selected by the Occam’s Window procedure of Madigan and Raftery (1994) and Figure 2.”
BackgroundMethodResultInfluentialSelf-citationBayesian Graphical Models for Discrete Data
Madigan, D., York, J., & Allard, D. (1995) · International Statistical Review / Revue Internationale de Statistique · doi:10.2307/1403615 · Cited by 1,090
Self-citationSequential updating of conditional probabilities on directed graphical structures
Spiegelhalter, D. J., & Lauritzen, S. L. (1990) · Networks · doi:10.1002/net.3230200507 · Cited by 521 · cited 6×
“For categorical data, where each conditional pdf f a a( | ( ))pa D is multinomial, Spiegelhalter and Lauritzen (1990) proposed the nowwidely accepted conjugate family of Dirichlet prior distributions for the parameters occurring in these conditional multinomial distributions.”
BackgroundInfluentialA characterization of Markov equivalence classes for acyclic digraphs
Andersson, S. A., Madigan, D., & Perlman, M. D. (1997) · The Annals of Statistics · doi:10.1214/aos/1031833662 · Cited by 425 · cited 11×
“Andersson et al. (1995b) show that for every ADG D, the equivalence class [D] can be uniquely represented by a certain Markov-equivalent chain graph D*, the essential graph associated with the equivalence class.”
BackgroundMethodInfluentialSelf-citationYork, J., Madigan, D., Heuch, I., & Lie, R. T. (1995) · Applied Statistics · doi:10.2307/2986347 · Cited by 52 · cited 1×
“…have become popular across an extraordinary range of applications; see, for example, Heckerman et al. (1992), Lauritzen and Spiegelhalter (1988), Pearl (1988), Neapolitan (1990), Spiegelhalter and Lauritzen (1990), Spiegelhalter et al. (1993), Madigan and Raftery (1994), and York et al. (1995).”
BackgroundSelf-citation
Research works printed but not linked: 28
- 10.1080/02664769100000012 · DOI
- 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
- 10.1111/j.2517-6161.1993.tb01467.x · DOI · Paper page
- 10.1613/jair.62 · DOI · Paper page
- 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 .
- 10.1023/A:1022649401552 · doi:10.1023/a:1022649401552 · Paper page
- 10.1214/aos/1176349260 · DOI · Paper page
- 10.1093/biomet/72.2.339 · DOI · Paper page
- 10.1080/01621459.1988.10478640 · DOI
- Frydenberg , M. 1990 . The chain graph Markov property . Scandinavian Journal of Statistics , 17 : 333 – 353 .
- 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 .
- Hansen , J.F. 1980 . The clinical diagnosis of ischaemic heart disease due to coronary artery disease . Danish Medical Bulletin , 27 : 280 – 186 .
- 10.1055/s-0038-1634867 · DOI · Paper page
- 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 .
- 10.1016/0167-9473(93)E0054-8 · DOI
- 10.1002/net.3230200503 · DOI · Paper page
- 10.1111/j.2517-6161.1988.tb01721.x · DOI · Paper page
- 10.1080/03610929508831616 · DOI · Paper page
- 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
- 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 .
- Neapolitan , R. E. 1990 . Probabilistic Reasoning in Expert Systems , New York : Wiley .
- Pearl , J. 1988 . Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference , San Mateo, CA : Morgan Kaufmann .
- 10.1214/ss/1177010888 · DOI · Paper page
- 10.1007/978-1-4612-2748-9 · DOI · Paper page
- 10.1214/aos/1176325750 · DOI · Paper page
- 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 .
- Whittaker , J. L. 1990 . Graphical Models in Applied Multivariate Statistics , New York : Wiley .
- Wright , S. 1921 . Correlation and causation . Journal of Agricultural Research , 20 : 557 – 585 .
Cited by
Hoeting, J. A., Madigan, D., Raftery, A. E., & Volinsky, C. T. (1999) · Statistical Science · doi:10.1214/ss/1009212519 · Cited by 4,118
Self-citationBayesian Artificial Intelligence
Korb, K. B., & Nicholson, A. E. (2003) · Chapman & Hall/CRC eBooks · doi:10.1201/9780203491294 · Cited by 1,014
Friedman, N., & Koller, D. (2003) · Machine Learning · doi:10.1023/a:1020249912095 · Cited by 811
A characterization of Markov equivalence classes for acyclic digraphs
Andersson, S. A., Madigan, D., & Perlman, M. D. (1997) · The Annals of Statistics · doi:10.1214/aos/1031833662 · Cited by 425
Self-citationInferring cellular networks – a review
Markowetz, F., & Spang, R. (2007) · BMC Bioinformatics · doi:10.1186/1471-2105-8-s6-s5 · Cited by 391
Metadata
- Authors
- Madigan, D., Andersson, S. A., Perlman, M. D., & Volinsky, C. T.
- Venue
- Communications in Statistics - Theory and Methods
- Publisher
- Informa UK Limited
- 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.