Mixture of Markov Trees for Bayesian Network Structure Learning with Small Datasets in High Dimensional Space
From MaRDI portal
Publication:3011948
DOI10.1007/978-3-642-22152-1_20zbMath1341.68149MaRDI QIDQ3011948
Publication date: 29 June 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22152-1_20
62C10: Bayesian problems; characterization of Bayes procedures
60E05: Probability distributions: general theory
68T05: Learning and adaptive systems in artificial intelligence
60J20: Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.)
Uses Software
Cites Work
- Fusion, propagation, and structuring in belief networks
- The max-min hill-climbing Bayesian network structure learning algorithm
- Causation, prediction, and search
- A Bayesian method for the induction of probabilistic networks from data
- Learning Bayesian networks: The combination of knowledge and statistical data
- 10.1162/153244303321897717
- Approximating discrete probability distributions with dependence trees
- Unnamed Item