On the complexity of the graphical representation and the belief inference in the dynamic directed evidential networks with conditional belief functions

3Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Directed evidential graphical models are important tools for handling uncertain information in the framework of evidence theory. They obtain their efficiency by compactly representing (in)dependencies between variables in the network and efficiently reasoning under uncertainty. This paper presents a new dynamic evidential network for representing uncertainty and managing temporal changes in data. This proposed model offers an alternative framework for dynamic probabilistic and dynamic possibilistic networks. A complexity study of representation and reasoning in the proposed model is also presented in this paper. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Laâmari, W., Ben Yaghlane, B., & Simon, C. (2012). On the complexity of the graphical representation and the belief inference in the dynamic directed evidential networks with conditional belief functions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7520 LNAI, pp. 206–218). https://doi.org/10.1007/978-3-642-33362-0_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free