Abstract

We present a simple characterization of equivalentBayesian network structures based on local transformations. The significance of the characterization is twofold. First, we are able to easily proveseveral new invariant properties of theoretical interest for equivalent structures. Second, we use the characterization to derive an efficient algorithm that identifies all of the compelled edges in a structure. Compelled edge identification is of particular importance for learning Bayesian network structures from data because these edges indicate causal relationships when certain assumptions hold. 1

Citations

1581	Estimating the dimension of a model - SCHWARZ - 1978
891	Modeling by shortest data description - Rissanen - 1978
39	A new look at the statistical model identi cation - Akaike - 1974
25	Belief network Construction Using the Minimum Description Length Principle - Bouckaert - 1992
24	In‡uence Diagrams for Statistical Modeling - Smith - 1989
21	Stochastic complexity and modeling. The Annals of Statistics - Rissanen - 1986