A new algorithm for decomposition of graphical models

DOI10.1007/S10255-012-0170-6MaRDI QIDQ692688zbMATH OpenOpenAlexFDO

Authors Ping-Feng Xu, Jianhua 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) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Recommendations

• A model searching method based on marginal model stuctures
• Decomposition of two classes of structural models
• scientific article; zbMATH DE number 1456953
• Sampling decomposable graphs using a Markov chain on junction trees
• Prime Testing for the Split Decomposition of a Graph

Cites work

• scientific article; zbMATH DE number 19874 (Why is no real title available?)
• scientific article; zbMATH DE number 554762 (Why is no real title available?)
• scientific article; zbMATH DE number 1134987 (Why is no real title available?)
• scientific article; zbMATH DE number 1149408 (Why is no real title available?)
• scientific article; zbMATH DE number 1493045 (Why is no real title available?)
• scientific article; zbMATH DE number 4121482 (Why is no real title available?)
• A note on minimal d-separation trees for structural learning
• A recursive method for structural learning of directed acyclic graphs
• Algorithmic Aspects of Vertex Elimination on Graphs
• Decomposition by clique separators
• Decomposition of search for \(v\)-structures in DAGs
• Decomposition of structural learning about directed acyclic graphs
• 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
• On the effective implementation of the iterative proportional fitting procedure
• Optimal decomposition by clique separators
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Structural learning for Bayesian networks by testing complete separators in prime blocks
• Triangulation of Bayesian networks by retriangulation

Cited in

(6)

• Decomposition of structural learning about directed acyclic graphs
• A New Approach for the Construction of Multiway Decision Graphs
• A model searching method based on marginal model stuctures
• Towards using the chordal graph polytope in learning decomposable models
• Algorithms for convex hull finding in undirected graphical models
• Model Reductions for Inference: Generality of Pairwise, Binary, and Planar Factor Graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q692688)