Dirichlet Bayesian network scores and the maximum entropy principle
<p>A classic approach for learning Bayesian networks from data is to select the maximum a posteriori (MAP) network. In the case of discrete Bayesian networks, the MAP network is selected by maximising one of several possible Bayesian Dirichlet (BD) scores; the most famous is the Bayesian Diric...
Main Author: | Scutari, M |
---|---|
Format: | Conference item |
Published: |
Proceedings of Machine Learning Research
2017
|
Similar Items
-
Dirichlet Bayesian network scores and the maximum relative entropy principle
by: Scutari, M
Published: (2018) -
Objective Bayesianism and the Maximum Entropy Principle
by: Jon Williamson, et al.
Published: (2013-09-01) -
An empirical-Bayes score for discrete Bayesian networks
by: Scutari, M
Published: (2016) -
Entropy and the Kullback–Leibler Divergence for Bayesian Networks: Computational Complexity and Efficient Implementation
by: Marco Scutari
Published: (2024-01-01) -
Maximum entropy and Bayesian methods /
by: International Workshop on Maximum Entropy and Bayesian Methods (13th : 1993 : Santa Barbara, California), et al.
Published: (1996)