Racing algorithms for conditional independence inference

DOI10.1016/j.ijar.2006.06.018zbMath1122.68130OpenAlexW2105926063MaRDI QIDQ997057

Remco R. Bouckaert, Milan Studený

Publication date: 19 July 2007

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

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

zbMATH Keywords

algorithminferenceconditional independenceimset

Mathematics Subject Classification ID

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

Related Items (7)

A computational algebraic-geometry method for conditional-independence inference ⋮ Acyclic directed graphs representing independence models ⋮ Finding P–Maps and I–Maps to Represent Conditional Independencies ⋮ On the completeness of the semigraphoid axioms for deriving arbitrary from saturated conditional independence statements ⋮ A reconstruction algorithm for the essential graph ⋮ Exploiting independencies to compute semigraphoid and graphoid structures ⋮ Logical and algorithmic properties of stable conditional independence

Uses Software

• TETRAD

Cites Work

• Causation, prediction, and search
• Logical and algorithmic properties of conditional independence and graphical models
• Conditional independence in valuation-based systems
• Markov properties of nonrecursive causal models
• Alternative Markov Properties for Chain Graphs
• Probabilistic Networks and Expert Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Racing algorithms for conditional independence inference