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...
Glavni autor: | Scutari, M |
---|---|
Format: | Journal article |
Izdano: |
Springer
2018
|
Slični predmeti
-
Dirichlet Bayesian network scores and the maximum entropy principle
od: Scutari, M
Izdano: (2017) -
An empirical-Bayes score for discrete Bayesian networks
od: Scutari, M
Izdano: (2016) -
On the Dirichlet Prior and Bayesian Regularization
od: Steck, Harald, i dr.
Izdano: (2004) -
On the relation between plausibility logic and the maximum-entropy
principle: a numerical study
od: Mana, P
Izdano: (2009) -
Credal Networks under Maximum Entropy
od: Lukasiewicz, T
Izdano: (2000)