A note on minimal d-separation trees for structural learning
DOI10.1016/J.ARTINT.2010.01.002zbMATH Open1211.68290OpenAlexW2095201913MaRDI QIDQ969533FDOQ969533
Authors: Binghui Liu, Bing-Yi Jing, Jianhua 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
Recommendations
- Minimal separators in dependency structures: properties and identification
- Decomposition of structural learning about directed acyclic graphs
- Structural learning for Bayesian networks by testing complete separators in prime blocks
- Construction of minimal \(d\)-separators in a dependency system
- A recursive method for structural learning of directed acyclic graphs
Bayesian networkstructural learningclique treeminimal triangulationseparation treeminimal d-separation tree
Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- Causation, prediction, and search
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Probabilistic Networks and Expert Systems
- Optimal decomposition by clique separators
- Minimal triangulations of graphs: a survey
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Title not available (Why is that?)
- Decomposition of structural learning about directed acyclic graphs
- A recursive method for structural learning of directed acyclic graphs
- Title not available (Why is that?)
- Computing Minimal Triangulations in Time O(nalpha log n) = o(n2.376)
- Maximum cardinality search for computing minimal triangulations of graphs
- A wide-range algorithm for minimal triangulation from an arbitrary ordering
- Minimal fill in O(\(n^{2.69}\)) time
- Minimal triangulation of a graph and optimal pivoting order in a sparse matrix
- A Fast Algorithm for Finding an Optimal Ordering for Vertex Elimination on a Graph
- Algorithms and Computation
Cited In (7)
- A new algorithm for decomposition of graphical models
- Structural learning for Bayesian networks by testing complete separators in prime blocks
- Minimal separators in dependency structures: properties and identification
- Decomposition of two classes of structural models
- Discovering causes and effects of a given node in Bayesian networks
- Identifiability of intermediate variables on causal paths
- Decomposition of Covariate-Dependent Graphical Models with Categorical Data
Uses Software
This page was built for publication: A note on minimal d-separation trees for structural learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q969533)
