Decomposable Probabilistic Influence Diagrams

DOI10.1017/S0269964800002035zbMath1134.60301MaRDI QIDQ3416009

Chiuh-Cheng Chyu

Publication date: 19 January 2007

Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

Applications of graph theory (05C90) Combinatorial probability (60C05)

Cites Work

• Fusion, propagation, and structuring in belief networks
• Markov fields and log-linear interaction models for contingency tables
• Influence diagrams for statistical modelling
• Triangulated graphs and the elimination process
• Graphical and Recursive Models for Contingency Tables
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Computing the Minimum Fill-In is NP-Complete
• Algorithmic Aspects of Vertex Elimination on Graphs
• Independence properties of directed markov fields

This page was built for publication: Decomposable Probabilistic Influence Diagrams