Abstract
In this paper, we exploit the symmetry of independence in the implementation of d-separation. We show that it can matter whether the search is conducted from start to goal or vice versa. Analysis reveals it is preferable to approach observed v-structure nodes from the bottom. Hence, a measure, called depth, is suggested to decide whether the search should run from start to goal or from goal to start. One salient feature is that depth can be computed during a pruning optimization step widely implemented. An empirical comparison is conducted against a clever implementation of d-separation. The experimental results are promising in two aspects. The effectiveness of our method increases with network size, as well as with the amount of observed evidence, culminating with an average time savings of 9% in the 9 largest BNs used in our experiments.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Darwiche, A.: Modeling and Reasoning with Bayesian Networks. Cambridge University Press, New York (2009)
Dawid, A.P.: Conditional independence in statistical theory. J. R. Stat. Soc. Ser. B (Methodol.) 41, 1–31 (1979)
Geiger, D., Verma, T.S., Pearl, J.: d-separation: from theorems to algorithms. In: Proceedings of the Fifth Conference on Uncertainty in Artificial Intelligence, pp. 139–148 (1989)
Goodfellow, I., Bengio, Y., Courville, A.: Deep Learning. MIT Press, Cambridge (2016)
Holte, R.C., Felner, A., Sharon, G., Sturtevant, N.R., Chen, J.: MM: a bidirectional search algorithm that is guaranteed to meet in the middle. Artif. Intell. 252, 232–266 (2017)
Koller, D., Friedman, N.: Probabilistic Graphical Models: Principles and Techniques. MIT Press, Cambridge (2009)
Lauritzen, S.L., Dawid, A.P., Larsen, B.N., Leimer, H.G.: Independence properties of directed Markov fields. Networks 20, 491–505 (1990)
Madsen, A.L., Jensen, F.V.: Lazy propagation: a junction tree inference algorithm based on lazy evaluation. Artif. Intell. 113(1–2), 203–245 (1999)
Mohan, K., Pearl, J.: On the testability of models with missing data. In: Proceedings of the Seventeenth International Conference on Artificial Intelligence and Statistics, vol. 33 (2014)
Neapolitan, R.E.: Probabilistic Methods for Bioinformatics: With an Introduction to Bayesian Networks. Morgan Kaufmann, San Francisco (2009)
Nobandegani, A.S., Psaromiligkos, I.N.: A rational distributed process-level account of independence judgment. arXiv preprint arXiv:1801.10186 (2018)
Pearl, J.: Fusion, propagation and structuring in belief networks. Artif. Intell. 29, 241–288 (1986)
Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, San Francisco (1988)
Pearl, J.: Belief networks revisited. Artif. Intell. 59, 49–56 (1993)
Pearl, J.: Causal Inference in Statistics: A Primer. Wiley, Hoboken (2016)
Pearl, J., Bareinboim, E.: External validity: from do-calculus to transportability across populations. Stat. Sci. 29(4), 579–595 (2014)
Shachter, R.D.: Bayes-ball: the rational pastime (for determining irrelevance and requisite information in belief networks and influence diagrams). In: Proceedings of the Fourteenth Conference on Uncertainty in Artificial Intelligence, pp. 480–487. Morgan Kaufmann Publishers Inc. (1998)
Shipley, B.: Cause and Correlation in Biology. Cambridge University Press, Cambridge (2016)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Butz, C.J., dos Santos, A.E., Oliveira, J.S., Madsen, A.L. (2019). Exploiting Symmetry of Independence in d-Separation. In: Meurs, MJ., Rudzicz, F. (eds) Advances in Artificial Intelligence. Canadian AI 2019. Lecture Notes in Computer Science(), vol 11489. Springer, Cham. https://doi.org/10.1007/978-3-030-18305-9_4
Download citation
DOI: https://doi.org/10.1007/978-3-030-18305-9_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-18304-2
Online ISBN: 978-3-030-18305-9
eBook Packages: Computer ScienceComputer Science (R0)