Concise representations and construction algorithms for semi-graphoid independency models

DOI10.1016/J.IJAR.2016.06.011zbMATH Open1406.62052OpenAlexW2467778979MaRDI QIDQ2374537FDOQ2374537

Authors: Stavros Lopatatzidis, Linda C. van der Gaag 

Publication date: 15 December 2016

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

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

Recommendations

• Computing concise representations of semi-graphoid independency models
• Exploiting stability for compact representation of independency models
• scientific article; zbMATH DE number 219256
• Semigraphoids and structures of probabilistic conditional independence
• Exploiting independencies to compute semigraphoid and graphoid structures

zbMATH Keywords

conditional independenceclosureclosure representationdominant independence statementssemi-graphoid axioms

Mathematics Subject Classification ID

Characterization and structure theory for multivariate probability distributions; copulas (62H05) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Bayesian Networks and Decision Graphs
• Logical and algorithmic properties of conditional independence and graphical models
• Semigraphoids and structures of probabilistic conditional independence
• Conditional independence structure and its closure: inferential rules and algorithms
• Stochastic independence, causal independence, and shieldability

Cited In (7)

• An algorithm for reading dependencies from the minimal undirected independence map of a graphoid that satisfies weak transitivity
• Properties of semi-elementary imsets as sums of elementary imsets
• Computing concise representations of semi-graphoid independency models
• Title not available (Why is that?)
• Exploiting stability for compact representation of independency models
• Representing independence models with elementary triplets
• A lattice-based representation of independence relations for efficient closure computation

This page was built for publication: Concise representations and construction algorithms for semi-graphoid independency models

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