A lattice-based representation of independence relations for efficient closure computation

DOI10.1016/J.IJAR.2020.08.002MaRDI QIDQ2206476zbMATH OpenOpenAlexFDO

Authors Linda C. van der Gaag, Marco Baioletti, Janneke H. Bolt

Publication date 22 October 2020

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

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

zbMATH Keywords

algorithm engineeringfast-closure computationindependence relationslattice-based partitioningrepresentation

Mathematics Subject Classification ID

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

Recommendations

• Exploiting independencies to compute semigraphoid and graphoid structures
• Computing concise representations of semi-graphoid independency models
• Conditional independence structure and its closure: inferential rules and algorithms
• Concise representations and construction algorithms for semi-graphoid independency models
• scientific article; zbMATH DE number 219256

Cites work

• Concise representations and construction algorithms for semi-graphoid independency models
• Conditional independence structure and its closure: inferential rules and algorithms
• scientific article; zbMATH DE number 176109 (Why is no real title available?)
• scientific article; zbMATH DE number 3635280 (Why is no real title available?)
• scientific article; zbMATH DE number 2150792 (Why is no real title available?)
• scientific article; zbMATH DE number 3204690 (Why is no real title available?)
• Probabilistic graphical models.
• Semigraphoids and structures of probabilistic conditional independence

This page was built for publication: A lattice-based representation of independence relations for efficient closure computation

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