Conditional independences in Gaussian vectors and rings of polynomials

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 3301, Issue , 2005, Pages 152-161

  Matúš, Prantišek ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; POLYNOMIALS; VECTORS; ARTIFICIAL INTELLIGENCE;

ALGEBRAIC TECHNIQUES; GAUSSIAN VECTORS;

ARTIFICIAL INTELLIGENCE; POLYNOMIALS;

CONDITIONAL INDEPENDENCES; GAUSSIAN VECTORS; GROEBNER BASIS;

EID: 26444497485     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11408017_9     Document Type: Conference Paper

References (21)

1. L. Csirmaz (1996) The dealer's random bits in perfect secret-sharing schemes. Studio. Scient. Math. Hungarica 32 429-437.
2. R.G. Cowell, A.P. Dawid, S.L. Lauritzen and D.J. Spiegelhalter (1999) Probabilistic Networks and Expert Systems. Springer: New York.
3. D. Cox, J. Little and D. O'Shea (1997) Ideals, Varieties, and Algorithms. Undergraduate Texts in Mathematics, Springer: New York.
4. C. DeConcini, D. Eisenbud and D. Procesi (1980) Young diagrams and determinantal varieties, Inventiones math. 56 129-165.
5. P. Doubilet, G.G. Rota and J. Stein (1974) On the foundations of the combinatorial theory IX: combinatorial methods in invariant theory, Studies in Applied Math. 53 185-216.
6. D. Geiger and Ch. Meek (1999) Quantifier Elimination for statistical problems. Proceedings of Fifteenth Conference on Uncertainty in Artificial Intelligence (Eds. K. Laskey and H. Prade), Morgan Kaufmann, 226-235.
7. S.L. Lauritzen (1996) Graphical Models. Oxford University Press: Oxford.
8. F. Matúš (1992) On equivalence of Markov properties over undirected graphs. Journal of Applied Probability 29 745-749.
9. F. Matúš (1997) Conditional independence structures examined via minors. Annals of Mathematics and Artificial Intelligence 21 99-128.
10. F. Matúš (1999) Conditional independences among four random variables III: final conclusion. Combinatorics, Probability and Computing 8 269-276.
11. F. Matúš (1999) Matroid representations by partitions. Discrete Mathematics 203 169-194.
12. B. Mishra (1993) Algorithmic Algebra. Texts and monographs in Computer Science, Vol. XIV, Springer: New York.
13. D. Mond and R. Pellikaan (1989) Fitting ideals and multiple points of analytic mappings. In: Algebraic and Analytic Geometry, Patzcuaro 1987, E. Ramirez de Arellano ed., Springer Lecture Notes in Mathematics 1414, pp. 107-161.
14. J. Pearl (1988) Probabilistic Reasoning in Intelligent Systems. Morgan Kaufman: San Meteo, California.
15. V.V. Prasolov (1994) Problems and Theorems in Linear Algebra. AMS Translations of Mathematical Monographs, Vol. 134, AMS: Providence, Rhode Island.
16. Y. Sagiv and S.F. Walecka (1988) Subset dependencies and a completeness result for a subclass of embedded multivalued dependencies. Journal of ACM 29 103-117.
17. J. Spencer (1994) Ten Lectures on the Probabilistic Method. SIAM: Philadelphia, Pennsylvania.
18. M. Studený (1991) Conditional independence relations have no finite complete characterization. Transactions of the 11-th Prague Conference on Information Theory, Statistical Decision Functions and Random Processes, Vol.B, Academia, Prague, 377-396 (also Kluwer, Dordrecht).
19. M. Studený (2002) On stochastic conditional independence: the problems of characterization and description. Annals of Mathematics and Artificial Intelligence 35 323-341.
20. R.W. Yeung (2002) A First Course in Information Theory. Kluwer Academic/Plenum Publishers: New York.
21. Z. Zhang and R.W. Yeung (1997) A non-Shannon-type conditional inequality of information quantities. IEEE Trans. Information Theory 43 1982-1986.