Structural learning for Bayesian networks by testing complete separators in prime blocks
DOI10.1016/J.CSDA.2011.06.017zbMATH Open1271.62048OpenAlexW2050063154MaRDI QIDQ1942894FDOQ1942894
Authors: Ping-Feng Xu, Jianhua Guo, Man-Lai Tang 
Publication date: 14 March 2013
Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.csda.2011.06.017
Recommendations
- Exact Bayesian structure discovery in Bayesian networks
- Learning Bayesian networks: The combination of knowledge and statistical data
- A decomposition algorithm for learning Bayesian networks based on scoring function
- Efficient structure learning of Bayesian networks using constraints
- Bayesian network structure learning: hybridizing complete search with independence tests
Bayesian inference (62F15) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)
Cites Work
- Causation, prediction, and search
- High-dimensional graphs and variable selection with the Lasso
- A characterization of Markov equivalence classes for acyclic digraphs
- Learning Bayesian networks: The combination of knowledge and statistical data
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- 10.1162/153244302760200696
- The max-min hill-climbing Bayesian network structure learning algorithm
- Title not available (Why is that?)
- Probabilistic Networks and Expert Systems
- Bayesian Networks and Decision Graphs
- Adaptive probabilistic networks with hidden variables
- Learning Bayesian networks from data: An information-theory based approach
- Title not available (Why is that?)
- Optimal decomposition by clique separators
- 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
- Towards scalable and data efficient learning of Markov boundaries
- Decomposition of search for \(v\)-structures in DAGs
- Title not available (Why is that?)
Cited In (2)
Uses Software
This page was built for publication: Structural learning for Bayesian networks by testing complete separators in prime blocks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1942894)
