Decomposable Probabilistic Influence Diagrams
From MaRDI portal
Publication:3416009
Recommendations
Cites work
- Algorithmic Aspects of Vertex Elimination on Graphs
- Computing the Minimum Fill-In is NP-Complete
- Fusion, propagation, and structuring in belief networks
- Graphical and Recursive Models for Contingency Tables
- Independence properties of directed markov fields
- Influence diagrams for statistical modelling
- Markov fields and log-linear interaction models for contingency tables
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Triangulated graphs and the elimination process
Cited in
(4)- Improvements to variable elimination and symbolic probabilistic inference for evaluating influence diagrams
- scientific article; zbMATH DE number 19873 (Why is no real title available?)
- scientific article; zbMATH DE number 176252 (Why is no real title available?)
- scientific article; zbMATH DE number 1849166 (Why is no real title available?)
This page was built for publication: Decomposable Probabilistic Influence Diagrams
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3416009)