Decision Making by Credal Nets
Credal nets are probabilistic graphical models which extend Bayesian nets to cope with sets of distributions. This feature makes the model particularly suited for the implementation of classifiers and knowledge-based systems. When working with sets of (instead of single) probability distributions, the identification of the optimal option can be based on different criteria, some of them eventually leading to multiple choices. Yet, most of the inference algorithms for credal nets are designed to compute only the bounds of the posterior probabilities. This prevents some of the existing criteria from being used. To overcome this limitation, we present two simple transformations for credal nets which make it possible to compute decisions based on the maximality and E-admissibility criteria without any modification in the inference algorithms. We also prove that these decision problems have the same complexity of standard inference, being NPpp-hard for general credal nets and NP-hard for polytrees.
Alessandro Antonucci Cassio Polpo de Campos
IDSIA Lugano (Switzerland)
国际会议
杭州
英文
201-204
2011-08-26（万方平台首次上网日期，不代表论文的发表时间）