Efficient and effective Bayesian network local structure learning
DOI10.1007/S11704-014-3335-ZzbMATH Open1336.68226OpenAlexW2056217074MaRDI QIDQ2515433FDOQ2515433
Authors: Yunhai Tong, Zitian Wang, Shaohua Tan, Jianjun Yang 
Publication date: 5 August 2015
Published in: Frontiers of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11704-014-3335-z
Recommendations
- Efficient structure learning of Bayesian networks using constraints
- scientific article; zbMATH DE number 1222293
- An efficient Bayesian network structure learning strategy
- An Efficient Algorithm for Learning Bayesian Networks from Data
- Towards a fast and efficient algorithm for learning Bayesian network
Learning and adaptive systems in artificial intelligence (68T05) Reasoning under uncertainty in the context of artificial intelligence (68T37)
Cites Work
- Causation, prediction, and search
- Title not available (Why is that?)
- The max-min hill-climbing Bayesian network structure learning algorithm
- Probabilistic graphical models.
- Local causal and Markov blanket induction for causal discovery and feature selection for classification. Part I: Algorithms and empirical evaluation
- Emergent and spontaneous computation of factor relationships from a large factor set
Cited In (16)
- Exploiting local and repeated structure in dynamic Bayesian networks
- Improving Bayesian network local structure learning via data-driven symmetry correction methods
- Efficient structure learning of Bayesian networks using constraints
- Learning Bayesian networks with local structure, mixed variables, and exact algorithms
- An efficient Bayesian network structure learning strategy
- Title not available (Why is that?)
- Towards a fast and efficient algorithm for learning Bayesian network
- Structure learning in Bayesian networks of a moderate size by efficient sampling
- Title not available (Why is that?)
- Local structure learning in graphical models
- Improving structure MCMC for Bayesian networks through Markov blanket resampling
- Locally Bayesian learning in networks
- The max-min hill-climbing Bayesian network structure learning algorithm
- The role of local partial independence in learning of Bayesian networks
- Efficient local updates for undirected graphical models
- A justification of local conditioning in Bayesian networks
Uses Software
This page was built for publication: Efficient and effective Bayesian network local structure learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2515433)
