| Title: |
Maximum Entropy-Based Quantification for Probability Elicitation in Bayesian Networks |
| Authors: |
Onnes, Annet; Renooij, Silja; Sub Intelligent Systems; Sauerwald, Kai; Thimm, Matthias |
| Publication Year: |
2025 |
| Subject Terms: |
Bayesian Networks; Idioms; Maximum Entropy; Qualitative Constraints; Taverne; Theoretical Computer Science; General Computer Science |
| Description: |
This paper proposes a quantification method to support the elicitation process for Bayesian network construction. The method aims at reducing the number of subjective modelling choices that need to be made to arrive at an initial quantification of a Bayesian network. Our method allows domain experts to express their knowledge in the form of probability constraints. Then, exploiting recent insights concerning the computation of entropy in Bayesian networks, it uses the Maximum Entropy principle to determine a single quantification that makes no assumptions beyond the information provided by the domain experts. The quantification can be used in an iterative probability elicitation process. We provide an overview of our maximum entropy-based quantification method, detail how to express experts’ constraints for this technique for entropy maximisation and illustrate the method using an example. |
| Document Type: |
book part |
| File Description: |
application/pdf |
| Language: |
English |
| ISSN: |
0302-9743 |
| Relation: |
https://dspace.library.uu.nl/handle/1874/483182 |
| Availability: |
https://dspace.library.uu.nl/handle/1874/483182 |
| Rights: |
info:eu-repo/semantics/OpenAccess |
| Accession Number: |
edsbas.3C99095E |
| Database: |
BASE |