Racing algorithms for conditional independence inference

International Journal of Approximate Reasoning

Volumn 45, Issue 2, 2007, Pages 386-401

  Bouckaert, Remco R ^a   Studený, Milan ^b  

^a UNIVERSITY OF WAIKATO   (New Zealand)

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

Author keywords

Algorithm; Conditional independence; Imset; Inference

Indexed keywords

CHARACTERIZATION; PARALLEL ALGORITHMS;

COMPLEMENTARY PROPERTIES; CONDITIONAL INDEPENDENCE; STRUCTURAL IMSETS;

COMPUTATION THEORY;

EID: 34250002556     PISSN: 0888613X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ijar.2006.06.018     Document Type: Article

References (19)

1. Anderson S.A., Madigan D., and Perlman M.D. Alternative Markov properties for chain graphs. Scandinavian Journal of Statistics 28 1 (2001) 33-85
2. Bouckaert R.R. IDAGs: a perfect map for any distribution. In: Clarke M., Kruse R., and Moral S. (Eds). Symbolic and Quantitative Approaches to Reasoning and Uncertainty. Lecture Notes in Computer Science vol. 747 (1993), Springer-Verlag 49-56
3. Bouckaert R.R., and Studený M. Chain graphs: semantics and expressiveness. In: Froidevaux C., and Kohlas J. (Eds). Symbolic and Quantitative Approaches to Reasoning and Uncertainty. Lecture Notes in AI vol. 946 (1995), Springer-Verlag 67-76
4. Cowell R.G., Dawid A.P., Lauritzen S.L., and Spiegelhalter D.J. Probabilistic Networks and Expert Systems (1999), Springer-Verlag, New York
5. Cox D.R., and Wermuth N. Multivariate Dependencies - Models, Analysis and Interpretation (1996), Chapman & Hall
6. Dawid A.P. Conditional independence in statistical theory. Journal of the Royal Statistical Society B 41 (1979) 1-31
7. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to The Theory of NP-completeness (1979), W.H. Freeman and Company, San Francisco
8. Geiger D., and Pearl J. Logical and algorithmic properties of conditional independence and graphical models. Annals of Statistics 21 4 (1993) 2001-2021
9. Kauermann G. On a dualization of graphical Gaussian models. Scandinavian Journal of Statistics 23 1 (1996) 105-116
10. Koster J.T.A. Markov properties of nonrecursive causal models. Annals of Statistics 24 5 (1996) 2148-2177
11. Pearl J. Probabilistic Reasoning in Intelligent Systems (1988), Morgan Kaufman, San Mateo
12. Shenoy P.P. Conditional independence in valuation-based systems. International Journal of Approximate Reasoning 10 3 (1994) 203-234
13. Spirtes P., Glymour C., and Scheines R. Causation prediction and search. Lecture Notes in Statistics vol. 81 (1993), Springer-Verlag
14. Studený M. Conditional independence relations have no finite complete characterization. In: Kubík S., and Víšek J.A. (Eds). Information Theory, Statistical Decision Functions and Random Processes vol. B (1992), Kluwer, Dordrecht 377-396
15. M. Studený, R.R. Bouckaert, T. Kočka, Extreme supermodular set functions over five variables, Research Report No. 1977, Institute of Information Theory and Automation, Prague, January 2000.
16. M. Studený, Structural imsets: an algebraic method for describing conditional independence structures, in: B. Bouchon-Meunier, G. Coletti, R.R. Yager (Eds.), Proceedings of IPMU 2004, pp. 1323-1330.
17. Studený M. Probabilistic Conditional Independence Structures (2005), Springer-Verlag, London
18. Verma T., and Pearl J. Causal networks: semantics and expressiveness. In: Shachter R.D., Lewitt T.S., Kanal L.N., and Lemmer J.F. (Eds). Uncertainty in Artificial Intelligence vol. 4 (1990), North-Holland, Amsterdam 69-76
19. Wermuth N., and Lauritzen S.L. On substantive research hypotheses, conditional independence graphs and graphical chain models (with discussion). Journal of the Royal Statistical Society B 52 (1990) 21-72