Abstract
The notion of stability in semi-graphoid independency models was introduced to describe the dynamics of (probabilistic) independency upon inference. We revisit the notion in view of establishing compact representations of semi-graphoid models in general. Algorithms for this purpose typically build upon dedicated operators for constructing new independency statements from a starting set of statements. In this paper, we formulate a generalised strong-contraction operator to supplement existing operators, and prove its soundness. We then embed the operator in a state-of-the-art algorithm and illustrate that the thus enhanced algorithm may establish more compact model representations.
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
Similar content being viewed by others
References
Baioletti, M., Busanello, G., Vantaggi, B.: Conditional independence structure and its closure: inferential rules and algorithms. Int. J. Approx. Reason. 50, 1097–1114 (2009)
Lopatatzidis, S., van der Gaag, L.C.: Concise representations and construction algorithms for semi-graphoid independency models. Int. J. Approx. Reason. 80, 377–392 (2015)
Matúš, F.: Ascending and descending conditional independence relations. In: Proceedings of the Eleventh Prague Conference on Information Theory, Statistical Decision Functions and Random Processes: B, pp. 189–200 (1992)
Niepert, M., Van Gucht, D., Gyssens, M.: A lattice-theoretic approach. In: Parr, R., van der Gaag, L.C. (eds.) Proceedings of the Twenty-Fourth Conference on Uncertainty in Artificial Intelligence, pp. 435–443. AUAI Press, Arlington (2008)
Niepert, M., Van Gucht, D., Gyssens, M.: Logical and algorithmic properties of stable conditional independence. Int. J. Approx. Reason. 51, 531–543 (2010)
Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, Palo Alto (1988)
Studený, M.: Conditional independence relations have no finite complete characterization. In: Kubík, S., Vísek, J.Á. (eds.) Information Theory, Statistical Decision Functions and Random Processes, pp. 377–396. Kluwer, Amsterdam (1992)
Studený, M.: Complexity of structural models. In: Proceedings of the Joint Session of the 6th Prague Conference on Asymptotic Statistics and the 13th Prague Conference on Information Theory, Statistical Decision Functions and Random Processes, vol. 2, pp. 521–528 (1998)
de Waal, P., van der Gaag, L.C.: Stable independence and complexity of representation. In: Chickering, M., Halpern, J. (eds.) Proceedings of the Twentieth Conference on Uncertainty in Artificial Intelligence, pp. 112–119. AUAI Press, Arlington (2004)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
van der Gaag, L.C., Lopatatzidis, S. (2017). Exploiting Stability for Compact Representation of Independency Models. In: Antonucci, A., Cholvy, L., Papini, O. (eds) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2017. Lecture Notes in Computer Science(), vol 10369. Springer, Cham. https://doi.org/10.1007/978-3-319-61581-3_10
Download citation
DOI: https://doi.org/10.1007/978-3-319-61581-3_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-61580-6
Online ISBN: 978-3-319-61581-3
eBook Packages: Computer ScienceComputer Science (R0)