Towards a fast and efficient algorithm for learning Bayesian network
From MaRDI portal
Publication:3461639
DOI10.1007/S11859-015-1084-YzbMATH Open1340.68062OpenAlexW776156914MaRDI QIDQ3461639FDOQ3461639
Authors: Yanying Li, Youlong Yang, Xiaofeng Zhu, Wenming Yang 
Publication date: 15 January 2016
Published in: Wuhan University Journal of Natural Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11859-015-1084-y
Recommendations
- Efficient and effective Bayesian network local structure learning
- An Efficient Algorithm for Learning Bayesian Networks from Data
- Efficient structure learning of Bayesian networks using constraints
- Construction of Bayesian network structures from data: A brief survey and an efficient algorithm
- The max-min hill-climbing Bayesian network structure learning algorithm
Cites Work
- Causation, prediction, and search
- Bayesian network structure learning by recursive autonomy identification
- Learning Bayesian networks: The combination of knowledge and statistical data
- Title not available (Why is that?)
- The max-min hill-climbing Bayesian network structure learning algorithm
- Learning high-dimensional directed acyclic graphs with latent and selection variables
- Towards scalable and data efficient learning of Markov boundaries
- On the properties of concept classes induced by multivalued Bayesian networks
Cited In (6)
- Title not available (Why is that?)
- Efficient and effective Bayesian network local structure learning
- Learning Bayesian network structures using weakest mutual-information-first strategy
- An Approach to Reduce the Number of Conditional Independence Tests in the PC Algorithm
- An Efficient Algorithm for Learning Bayesian Networks from Data
- Learning Bayesian networks by hill climbing: efficient methods based on progressive restriction of the neighborhood
Uses Software
This page was built for publication: Towards a fast and efficient algorithm for learning Bayesian network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3461639)
