Abstract
Belief function theory is an appropriate framework to model different forms of knowledge including probabilistic knowledge. One simple and efficient way to reason under uncertainty, is the use of compact graphical models, namely directed acyclic graphs. Therefore naturally, a question crosses the mind: If we deal with Bayesian belief knowledge does the network collapse into a Bayesian network? This paper attempts to answer this question by analyzing different forms of belief function networks defined with conditional beliefs defined either with a unique conditional distribution for all parents or a single conditional distribution for each single parent. We also propose a new method for the deconditionalization process to compute the joint distribution.
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
Ben Amor, N., Benferhat, S.: Graphoid properties of qualitative possibilistic independence. International Journal of Uncertainty, Fuzziness and Knowledge-Based 13, 59–96 (2005)
Ben Yaghlane, B., Mellouli, K.: Inference in directed evidential networks based on the transferable belief model. Int. J. Approx. Reasoning 48, 399–418 (2008)
Benferhat, S., Smaoui, S.: Hybrid possibilistic networks. Int. J. Approx. Reasoning 44(3), 224–243 (2007)
Darwiche, A.: Modeling and Reasoning with Bayesian Networks. Cambridge University Press, Cambridge (2009)
Dubois, D., Denoeux, T.: Statistical inference with belief functions and possibility measures: A discussion of basic assumptions. Combining Soft Computing and Statistical Methods in Data Analysis 77, 217–225 (2010)
Laâmari, W., Ben Yaghlane, B., Simon, C.: Comparing Evidential Graphical Models for Imprecise Reliability. In: Deshpande, A., Hunter, A. (eds.) SUM 2010. LNCS, vol. 6379, pp. 191–204. Springer, Heidelberg (2010)
Lewis, D.: Probabilities of conditionals and conditional probabilities. Philosophical Review 85, 297–315 (1976)
Pearl, J.: Probabilistic reasoning in intelligent systems: Networks of plausible inference. Morgan Kaufmann Publishers (1988)
Shafer, G.: A Mathematical Theory of Evidence. Princeton Univ. Press, Princeton (1976)
Shenoy, P.P.: Valuation networks and conditional independence. In: Heckerman, D., Mamdani, A. (eds.) Uncertainty in Artificial Intelligence, vol. 93, pp. 191–199. Morgan Kaufmann, San Francisco (1993)
Simon, C., Weber, P., Evsukoff, A.: Bayesian networks inference algorithm to implement dempster shafer theory in reliability analysis. Reliability Engineering and System Safety 93, 950–963 (2008)
Smets, P.: Un modèle mathématico-statistique simulant le processus du diagnostic médical. Ph.d. thesis, Université Libre de Bruxelles (1978)
Smets, P.: Resolving misunderstandings about belief functions. Int. J. Approx. Reasoning 6(3), 321–344 (1992)
Smets, P.: Belief functions: The disjunctive rule of combination and the generalized bayesian theorem. Int. J. Approx. Reasoning 9(1), 1–35 (1993)
Xu, H., Smets, P.: Reasoning in evidential networks with conditional belief functions. Int. J. Approx. Reasoning 14, 155–185 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Boukhris, I., Benferhat, S., Elouedi, Z. (2011). Representing Belief Function Knowledge with Graphical Models. In: Xiong, H., Lee, W.B. (eds) Knowledge Science, Engineering and Management. KSEM 2011. Lecture Notes in Computer Science(), vol 7091. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25975-3_21
Download citation
DOI: https://doi.org/10.1007/978-3-642-25975-3_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25974-6
Online ISBN: 978-3-642-25975-3
eBook Packages: Computer ScienceComputer Science (R0)