This paper deals with belief graphical models and probability-possibility transformations. It first analyzes some properties of transforming a credal network into a possibilistic one. In particular, we are interested in satisfying some properties of probability-possibility transformations like dominance and order preservation. The second part of the paper deals with using probability-possibility transformations in order to perform MAP inference in credal networks. This problem is known for its high computational complexity in comparison with MAP inference in Bayesian and possibilistic networks. The paper provides preliminary experimental results comparing our approach with both exact and approximate inference in credal networks.
CITATION STYLE
Benferhat, S., Levray, A., & Tabia, K. (2015). Probability-possibility transformations: Application to credal networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9310, pp. 203–219). Springer Verlag. https://doi.org/10.1007/978-3-319-23540-0_14
Mendeley helps you to discover research relevant for your work.