Racing algorithms for conditional independence inference

DOI10.1016/J.IJAR.2006.06.018MaRDI QIDQ997057zbMATH OpenOpenAlexFDO

Authors Remco 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

algorithmconditional independenceinferenceimset

Mathematics Subject Classification ID

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

Recommendations

• Symbolic and Quantitative Approaches to Reasoning with Uncertainty
• Efficient algorithms for conditional independence inference
• A computational algebraic-geometry method for conditional-independence inference
• A linear-algebraic tool for conditional independence inference
• Logical and algorithmic properties of stable conditional independence

Cites work

• scientific article; zbMATH DE number 992990 (Why is no real title available?)
• 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 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2150792 (Why is no real title available?)
• scientific article; zbMATH DE number 4867 (Why is no real title available?)
• scientific article; zbMATH DE number 922429 (Why is no real title available?)
• Alternative Markov properties for chain graphs
• Causation, prediction, and search
• Conditional independence in valuation-based systems
• Logical and algorithmic properties of conditional independence and graphical models
• Markov properties of nonrecursive causal models
• Probabilistic Networks and Expert Systems

Cited in

(11)

• Exploiting independencies to compute semigraphoid and graphoid structures
• On the completeness of the semigraphoid axioms for deriving arbitrary from saturated conditional independence statements
• Acyclic directed graphs representing independence models
• Logical and algorithmic properties of stable conditional independence
• Efficient algorithms for conditional independence inference
• Symbolic and Quantitative Approaches to Reasoning with Uncertainty
• A reconstruction algorithm for the essential graph
• Finding P-maps and I-maps to represent conditional independencies
• Conditional independencies under the algorithmic independence of conditionals
• A computational algebraic-geometry method for conditional-independence inference
• A linear-algebraic tool for conditional independence inference

Describes a project that uses

Uses Software

• TETRAD

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

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