Stable independence and complexity of representation

Authors:
Peter de Waal;Linda C. van der Gaag
Affiliations:
Utrecht University, The Netherlands;Utrecht University, The Netherlands
Venue:
UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
Year:
2004

Citing 3
Cited 3

An assumption-based TMS

Artificial Intelligence
Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference

Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference
Semigraphoids and structures of probabilistic conditional independence

Annals of Mathematics and Artificial Intelligence

Degrees of conditional (in)dependence: A framework for approximate Bayesian networks and examples related to the rough set-based feature selection

Information Sciences: an International Journal
Logical inference algorithms and matrix representations for probabilistic conditional independence

UAI '09 Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence
Logical and algorithmic properties of stable conditional independence

International Journal of Approximate Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

The representation of independence relations generally builds upon the well-known semigraphoid axioms of independence. Recently, a representation has been proposed that captures a set of dominant statements of an independence relation from which any other statement can be generated by means of the axioms; the cardinality of this set is taken to indicate the complexity of the relation. Building upon the idea of dominance, we introduce the concept of stability to provide for a more compact representation of independence. We give an associated algorithm for establishing such a representation. We show that, with our concept of stability, many independence relations are found to be of lower complexity than with existing representations.