An algorithm to find a perfect map for graphoid structures

DOI10.1007/978-3-642-14055-6_1MaRDI QIDQ3163962zbMATH OpenOpenAlexFDO

Authors Marco Baioletti, Giuseppe Busanello, Barbara Vantaggi

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

conditional independence modelsinferential rulesacyclic directed graphsperfect map

Mathematics Subject Classification ID

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

Recommendations

• Finding P-maps and I-maps to represent conditional independencies
• Acyclic Directed Graphs to Represent Conditional Independence Models
• Acyclic directed graphs representing independence models
• scientific article; zbMATH DE number 219256
• An algorithm for reading dependencies from the minimal undirected independence map of a graphoid that satisfies weak transitivity

Cites work

• scientific article; zbMATH DE number 48812 (Why is no real title available?)
• scientific article; zbMATH DE number 3635280 (Why is no real title available?)
• scientific article; zbMATH DE number 1134987 (Why is no real title available?)
• scientific article; zbMATH DE number 2150792 (Why is no real title available?)
• Acyclic Directed Graphs to Represent Conditional Independence Models
• CONDITIONAL INDEPENDENCE STRUCTURES AND GRAPHICAL MODELS
• Conditional independence structure and its closure: inferential rules and algorithms
• Graphoid properties of epistemic irrelevance and independence
• Semigraphoids and structures of probabilistic conditional independence
• Stochastic independence in a coherent setting
• Strong conditional independence for credal sets

Cited in

(4)

• An optimal algorithm to generate rooted trivalent diagrams and rooted triangular maps
• Acyclic directed graphs representing independence models
• Finding P-maps and I-maps to represent conditional independencies
• On identifying tree-structured perfect maps

This page was built for publication: An algorithm to find a perfect map for graphoid structures

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