Independence properties of directed markov fields
暂无分享,去创建一个
Steffen L. Lauritzen | A. Philip Dawid | Hanns-Georg Leimer | B. N. Larsen | A. Dawid | S. Lauritzen | H.-G. Leimer
[1] S. Wright. The Method of Path Coefficients , 1934 .
[2] A. Dawid. Conditional Independence for Statistical Operations , 1980 .
[3] N. Wermuth. Linear Recursive Equations, Covariance Selection, and Path Analysis , 1980 .
[4] N. Wermuth,et al. Graphical and recursive models for contingency tables , 1983 .
[5] T. Speed,et al. Recursive causal models , 1984, Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics.
[6] Judea Pearl,et al. A Constraint-Propagation Approach to Probabilistic Reasoning , 1985, UAI.
[7] Judea Pearl,et al. GRAPHOIDS: Graph-Based Logic for Reasoning about Relevance Relations OrWhen Would x Tell You More about y If You Already Know z? , 1986, ECAI.
[8] Judea Pearl,et al. The Logic of Representing Dependencies by Directed Graphs , 1987, AAAI.
[9] David J. Spiegelhalter,et al. Local computations with probabilities on graphical structures and their application to expert systems , 1990 .
[10] Judea Pearl,et al. Causal networks: semantics and expressiveness , 2013, UAI.
[11] N. Wermuth,et al. Graphical Models for Associations between Variables, some of which are Qualitative and some Quantitative , 1989 .
[12] J. Q. Smith. Influence Diagrams for Statistical Modelling , 1989 .
[13] M. Frydenberg. The chain graph Markov property , 1990 .