Finding P–Maps and I–Maps to Represent Conditional Independencies

DOI10.1007/978-3-642-22152-1_21zbMath1341.68237OpenAlexW180382554MaRDI QIDQ3011949

Giuseppe Busanello, Marco Baioletti, 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

perfect mapindependence modelsDAGindependence map

Mathematics Subject Classification ID

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

Uses Software

• TETRAD

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Acyclic directed graphs representing independence models
• The max-min hill-climbing Bayesian network structure learning algorithm
• Conditional independence structure and its closure: inferential rules and algorithms
• Racing algorithms for conditional independence inference
• Causation, prediction, and search
• Semigraphoids and structures of probabilistic conditional independence
• An Algorithm to Find a Perfect Map for Graphoid Structures
• Acyclic Directed Graphs to Represent Conditional Independence Models
• Probabilistic Networks and Expert Systems