Updating credal networks is approximable in polynomial time.
Denis Deratani MauáCassio P. de CamposMarco ZaffalonPublished in: Int. J. Approx. Reason. (2012)
Keyphrases
- credal networks
- bayesian networks
- maximum entropy
- set valued
- special case
- computational complexity
- worst case
- directed acyclic graph
- conditional independence
- dominance relation
- random variables
- approximation algorithms
- markov models
- data analysis
- higher order
- graphical models
- conditional random fields
- decision making