论文信息 - Strong completeness and faithfulness in Bayesian networks

Strong completeness and faithfulness in Bayesian networks

A completeness result for d-separation applied to discrete Bayesian networks is presented and it is shown that in a strong measure-theoretic sense almost all discrete distributions for a given network structure are faithful; i.e. the independence facts true of the distribution are all and only those entailed by the network structure

Christopher Meek | Christopher Meek

[1] A. Dawid. Conditional Independence in Statistical Theory , 1979 .

[2] Judea Pearl,et al. Probabilistic reasoning in intelligent systems , 1988 .

[3] J. N. R. Jeffers,et al. Graphical Models in Applied Multivariate Statistics. , 1990 .

[4] Dan Geiger,et al. Identifying independence in bayesian networks , 1990, Networks.

[5] M. Okamoto. Distinctness of the Eigenvalues of a Quadratic form in a Multivariate Sample , 1973 .

[6] Remco R. Bouckaert,et al. Probalistic Network Construction Using the Minimum Description Length Principle , 1993, ECSQARU.

[7] Steffen L. Lauritzen,et al. Independence properties of directed markov fields , 1990, Networks.

[8] M. Frydenberg. Marginalization and Collapsibility in Graphical Interaction Models , 1990 .

[9] S. Sclove,et al. 4 and large-sample statistical model selection criteria , 1994 .

[10] Gregory F. Cooper,et al. A Bayesian Method for the Induction of Probabilistic Networks from Data , 1992 .

[11] Judea Pearl,et al. A Theory of Inferred Causation , 1991, KR.

[12] Judea Pearl,et al. Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

[13] P. Spirtes,et al. Causation, prediction, and search , 1993 .