Pivotal Pruning of Trade-Offs in QPNs
Abstract
Qualitative probabilistic networks have been designed for probabilistic reasoning in a qualitative way. Due to their coarse level of representation detail, qualitative probabilistic networks do not provide for resolving trade-offs and typically yield ambiguous results upon inference. We present an algorithm for computing more insightful results for unresolved trade-offs. The algorithm builds upon the idea of using pivots to zoom in on the trade-offs and identifying the information that would serve to resolve them.
Cite
Text
Renooij et al. "Pivotal Pruning of Trade-Offs in QPNs." Conference on Uncertainty in Artificial Intelligence, 2000.Markdown
[Renooij et al. "Pivotal Pruning of Trade-Offs in QPNs." Conference on Uncertainty in Artificial Intelligence, 2000.](https://mlanthology.org/uai/2000/renooij2000uai-pivotal/)BibTeX
@inproceedings{renooij2000uai-pivotal,
title = {{Pivotal Pruning of Trade-Offs in QPNs}},
author = {Renooij, Silja and van der Gaag, Linda C. and Parsons, Simon and Green, Shaw},
booktitle = {Conference on Uncertainty in Artificial Intelligence},
year = {2000},
pages = {515-522},
url = {https://mlanthology.org/uai/2000/renooij2000uai-pivotal/}
}