Racing algorithms for conditional independence inference

  title={Racing algorithms for conditional independence inference},
  author={Remco R. Bouckaert and Milan Studen{\'y}},
  journal={Int. J. Approx. Reasoning},
In this article, we consider the computational aspects of deciding whether a conditional independence statement t is implied by a list of conditional independence statements L using the independence implication provided by the method of structural imsets. We present two algorithmic methods which have the interesting complementary properties that one method performs well to prove that t is implied by L, while the other performs well to prove that t is not implied by L. However, both methods do… CONTINUE READING

Figures, Tables, and Topics from this paper.

Explore Further: Topics Discussed in This Paper

Similar Papers

Loading similar papers…