Representing independence models with elementary triplets

DOI10.1016/J.IJAR.2016.12.005MaRDI QIDQ2411286zbMATH OpenOpenAlexFDO

Authors Jose M. Peña

Publication date 20 October 2017

Published in International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1612.01095

zbMATH Keywords

causalityindependence modelselementary triplets

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37)

Abstract: In an independence model, the triplets that represent conditional independences between singletons are called elementary. It is known that the elementary triplets represent the independence model unambiguously under some conditions. In this paper, we show how this representation helps performing some operations with independence models, such as finding the dominant triplets or a minimal independence map of an independence model, or computing the union or intersection of a pair of independence models, or performing causal reasoning. For the latter, we rephrase in terms of conditional independences some of Pearl's results for computing causal effects.

Recommendations

• Computing concise representations of semi-graphoid independency models
• scientific article; zbMATH DE number 219256
• Semigraphoids and structures of probabilistic conditional independence
• CONDITIONAL INDEPENDENCE STRUCTURES AND GRAPHICAL MODELS
• Concise representations and construction algorithms for semi-graphoid independency models

Cites work

• scientific article; zbMATH DE number 5885087 (Why is no real title available?)
• scientific article; zbMATH DE number 176091 (Why is no real title available?)
• scientific article; zbMATH DE number 2150792 (Why is no real title available?)
• Acyclic directed graphs representing independence models
• Axioms of causal relevance
• Causality. Models, reasoning, and inference
• Computing concise representations of semi-graphoid independency models
• Conditional independence structure and its closure: inferential rules and algorithms
• Efficient algorithms for conditional independence inference
• Finding consensus Bayesian network structures
• Lengths of semigraphoid inferences
• On the Axiomization of Conditional Independence
• Qualitative combination of independence models
• The Statistical Implications of a System of Simultaneous Equations

Cited in

(1)

• Towards a classification of multi-faced independence: a representation-theoretic approach

This page was built for publication: Representing independence models with elementary triplets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2411286)