Acyclic Directed Graphs to Represent Conditional Independence Models

DOI10.1007/978-3-642-02906-6_46zbMath1203.68120OpenAlexW154881038MaRDI QIDQ3638176

Barbara Vantaggi, Giuseppe Busanello, Marco Baioletti

Publication date: 2 July 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02906-6_46

zbMATH Keywords

Perfect mapAcyclic directed graphsConditional independence modelsGraphoid propertiesInferential rules

Mathematics Subject Classification ID

Measures of association (correlation, canonical correlation, etc.) (62H20) Graph theory (including graph drawing) in computer science (68R10) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Related Items (4)

An Algorithm to Find a Perfect Map for Graphoid Structures ⋮ Acyclic directed graphs representing independence models ⋮ Finding P–Maps and I–Maps to Represent Conditional Independencies ⋮ Exploiting independencies to compute semigraphoid and graphoid structures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Conditional independence structure and its closure: inferential rules and algorithms
• Semigraphoids and structures of probabilistic conditional independence
• Stochastic independence in a coherent setting
• On chain graph models for description of conditional independence structures
• Conditional independence in a coherent finite setting

This page was built for publication: Acyclic Directed Graphs to Represent Conditional Independence Models