A new algorithm for decomposition of graphical models

DOI10.1007/s10255-012-0170-6zbMath1254.05190OpenAlexW1974819392MaRDI QIDQ692688

Ping-feng Xu, Jian-hua Guo

Publication date: 6 December 2012

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-012-0170-6

zbMATH Keywords

decompositiongraphical modelsLeimer's algorithmMCS-M algorithmprime blocks

Mathematics Subject Classification ID

Multivariate analysis (62H99) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Algorithms for convex hull finding in undirected graphical models

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the effective implementation of the iterative proportional fitting procedure
• A note on minimal d-separation trees for structural learning
• Decomposition by clique separators
• Graphical models for associations between variables, some of which are qualitative and some quantitative
• Markov fields and log-linear interaction models for contingency tables
• Maximum cardinality search for computing minimal triangulations of graphs
• Structural learning for Bayesian networks by testing complete separators in prime blocks
• Optimal decomposition by clique separators
• Decomposition of structural learning about directed acyclic graphs
• Decomposition of search for \(v\)-structures in DAGs
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Algorithmic Aspects of Vertex Elimination on Graphs
• Triangulation of Bayesian networks by retriangulation

This page was built for publication: A new algorithm for decomposition of graphical models