A new algorithm for decomposition of graphical models

DOI10.1007/S10255-012-0170-6zbMATH Open1254.05190OpenAlexW1974819392MaRDI QIDQ692688FDOQ692688

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

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

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)

Cites Work

• Graphical models for associations between variables, some of which are qualitative and some quantitative
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Decomposition by clique separators
• Title not available (Why is that?)
• Optimal decomposition by clique separators
• 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
• Markov fields and log-linear interaction models for contingency tables
• Title not available (Why is that?)
• Decomposition of structural learning about directed acyclic graphs
• A recursive method for structural learning of directed acyclic graphs
• A note on minimal d-separation trees for structural learning
• Maximum cardinality search for computing minimal triangulations of graphs
• Title not available (Why is that?)
• On the effective implementation of the iterative proportional fitting procedure
• Structural learning for Bayesian networks by testing complete separators in prime blocks
• Decomposition of search for \(v\)-structures in DAGs
• 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)