Creating non-minimal triangulations for use in inference in mixed stochastic/deterministic graphical models

DOI10.1007/s10994-010-5233-4zbMath1446.62163arXiv1206.6825OpenAlexW2048041057MaRDI QIDQ415616

Chris D. Bartels, Jeff A. Bilmes

Publication date: 8 May 2012

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1206.6825

zbMATH Keywords

triangulationgraph theoryinferencegraphical models

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Probabilistic graphical models (62H22)

Related Items (3)

All roads lead to Rome -- new search methods for the optimal triangulation problem ⋮ Mixed deterministic and probabilistic networks ⋮ Minimum Average Distance Clique Trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• AND/OR search spaces for graphical models
• Minimal triangulation of a graph and optimal pivoting order in a sparse matrix
• Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
• On probabilistic inference by weighted model counting
• Triangulated graphs and the elimination process
• Nonserial dynamic programming
• The Use of Linear Graphs in Gauss Elimination
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Complexity of Finding Embeddings in a k-Tree
• Computing the Minimum Fill-In is NP-Complete
• Algorithmic Aspects of Vertex Elimination on Graphs
• The generalized distributive law
• How to use the minimal separators of a graph for its chordal triangulation
• Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
• A Computing Procedure for Quantification Theory
• A machine program for theorem-proving
• Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
• The complexity of theorem-proving procedures
• Topological parameters for time-space tradeoff
• Recursive conditioning

This page was built for publication: Creating non-minimal triangulations for use in inference in mixed stochastic/deterministic graphical models