Finding P-maps and I-maps to represent conditional independencies

DOI10.1007/978-3-642-22152-1_21MaRDI QIDQ3011949zbMATH OpenOpenAlexFDO

Authors Marco Baioletti, Giuseppe Busanello, Barbara Vantaggi

Publication date 29 June 2011

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-22152-1_21

zbMATH Keywords

DAGindependence mapindependence modelsperfect map

Mathematics Subject Classification ID

Applications of graph theory (05C90) Measures of association (correlation, canonical correlation, etc.) (62H20) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Recommendations

• Acyclic Directed Graphs to Represent Conditional Independence Models
• An algorithm to find a perfect map for graphoid structures
• Acyclic directed graphs representing independence models
• scientific article; zbMATH DE number 2088047
• Computing concise representations of semi-graphoid independency models

Cites work

• Acyclic directed graphs representing independence models
• Acyclic Directed Graphs to Represent Conditional Independence Models
• An algorithm to find a perfect map for graphoid structures
• Causation, prediction, and search
• Conditional independence structure and its closure: inferential rules and algorithms
• scientific article; zbMATH DE number 48812 (Why is no real title available?)
• scientific article; zbMATH DE number 1134987 (Why is no real title available?)
• scientific article; zbMATH DE number 1493045 (Why is no real title available?)
• scientific article; zbMATH DE number 2150792 (Why is no real title available?)
• Probabilistic graphical models.
• Probabilistic Networks and Expert Systems
• Racing algorithms for conditional independence inference
• Semigraphoids and structures of probabilistic conditional independence
• The max-min hill-climbing Bayesian network structure learning algorithm

Cited in

(2)

• An algorithm to find a perfect map for graphoid structures
• Acyclic directed graphs representing independence models

Describes a project that uses

Uses Software

• TETRAD

This page was built for publication: Finding P-maps and I-maps to represent conditional independencies

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