An Algorithm to Find a Perfect Map for Graphoid Structures

DOI10.1007/978-3-642-14055-6_1zbMath1213.68614OpenAlexW1601459929MaRDI QIDQ3163962

Marco Baioletti, Barbara Vantaggi, Giuseppe Busanello

Publication date: 27 October 2010

Published in: Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14055-6_1

zbMATH Keywords

perfect mapconditional independence modelsinferential rulesacyclic directed graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Data structures (68P05) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (1)

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

Cites Work

• Graphoid properties of epistemic irrelevance and independence
• Conditional independence structure and its closure: inferential rules and algorithms
• Semigraphoids and structures of probabilistic conditional independence
• Stochastic independence in a coherent setting
• Strong conditional independence for credal sets
• Acyclic Directed Graphs to Represent Conditional Independence Models
• CONDITIONAL INDEPENDENCE STRUCTURES AND GRAPHICAL MODELS
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An Algorithm to Find a Perfect Map for Graphoid Structures