Mixture of Markov trees for Bayesian network structure learning with small datasets in high dimensional space
From MaRDI portal
(Redirected from Publication:3011948)
Probability distributions: general theory (60E05) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Learning and adaptive systems in artificial intelligence (68T05) Bayesian problems; characterization of Bayes procedures (62C10)
Recommendations
- The max-min hill-climbing Bayesian network structure learning algorithm
- Learning Bayesian networks with local structure, mixed variables, and exact algorithms
- Learning Moral Graphs in Construction of High-Dimensional Bayesian Networks for Mixed Data
- A Fast Hill-Climbing Algorithm for Bayesian Networks Structure Learning
- Learning Bayesian network structure from small data set
Cites work
- scientific article; zbMATH DE number 140408 (Why is no real title available?)
- 10.1162/153244303321897717
- A Bayesian method for the induction of probabilistic networks from data
- Approximating discrete probability distributions with dependence trees
- Causation, prediction, and search
- Fusion, propagation, and structuring in belief networks
- Learning Bayesian networks: The combination of knowledge and statistical data
- The max-min hill-climbing Bayesian network structure learning algorithm
This page was built for publication: Mixture of Markov trees for Bayesian network structure learning with small datasets in high dimensional space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3011948)
