Exploiting Stability for Compact Representation of Independency Models

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10369)

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.

References

  1. 1.
    Baioletti, M., Busanello, G., Vantaggi, B.: Conditional independence structure and its closure: inferential rules and algorithms. Int. J. Approx. Reason. 50, 1097–1114 (2009)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    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)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    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)Google Scholar
  4. 4.
    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)Google Scholar
  5. 5.
    Niepert, M., Van Gucht, D., Gyssens, M.: Logical and algorithmic properties of stable conditional independence. Int. J. Approx. Reason. 51, 531–543 (2010)MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, Palo Alto (1988)MATHGoogle Scholar
  7. 7.
    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)Google Scholar
  8. 8.
    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)Google Scholar
  9. 9.
    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)Google Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.Department of Information and Computing SciencesUtrecht UniversityUtrechtThe Netherlands
  2. 2.SYSTeMS Research GroupGhent UniversityZwijnaardeBelgium

Personalised recommendations