A note on minimal d-separation trees for structural learning

DOI10.1016/j.artint.2010.01.002zbMath1211.68290OpenAlexW2095201913MaRDI QIDQ969533

Bing-Yi Jing, Binghui Liu, Jian-hua Guo

Publication date: 7 May 2010

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2010.01.002

zbMATH Keywords

minimal triangulationBayesian networkstructural learningclique treeseparation treeminimal d-separation tree

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (6)

Identifiability of intermediate variables on causal paths ⋮ Discovering causes and effects of a given node in Bayesian networks ⋮ Decomposition of Covariate-Dependent Graphical Models with Categorical Data ⋮ Structural learning for Bayesian networks by testing complete separators in prime blocks ⋮ A new algorithm for decomposition of graphical models ⋮ Decomposition of two classes of structural models

Uses Software

• TETRAD

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimal triangulations of graphs: a survey
• Minimal fill in O(\(n^{2.69}\)) time
• Causation, prediction, and search
• Minimal triangulation of a graph and optimal pivoting order in a sparse matrix
• Maximum cardinality search for computing minimal triangulations of graphs
• Optimal decomposition by clique separators
• Decomposition of structural learning about directed acyclic graphs
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• A Fast Algorithm for Finding an Optimal Ordering for Vertex Elimination on a Graph
• Probabilistic Networks and Expert Systems
• Algorithms and Computation
• A wide-range algorithm for minimal triangulation from an arbitrary ordering
• Computing Minimal Triangulations in Time O(nalpha log n) = o(n2.376)

This page was built for publication: A note on minimal d-separation trees for structural learning