Abstract
Dynamic directed evidential network with conditional belief functions (DDEVN) is a framework for reasoning under uncertainty over systems evolving in time. Based on the theory of belief function, the DDEVN allows to faithfully represent various forms of uncertainty.
In this paper, we propose a new algorithm for inference in DDEVNs. We especially present a computational structure, namely the mixed binary join tree, which is appropriate for the exact inference in these networks.
This is a preview of subscription content, log in via an institution to check access.
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 Yaghlane, B., Mellouli, K.: Inference in Directed Evidential Networks Based on the Transferable Belief Model. Int. J. Approx. Reasoning 48(2), 399–418 (2008)
Heni, A., Ben Amor, N., Benferhat, S., Alimi, A.: Dynamic Possibilistic Networks: Representation and Exact Inference. In: IEEE International Conference on Computational Intelligence for Measurement Systems and Applications (CIMSA 2007), Ostuni, Italy, pp. 1–8 (2007)
Laâmari, W., Ben Yaghlane, B., Simon, C.: Dynamic Directed Evidential Networks with Conditional Belief Functions: Application to System Reliability. In: Greco, S., Bouchon-Meunier, B., Coletti, G., Fedrizzi, M., Matarazzo, B., Yager, R.R. (eds.) IPMU 2012, Part III. CCIS, vol. 299, pp. 481–490. Springer, Heidelberg (2012)
Laâmari, W., Ben Yaghlane, B., Simon, C.: On the Complexity of the Graphical Representation and the Belief Inference in the Dynamic Directed Evidential Networks with Conditional Belief Functions. In: Hüllermeier, E., Link, S., Fober, T., Seeger, B. (eds.) SUM 2012. LNCS, vol. 7520, pp. 206–218. Springer, Heidelberg (2012)
Murphy, K.: Dynamic Bayesian Networks: Representation, Inference and Learning. PhD thesis, Dept. Computer Science, UC, Berkeley (2002)
Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann (1988)
Shafer, G.: A Mathematical Theory of Evidence. Princeton University Press, Princeton (1976)
Shenoy, P.P.: Binary Join Trees for Computing Marginals in the Shenoy-Shafer Architecture. Int. J. Approx. Reasoning 17(2-3), 239–263 (1997)
Shenoy, P.P., Shafer, G.: Axioms for probability and belief functions propagation. Uncertainty in Artificial Intelligence 4, 159–198 (1990)
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.: Belief Function: the Disjunctive Rule of Combination and the Generalized Bayesian Theorem. Int. J. Approx. Reasoning 9, 1–35 (1993)
Weber, P., Simon, C.: Dynamic Evidential Networks in System Reliability Analysis: A Dempster Shafer Approach. In: 16th Mediterranean Conference on Control and Automation, France, vol. 93, pp. 262–267 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Laâmari, W., Yaghlane, B.B., Simon, C. (2013). On the Use of a Mixed Binary Join Tree for Exact Inference in Dynamic Directed Evidential Networks with Conditional Belief Functions. In: Wang, M. (eds) Knowledge Science, Engineering and Management. KSEM 2013. Lecture Notes in Computer Science(), vol 8041. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39787-5_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-39787-5_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39786-8
Online ISBN: 978-3-642-39787-5
eBook Packages: Computer ScienceComputer Science (R0)