Exploiting independencies to compute semigraphoid and graphoid structures

DOI10.1016/J.IJAR.2010.11.001MaRDI QIDQ541838zbMATHOpenAlexFDO

Authors Marco Baioletti, Giuseppe Busanello, Barbara Vantaggi

Publication date 8 June 2011

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

Full work available at URL https://doi.org/10.1016/j.ijar.2010.11.001

zbMATH Keywords

projectionindependence modelsinferential rules

Mathematics Subject Classification ID

Applications of graph theory (05C90) Foundations and philosophical topics in statistics (62A01) Axioms; other general questions in probability (60A05)

Recommendations

• Semigraphoids and structures of probabilistic conditional independence
• Conditional independence structure and its closure: inferential rules and algorithms
• Computing concise representations of semi-graphoid independency models
• STRUCTURAL SEMIGRAPHOIDS¹
• scientific article; zbMATH DE number 219256

Cites work

• scientific article; zbMATH DE number 992990 (Why is no real title available?)
• scientific article; zbMATH DE number 4211299 (Why is no real title available?)
• scientific article; zbMATH DE number 3635280 (Why is no real title available?)
• scientific article; zbMATH DE number 1134987 (Why is no real title available?)
• scientific article; zbMATH DE number 3055208 (Why is no real title available?)
• Acyclic Directed Graphs to Represent Conditional Independence Models
• Axioms and algorithms for inferences involving probabilistic independence
• Conditional independence and natural conditional functions
• Conditional independence in a coherent finite setting
• Conditional independence structure and its closure: inferential rules and algorithms
• Ignorable common information, null sets and Basu's first theorem
• Logical and algorithmic properties of conditional independence and graphical models
• On stochastic conditional independence: The problems of characterization and description
• Racing algorithms for conditional independence inference
• Semigraphoids and structures of probabilistic conditional independence
• Separoids: a mathematical framework for conditional independence and irrelevance
• Stochastic independence in a coherent setting
• Stochastic independence, algebraic independence and abstract connectedness
• The L-separation criterion for description of cs-independence models
• The role of coherence for handling probabilistic evaluations and independence

Cited in

(11)

• scientific article; zbMATH DE number 219256 (Why is no real title available?)
• Computing concise representations of semi-graphoid independency models
• Exploiting stability for compact representation of independency models
• A lattice-based representation of independence relations for efficient closure computation
• Lengths of semigraphoid inferences
• Asymmetric decomposability and persegram representation in coherent conditional probability theory
• An algorithm for reading dependencies from the minimal undirected independence map of a graphoid that satisfies weak transitivity
• A computational algebraic-geometry method for conditional-independence inference
• scientific article; zbMATH DE number 2150792 (Why is no real title available?)
• DAG representation of asymmetric independence models arising in coherent conditional possibility theory
• Concise representations and construction algorithms for semi-graphoid independency models

Describes a project that uses

Uses Software

• Separoids

This page was built for publication: Exploiting independencies to compute semigraphoid and graphoid structures

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