Dirichlet Bayesian network scores and the maximum relative entropy principle
A classic approach for learning Bayesian networks from data is to identify a maximum a posteriori (MAP) network structure. In the case of discrete Bayesian networks, MAP networks are selected by maximising one of several possible Bayesian–Dirichlet (BD) scores; the most famous is the Bayesian–Dirich...
| Автор: | |
|---|---|
| Формат: | Journal article |
| Опубліковано: |
Springer
2018
|