A recursive method for structural learning of directed acyclic graphs

zbMATH Open1225.68222MaRDI QIDQ3096115FDOQ3096115

Authors: Xianchao Xie, Zhi Geng 

Publication date: 8 November 2011

Full work available at URL: http://www.jmlr.org/papers/v9/xie08a.html

Recommendations

• Decomposition of structural learning about directed acyclic graphs
• Structural learning about directed acyclic graphs from multiple databases
• scientific article; zbMATH DE number 5968958
• A Gibbs sampler for learning DAGs
• Decomposition of two classes of structural models

zbMATH Keywords

Bayesian networkdecompositiondirected acyclic graphconditional independencestructural learning

Mathematics Subject Classification ID

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

Cited In (20)

• Objective Bayesian Nets for Integrating Consistent Datasets
• A new algorithm for decomposition of graphical models
• Discovering and orienting the edges connected to a target variable in a DAG via a sequential local learning approach
• Structural learning about directed acyclic graphs from multiple databases
• Hierarchical subspace identification of directed acyclic graphs
• Decomposition of structural learning about directed acyclic graphs
• Structural learning for Bayesian networks by testing complete separators in prime blocks
• CDSC: causal decomposition based on spectral clustering
• Title not available (Why is that?)
• Decomposition of search for \(v\)-structures in DAGs
• Learning causal graphs with latent confounders in weak faithfulness violations
• BNC-PSO: structure learning of Bayesian networks by particle swarm optimization
• Fast causal orientation learning in directed acyclic graphs
• Structural iterative lexicographic autoencoded node representation
• Decomposition of two classes of structural models
• Learning directed relational models with recursive dependencies
• A decomposition algorithm for learning Bayesian networks based on scoring function
• Discovering causes and effects of a given node in Bayesian networks
• Learning directed acyclic graph SPNs in sub-quadratic time
• A note on minimal d-separation trees for structural learning

Uses Software

• BNT

This page was built for publication: A recursive method for structural learning of directed acyclic graphs

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