Bayesian Model Averaging And Model Selection For Markov Equivalence Classes Of Acyclic Digraphs (1996)

Cached

Download Links

by David Madigan , Steen Andersson , Michael Perlman , Chris Volinsky
Venue:Communications in Statistics: Theory and Methods
Citations:38 - 5 self

Documents Related by Co-Citation

913 Learning Bayesian networks: The combination of knowledge and statistical data – David Heckerman, David M. Chickering - 1995
1081 A Bayesian method for the induction of probabilistic networks from data – Gregory F. Cooper, Tom Dietterich - 1992
7069 Probabilistic Reasoning in Intelligent Systems – J Pearl - 1988
220 Equivalence and synthesis of causal models – T Verma, J Pearl - 1990
92 A Transformational Characterization of Equivalent Bayesian Network Structures – David Maxwell Chickering - 1995
132 Learning Equivalence Classes Of Bayesian Network Structures – David Maxwell Chickering - 1996
92 A characterization of Markov equivalence classes for acyclic digraphs – Steen A. Andersson, David Madigan, Michael D. Perlman - 1995
227 Bayesian Graphical Models for Discrete Data – David Madigan, Jeremy York - 1993
1124 Graphical Models – S L Lauritzen - 1996
266 Model selection and accounting for model uncertainty in graphical models using Occam's window – David Madigan, Adrian E. Raftery - 1993
77 Construction of Bayesian Network Structures From Data: A Brief Survey and an Efficient Algorithm – Moninder Singh , Marco Valtorta - 1995
249 Operations for Learning with Graphical Models – Wray L. Buntine - 1994
201 Sequential updating of conditional probabilities on directed graphical structures – D J Spiegelhalter, S L Lauritzen - 1990
240 The ALARM monitoring system: A case study with two probabilistic inference techniques for belief networks – I Beinlich - 1989
184 Theory Refinement on Bayesian Networks – Wray Buntine - 1991
202 Being Bayesian about network structure – Nir Friedman - 2000
58 Learning bayesian networks with discrete variables from data – P Spirtes, C Meek - 1995
181 Learning Bayesian network structure from massive datasets: The “sparse candidate” algorithm – Nir Friedman - 1999
123 Hyper Markov laws in the statistical analysis of decomposable graphical models – A P Dawid, S L Lauritzen - 1993