Abstract
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 implication related to the method of structural imsets. We present two 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 not perform well the opposite. This gives rise to a parallel algorithm in which both methods race against each other in order to determine effectively whether t is or is not implied.
Some empirical evidence is provided that suggest this racing algorithms method performs a lot better than an existing method based on so-called skeletal characterization of the respective implication. Furthermore, the method is able to handle more than five variables.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bouckaert, R.R., Studený, M.: Chain graphs: semantics and expressiveness. In: Froidevaux, C., Kohlas, J. (eds.) ECSQARU 1995. LNCS, vol. 946, pp. 67–76. Springer, Heidelberg (1995)
Cowell, R.G., Lauritzen, S.L., Dawid, A.P., Spiegelhalter, D.J.: Probabilistic Networks and Expert Systems. Springer, New York (1999)
Pearl, J.: Probabilistic Reasoning in Intelligent Systems. Morgan Kaufmann, San Mateo (1988)
Studený, M.: Conditional indpendence relations have no finite complete characterization. In: Kubík, S., Víšek, J.Á. (eds.) Information Theory, Statistical Decision Functions and Random Processes, vol. B, pp. 377–396. Kluwer, Dordrecht (1999)
Studený, M., Bouckaert, R.R., Kočka, T.: Extreme supermodular set functions over five variables, research report n. 1977, Institute of Information Theory and Automation, Prague (January 2000)
Studený, M.: Structural imsets: an algebraic method for describing conditional independence structures. In: Bouchon-Meunier, B., Coletti, G., Yager, R.R. (eds.) Proceedings of IPMU 2004, pp. 1323–1330 (2004)
Studený, M.: Probabilistic Conditional Independence Structures. Springer, London (2005)
Verma, T., Pearl, J.: Causal networks: semantics and expressiveness. In: Shachter, R.D., Lewitt, T.S., Kanal, L.N., Lemmer, J.F. (eds.) Uncertainty in Artificial Intelligence, vol. 4, pp. 69–76. North-Holland, Amsterdam (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bouckaert, R.R., Studený, M. (2005). Racing for Conditional Independence Inference. In: Godo, L. (eds) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2005. Lecture Notes in Computer Science(), vol 3571. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11518655_20
Download citation
DOI: https://doi.org/10.1007/11518655_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-27326-4
Online ISBN: 978-3-540-31888-0
eBook Packages: Computer ScienceComputer Science (R0)