Thinning a Triangulation of a Bayesian Network or Undirected Graph to Create a Minimal Triangulation
DOI10.1142/S0218488517500143zbMATH Open1393.68135OpenAlexW2615833777WikidataQ114822733 ScholiaQ114822733MaRDI QIDQ4600562FDOQ4600562
Authors: Edmund Jones, Vanessa Didelez 
Publication date: 11 January 2018
Published in: International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218488517500143
Recommendations
- Bayesian networks: the minimal triangulations of a graph
- Triangulation of Bayesian networks by retriangulation
- An extended depth-first search algorithm for optimal triangulation of Bayesian networks
- Creating non-minimal triangulations for use in inference in mixed stochastic/deterministic graphical models
- A review on distinct methods and approaches to perform triangulation for Bayesian networks
- Simple algorithms for minimal triangulation of a graph and backward selection of a decomposable Markov network
- scientific article; zbMATH DE number 1927376
- Graphs for margins of Bayesian networks
- Constructing Bayesian network graphs from labeled arguments
Multivariate analysis (62H99) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)
Cited In (4)
Uses Software
This page was built for publication: Thinning a Triangulation of a Bayesian Network or Undirected Graph to Create a Minimal Triangulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4600562)
