Semigraphoids and structures of probabilistic conditional independence

Annals of Mathematics and Artificial Intelligence

Volumn 21, Issue 1, 1997, Pages 71-98

  Studený, Milan ^a  

^a INSTITUTE OF INFORMATION THEORY AND AUTOMATION   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031534577     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1018905100242     Document Type: Article

References (26)

1. J.N. Darroch, S.L. Lauritzen and T.P. Speed, Markov field theory and log-linear interaction models for contingency tables, Ann. Statist. 8 (1980) 522-539.
2. A.P. Dawid, Conditional independence in statistical theory, J. Roy. Statist. Soc., Series B 41 (1979) 1-31.
3. L.C. van der Gaag and J.-J. Ch. Meyer, Characterising normal forms for informational independence, in: Proc. of IPMV'96, Granada, July 1-July 5, 1996, Vol. II, pp. 973-978.
4. D. Geiger, A. Paz and J. Pearl, Axioms and algorithms for inferences involving probabilistic independence, Informat, and Comput. 1 (1991) 128-141.
5. D. Geiger and J. Pearl, Logical and algorithmic properties of conditional independence and their application to Bayesian networks, Ann. Math, and AI 2 (1990) 165-178.
6. D. Geiger and J. Pearl, Logical and algorithmic properties of conditional independence and graphical models, Ann. Statist. 21 (1993) 2001-2021.
7. H. Kiiveri, T.P. Speed and J.B. Carlin, Recursive causal models, J. Austral. Math. Soc., Series A 36 (1984) 30-51.
8. S.L. Lauritzen and N. Wermuth, Graphical models with associations between variables, some of which are quantitative and some qualitative, Ann. Statist. 17 (1989) 31-57.
9. F.M. Malvestuto, A unique formal system for binary decomposition of database relations, probability distributions and graphs, Inform. Sci. 59 (1992) 21-52. Also: F.M. Malvestuto and M. Studený, Comment on "A unique formal . . . graphs", Inform. Sci. 63 (1992) 1-2.
10. F.M. Malvestuto, A unique formal system for binary decomposition of database relations, probability distributions and graphs, Inform. Sci. 59 (1992) 21-52. Also: F.M. Malvestuto and M. Studený, Comment on "A unique formal . . . graphs", Inform. Sci. 63 (1992) 1-2.
11. F. Matúš, Probabilistic conditional independence structures and matroid theory: backgrounds, Internat, J. Gen. Systems 22 (1994) 185-196.
12. F. Matúš, Stochastic independence, algebraic independence and abstract connectedness, Theoret. Comput. Sci. 134 (1994) 455-471.
13. J. Pearl, Probabilistic Reasoning in Intelligent Systems (Morgan-Kaufmann, 1988).
14. J. Pearl and A. Paz, Graphoids: a graph-based logic for reasoning about relevance relations, in: Advances in Artificial Intelligence II, eds. B. Du Boulay, D. Hogg and L. Steels (North-Holland, 1987) pp. 357-363.
15. A. Perez and R. Jiroušek, Construction an intensional expert system INES, in: Medical Decision Making: Diagnostic Strategies and Expert systems, eds. J.H. von Bemmel, F. Grémy and J. Zvárová (North-Holland, 1985) pp. 307-315.
16. Y. Sagiv and S.F. Walecka, Subset dependencies and completeness result for a subclass of embedded multivalued dependencies, J. Assoc. Comp. Machinery 29 (1982) 103-117.
17. R.D. Shachter, Evaluating influence diagrams, Oper. Res. 34 (1986) 871-882.
18. P.P. Shenoy, Conditional independence in valuation-based systems, Internat. J. Approx. Reason. 10 (1994) 203-234.
19. J.Q. Smith, Influence diagrams for statistical modelling, Ann. Statist. 17 (1989) 654-672.
20. W. Spohn, Stochastic independence, causal independence and shieldability, J. Philos. Logic 9 (1980) 73-99.
21. M. Studený, Multiinformation and the problem of characterization of conditional independence relations, Problems Control Inform. Theory 18 (1989) 3-16.
22. M. Studený, Conditional independence relations have no finite complete characterization, in: Information Theory, Statistical Decision Functions and Random Processes, Transaction of the Eleventh Prague Conference B, eds. S. Kubík and J.Á. Víšek (Kluwer, 1992) or (Academia, 1992) pp. 377-396.
23. M. Studený, Formal properties of conditional independence in different calculi of AI, in: Symbolic and Quantitative Approaches to Reasoning and Uncertainty, eds. M. Clarke, R. Kruse and S. Moral (Springer-Verlag, 1993) pp. 341-348.
24. M. Studený, Description of structures of stochastic conditional independence by means of faces and imsets (a series of 3 papers), 1st Part: Introduction and basic concepts, 2nd Part: Basic theory, 3rd Part: Examples of use and appendices, Internat. J. Gen. Systems 23 (1994/1995) 123-137, 201-219, 323-341.
25. M. Studený, Semigraphoids are two-antecedental approximations of stochastic conditional independence models, in: Uncertainty in Artificial Intelligence, Proceedings of the Tenth Conference, eds. R.L. de Mantaras and D. Poole (Morgan-Kaufmann, 1994) pp. 546-552.
26. J. Whittaker, Graphical Models in Applied Multivariate Statistics (John Wiley, 1990).