This paper addresses the problem of finding a Bayesian net representation of the probability function that agrees with the distributions of multiple consistent datasets and otherwise has maximum entropy. We give a general algorithm which is significantly more efficient than the standard brute-force approach. Furthermore, we show that in a wide range of cases such a Bayesian net can be obtained without solving any optimisation problem.
Objective Bayesian Nets From Consistent Datasets / J. Landes, J. Williamson (AIP CONFERENCE PROCEEDINGS). - In: Bayesian inference and maximum entropy methods in science and engineering / [a cura di] A. Giffin, K.H. Knuth. - [s.l] : AIP, 2016. - ISBN 978-0-7354-1415-0. - pp. 1-8 (( Intervento presentato al 35. convegno International Workshop on Bayesian Inference and Maximum Entropy Methods in Science and Engineering (MaxEnt) tenutosi a Potsdam nel 2015 [10.1063/1.4959048].
Objective Bayesian Nets From Consistent Datasets
J. Landes;
2016
Abstract
This paper addresses the problem of finding a Bayesian net representation of the probability function that agrees with the distributions of multiple consistent datasets and otherwise has maximum entropy. We give a general algorithm which is significantly more efficient than the standard brute-force approach. Furthermore, we show that in a wide range of cases such a Bayesian net can be obtained without solving any optimisation problem.File | Dimensione | Formato | |
---|---|---|---|
1.4959048.pdf
accesso aperto
Tipologia:
Publisher's version/PDF
Dimensione
400.08 kB
Formato
Adobe PDF
|
400.08 kB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.