Algorithms for convex hull finding in undirected graphical models

DOI10.1016/J.AMC.2023.127852MaRDI QIDQ2698143zbMATH OpenOpenAlexFDO

Authors Pei Heng, Yi Sun

Publication date 21 April 2023

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2023.127852

zbMATH Keywords

graphical modelconvex hullvariable eliminationcollapsibilityinducing pathstructural dimension reduction

Mathematics Subject Classification ID

Multivariate analysis (62Hxx) Graph theory (05Cxx) Artificial intelligence (68Txx)

Recommendations

• Finding the minimal set for collapsible graphical models
• A new notion of convexity in digraphs with an application to Bayesian networks
• Collapsibility for directed acyclic graphs
• Computing simple-path convex hulls in hypergraphs
• Covariance selection for nonchordal graphs via chordal embedding

Cites work

• scientific article; zbMATH DE number 48089 (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 3069580 (Why is no real title available?)
• A conditional independence algorithm for learning undirected graphical models
• A new algorithm for decomposition of graphical models
• A projection-based conditional dependence measure with applications to high-dimensional undirected graphical models
• A survey on learning approaches for undirected graphical models. Application to scene object recognition
• Algorithmic Aspects of Vertex Elimination on Graphs
• An extension of the results of Asmussen and Edwards on collapsibility in contingency tables
• Ancestral graph Markov models.
• Chain Graph Models and their Causal Interpretations
• Collapsibility and response variables in contingency tables
• Collapsibility for directed acyclic graphs
• Collapsibility of conditional graphical models
• Convexity in graphs
• Finding the minimal set for collapsible graphical models
• Foundations of Data Science
• Marginalization and collapsibility in graphical interaction models
• Minimal triangulation of a graph and optimal pivoting order in a sparse matrix
• On principal graphical models with application to gene network
• Optimal decomposition by clique separators
• Probabilistic graphical models.
• The Use of Linear Graphs in Gauss Elimination
• The computational complexity of probabilistic inference using Bayesian belief networks

This page was built for publication: Algorithms for convex hull finding in undirected graphical models

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