Abstract
Credal sets are closed convex sets of probability mass functions. The lower probabilities specified by a credal set for each element of the power set can be used as constraints defining a second credal set. This simple procedure produces an outer approximation, with a bounded number of extreme points, for general credal sets. The approximation is optimal in the sense that no other lower probabilities can specify smaller supersets of the original credal set. Notably, in order to be computed, the approximation does not need the extreme points of the credal set, but only its lower probabilities. This makes the approximation particularly suited for credal networks, which are a generalization of Bayesian networks based on credal sets. Although most of the algorithms for credal networks updating only return lower posterior probabilities, the suggested approximation can be used to evaluate (as an outer approximation of) the posterior credal set. This makes it possible to adopt more sophisticated decision making criteria, without having to replace existing algorithms. The quality of the approximation is investigated by numerical tests.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Levi, I.: The Enterprise of Knowledge. MIT Press, London (1980)
Walley, P.: Measures of uncertainty in expert systems. Artificial Intelligence 83(1), 1–58 (1996)
Cozman, F.G.: Credal networks. Artificial Intelligence 120, 199–233 (2000)
Antonucci, A., Zaffalon, M.: Decision-theoretic specification of credal networks: A unified language for uncertain modeling with sets of Bayesian networks. International Journal of Approximate Reasoning 49(2), 345–361 (2008)
de Campos, C.P., Cozman, F.G.: The inferential complexity of Bayesian and credal networks. In: Proceedings of the International Joint Conference on Artificial Intelligence, Edinburgh, pp. 1313–1318 (2005)
Cozman, F.G.: Graphical models for imprecise probabilities. International Journal of Approximate Reasoning 39(2-3), 167–184 (2005)
de Campos, C.P., Cozman, F.G.: Inference in credal networks through integer programming. In: Proceedings of the Fifth International Symposium on Imprecise Probability: Theories and Applications, Prague, Action M Agency, pp. 145–154 (2007)
Antonucci, A., Sun, Y., de Campos, C.P., Zaffalon, M.: Generalized loopy 2U: a new algorithm for approximate inference in credal networks. International Journal of Approximate Reasoning (to appear, 2010)
Wallner, A.: Maximal number of vertices of polytopes defined by f-probabilities. In: Proceedings of the Fourth International Symposium on Imprecise Probabilities and Their Applications, SIPTA, pp. 126–139 (2005)
Cuzzolin, F.: On the credal structure of consistent probabilities. In: Hölldobler, S., Lutz, C., Wansing, H. (eds.) JELIA 2008. LNCS (LNAI), vol. 5293, pp. 126–139. Springer, Heidelberg (2008)
Avis, D., Fukuda, K.: A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra. Discrete and Computational Geometry 8, 295–313 (1992)
Walley, P.: Statistical Reasoning with Imprecise Probabilities. Chapman and Hall, London (1991)
Antonucci, A., Piatti, A.: Modeling unreliable observations in Bayesian networks by credal networks. In: Proceedings of the 3rd International Conference on Scalable Uncertainty Management table of contents, pp. 28–39. Springer, Heidelberg (2009)
Troffaes, M.C.M.: Decision making under uncertainty using imprecise probabilities. International Journal of Approximate Reasoning 45(1), 17–29 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Antonucci, A., Cuzzolin, F. (2010). Credal Sets Approximation by Lower Probabilities: Application to Credal Networks. In: Hüllermeier, E., Kruse, R., Hoffmann, F. (eds) Computational Intelligence for Knowledge-Based Systems Design. IPMU 2010. Lecture Notes in Computer Science(), vol 6178. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14049-5_73
Download citation
DOI: https://doi.org/10.1007/978-3-642-14049-5_73
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14048-8
Online ISBN: 978-3-642-14049-5
eBook Packages: Computer ScienceComputer Science (R0)