Conditional independence structures examined via minors

Annals of Mathematics and Artificial Intelligence

Volumn 21, Issue 1, 1997, Pages 99-30

  Matúš, František ^a  

^a BIELEFELD UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031490528     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1018957117081     Document Type: Article

References (49)

1. S.A. Andersson and M.D. Perlman, Lattice models for conditional independence in a multivariate normal distribution, The Annals of Statistics 21 (1993) 1318-1358.
2. Z. Ann, D.A. Bell and J.G. Hughes, On the axiomization of conditonal independence, Int. J. of Systems and Cybernetics (Kybernetes) 21 (1992) 48-58.
3. G. Birkhoff, Lattice Theory (Nauka, Moscow, 1984) (Russian translation).
4. L.M. de Campos, Independency relationships and learning algorithms for singly connected networks, University of Granada, Tech. Report of DECSAI - 960204 (1996).
5. L.M. de Campos, Characterizations of decomposable dependency models, University of Granada, Tech. Report of DECSAI - 960225 (1996).
6. V. Chvátal, Linear Programming (W.H. Freeman and Comp., New York, 1983).
7. J.N. Darroch, S.L. Lauritzen and T.P. Speed, Markov fields and log-linear interaction models for contingency tables, The Annals of Statistics 8 (1980) 522-539.
8. A.P. Dawid, Conditional independence in statistical theory (with discussion), J. Roy. Statist. Soc., Series B 41 (1979) 1-31.
9. S. Fujishige, Polymatroidal dependence structure of a set of random variables, Information and Control 39 (1978) 55-72.
10. D. Geiger, Graphoids: a qualitative framework for probabilistic inference, Ph.D. Dissertation, Computer Science Department, University of California, Los Angeles (1990).
11. D. Geiger and J. Pearl, On the logic of influence diagrams, in: Proc. 4th Workshop on Uncertainty in AI, Minneapolis, MN (1988) pp. 136-147.
12. D. Geiger and J. Pearl, Logical and algorithmic properties of conditional independence, Technical Report R-97, Cognitive Systems Laboratory, University of California, Los Angeles (1988).
13. D. Geiger and J. Pearl, Logical and algorithmic properties of conditional independence and graphical models, The Annals of Statistics 21 (1993) 2001-2021.
14. V.P. Grishukin, On the extremality of the rank function of a connected semimodular lattice, Amer. Math. Soc. Transl. 158 (1994) 31-36.
15. A.W. Ingleton, Conditions for representability and transversality of matroids, in: Proc. Fr. Br. Conf., Springer Lecture Notes 211 (1970) pp. 62-67.
16. D.E. Knuth, The asymptotic number of geometries, J. Comb. Th. (A) 16 (1974) 398-400.
17. J.T.A. Koster, Markov properties of nonrecursive causal models, Ann. Statist. 24 (1996) 2148-2177.
18. S.L. Lauritzen, Lectures on Contingency Tables, 3rd ed. (University of Aalborg Press, Aalborg, 1989).
19. S.L. Lauritzen, Graphical Models (Oxford University Press, Oxford, 1996).
20. S.L. Lauritzen, A.P. Dawid, B.N. Larsen and H.G. Leimer, Independence properties of directed Markov fields, Networks 20 (1990) 491-505.
21. F. Matúš, Ascending and descending conditional independence relations, in: Transactions of the 11th Prague Conference on Information Theory, Statistical Decision Functions and Random Processes, Vol. B (Academia, Prague (also Kluwer, Dordrecht), 1992) pp. 189-200.
22. F. Matúš, On equivalence of Markov properties over undirected graphs, Journal of Applied Probability 29 (1992) 745-749.
23. F. Matúš, Probabilistic conditional independence structures and matroid theory: background, Int. J. of General Systems 22 (1994) 185-196.
24. F. Matúš, Extreme convex set functions with many nonnegative differences, Discrete Mathematics 135 (1994) 177-191.
25. F. Matúš, Conditional independences among four random variables II, Combinatorics, Probability and Computing 4 (1995) 407-417.
26. F. Matúš, Conditional independences among four random variables III (1997), submitted to Combinatorics, Probability and Computing.
27. F. Matúš and M. Studený, Conditional independences among four random variables I, Combinatorics, Probability and Computing 4 (1995) 269-278.
28. M. Mouchart and J.M. Rolin, A note on conditional independence with statistical applications, Statistica 44 (1984) 557-584.
29. H.Q. Nguyen, Semimodular functions, in: Theory of Matroids, ed. N. White (Cambridge University Press, Cambridge, London, 1996).
30. R.N. Oliver and J.Q. Smith, Influence Diagrams, Belief Nets and Decision Analysis (Wiley, Chichester, 1990).
31. J.G. Oxley, Matroid Theory (Oxford University Press, Oxford, New York, Tokyo, 1992).
32. J. Pearl, Probabilistic Reasoning in Intelligent Systems (Morgan Kaufmann, San Mateo, CA, 1988).
33. J. Rosenmüller and H.G. Weidner, Extreme convex set functions with finite carrier: general theory, Discrete Math. 10 (1974) 343-382.
34. Y. Sagiv and S.F. Walecka, Subset dependencies and a completeness result for a subclass of embedded multivalued dependencies, J. of ACM 29 (1988) 103-117.
35. L.S. Shapley, Cores of convex games, Int. J. of Game Theory 1 (1971/72) 11-26.
36. T.P. Speed, A note on nearest-neighbour Gibbs and Markov probabilities, Sankhya, Series A 41 (1979) 184-197.
37. W. Spohn, Stochastic independence, causal independence and shieldability, J. of Philosophical Logic 9 (1980) 73-99.
38. W. Spohn, On the properties of conditional independence, in: P. Suppes, Scientific Philosopher, Vol. 1, ed. P. Humphreys (Kluwer, Dordrecht, 1994) pp. 173-196.
39. M. Studený, Multiinformation and the problem of characterization of conditional independence relations, Problems of Control and Inf. Th. 18 (1989) 3-16.
40. M. Studený, Convex set functions I. and II., Research Reports 1733 and 1734, Institute of Information Theory and Automation, Prague (November 1991).
41. M. Studený, Conditional independence relations have no finite complete characterization, in: Transactions of the 11th Prague Conference on Information Theory, Statistical Decision Functions and Random Processes, Vol. B (Academia, Prague (also Kluwer, Dordrecht), 1991) pp. 377-396.
42. M. Studený, Structural semigraphoids, Int. J. of General Systems 22 (1994) 207-217.
43. M. Studený, Description of structures of stochastic conditional independence by means of faces and imsets (in three parts), Int. J. of General Systems 23. 1st Part: Introduction and basic concepts 23(2) (1994) 123-137; 2nd Part: Basic theory 23(2) (1995) 201-219; 3rd Part: Examples of use and appendices 23(4) (1995) 323-341.
44. M. Studený, Description of structures of stochastic conditional independence by means of faces and imsets (in three parts), Int. J. of General Systems 23. 1st Part: Introduction and basic concepts 23(2) (1994) 123-137; 2nd Part: Basic theory 23(2) (1995) 201-219; 3rd Part: Examples of use and appendices 23(4) (1995) 323-341.
45. M. Studený, Description of structures of stochastic conditional independence by means of faces and imsets (in three parts), Int. J. of General Systems 23. 1st Part: Introduction and basic concepts 23(2) (1994) 123-137; 2nd Part: Basic theory 23(2) (1995) 201-219; 3rd Part: Examples of use and appendices 23(4) (1995) 323-341.
46. M. Studený and P. Boček, CI-models arising among 4 random variables, in: Proceedings of the 3rd Workshop on Uncertainty Processing in Expert Systems, Institute of Information Theory and Automation, Prague (1994) pp. 268-282.
47. D.J.A. Welsh, Matroid Theory (Academic Press, London, 1976).
48. J. Whittaker, Graphical Models in Applied Multivariate Statistics (Wiley, Chichester, 1990).
49. R.W. Yeung, A framework for information-theoretic inequalities, IEEE Trans. Inf. Th. (1997) (to appear).