Efficient algorithms for conditional independence inference

Journal of Machine Learning Research

Volumn 11, Issue , 2010, Pages 3453-3479

  Bouckaert, Remco ^a,d   Hemmecke, Raymond ^b   Lindner, Silvia ^b   Studený, Milan ^c  

^a UNIVERSITY OF WAIKATO   (New Zealand)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

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

^d UNIVERSITY OF AUCKLAND   (New Zealand)

Author keywords

Conditional independence inference; Linear programming approach

Indexed keywords

ACYCLIC DIRECTED GRAPH; ALGEBRAIC METHOD; ALGEBRAIC RELATIONS; BASIC IDEA; BAYESIAN NETWORK STRUCTURE; COMPUTATIONAL EXPERIMENT; CONDITIONAL INDEPENDENCE INFERENCE; CONDITIONAL INDEPENDENCES; EFFICIENT ALGORITHM; LP METHOD; POLYHEDRAL GEOMETRIES; THEORETICAL BASIS;

ALGORITHMS; BAYESIAN NETWORKS; COMPUTATIONAL EFFICIENCY; COMPUTER TESTING; INFERENCE ENGINES; LINEAR PROGRAMMING; OPTIMIZATION; STATISTICAL TESTS;

ALGEBRA;

EID: 79551502788     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Article

References (30)

1. Remco R. Bouckaert andMilan Studený. Racing algorithms for conditional independence inference. International Journal of Approximate Reasoning, 45(2):386-401, 2007.
2. Winfried Bruns, Bogdan Ichim, and Christof Söger. NORMALIZ, a tool for computations in affine monoids, vector configurations, lattice polytopes and rational cones. Available electronicly at http://www.math.uos.de/normaliz/, 2009.
3. Winfried Bruns, Raymond Hemmecke, Bogdan Ichim, Matthias Köppe, and Christof Söger. Challenging computations of Hilbert bases of cones associated with algebraic statistics. To appear in Experimental Mathematics, e-print available at arxiv.org/abs/1001.4145v1, 2010.
4. David M. Chickering. Optimal structure identification with greedy search. Journal of Machine Learning Research, 3(2):507-554, 2002.
5. Robert G. Cowell, A. Philip Dawid, Steffen L. Lauritzen, and David J. Spiegelhalter. Probabilistic Networks and Expert Systems. Springer Verlag, 1999.
6. A. Philip Dawid. Conditional independence in statistical theory. Journal of the Royal Statistical Society B, 41(1):1-31, 1979.
7. Matthias Franz. CONVEX, a Maple package for convex geometry. Available electronicly at www. math.uwo.ca/̃mfranz/convex/, 2009.
8. Komei Fukuda. CDD and CDD+, an implementation of the double description method. Available electronicly at www.ifor.math.ethz.ch/̃fukuda/cdd-home/ cdd.html, 2008.
9. Dan Geiger, Tom Verma, and Judea Pearl. D-separation: from theorems to algorithms. In Proceedings of the 5th Conference on Uncertainty in Artificial Intelligence, pages 118-125, Elsevier, 1989.
10. Raymond Hemmecke, Jason Morton, Anne Shiu, Bernd Sturmfels, and Oliver Wienand. Three counter-examples on semi-graphoids. Combinatorics, Probability and Computing, 17(2):239-257, 2008.
11. IBM Ilog team. CPLEX, a mathematical programming optimizer. Available electronicly at www-01.ibm.com/software/integration/optimization/cplex/, 2009.
12. Finn V. Jensen. Bayesian Networks and Decision Graphs. Springer Verlag, 2001.
13. Steffen L. Lauritzen. Graphical Models. Clarendon Press, 1996.
14. Richard E. Neapolitan. Learning Bayesian Networks. Pearson Prentice Hall, 2004.
15. Mathias Niepert, Dirk van Gucht, and Marc Gyssens. On the conditional independence implication problem, a lattice theoretic approach. In Proceedings of the 24th Conference on Uncertainty in Artificial Intelligence, pages 435-443, AUAI Press, 2008.
16. Mathias Niepert. Logical inference algorithms and matrix representations for probabilistic conditional independence. In Proceedings of the 25th Conference on Uncertainty in Artificial Intelligence, pages 428-435, AUAI Press, 2009.
17. Mathias Niepert, Dirk van Gucht, and Marc Gyssens. Logical and algorithmic properties of stable conditional independence. International Journal of Approximate Reasoning, 51(5):531-543, 2010.
18. Judea Pearl. Probabilistic Reasoning in Intelligent Systems. Morgan Kaufmann, 1988.
19. Alexander Schrijver. Theory of Linear and Integer Programming. John Wiley, 1986.
20. Petr Šimeček. Independence models (in Czech). PhD thesis, Charles University, Prague, 2007.
21. Milan Studený. Multiinformation and the problem of characterization of conditional independence relations. Problems of Control and Information Theory, 18(1):3-16, 1989.
22. Milan Studený. Convex set functions I and II. Research reports n. 1733 and 1734, Institute of Information Theory and Automation, Prague, November 1991.
23. Milan Studený. Conditional independence relations have no finite complete characterization. In Information Theory, Statistical Decision Functions and Random Processes, Transactions of the 11th Prague Conference, vol. B (S. Kubík, J. Á. Víšek eds.), pages 377-396, Kluwer, 1992.
24. Milan Studený. Convex cones in finite-dimensional real vector spaces. Kybernetika, 29(2):180-200, 1993.
25. Milan Studený, Remco R. Bouckaert, and TomÁš Kočka. Extreme supermodular set functions over five variables. Research report n. 1977, Institute of Information Theory and Automation, Prague, January 2000.
26. Milan Studený. Structural imsets, an algebraic method for describing conditional independence structures. In Proceedings of IPMU 2004 (B. Bouchon-Meunier, G. Coletti, R. R. Yager eds.), pages 1323-1330, 2004.
27. Milan Studený. Probabilistic Conditional Independence Structures. Springer Verlag, 2005.
28. Milan Studený, Ji?rí Vomlel, and Raymond Hemmecke. A geometric view on learning Bayesian network structures. International Journal of Approximate Reasoning, 51(5):573-586, 2010.
29. Milan Studený and Ji?rí Vomlel. On open questions in the geometric approach to structural learning
30. 4ti2 team. 4TI2, a software package for algebraic, geometric and combinatorial problems on linear spaces. Available electronicly at www.4ti2.de, 2008.