New propagation algorithm in dynamic directed evidential networks with conditional belief functions - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

New propagation algorithm in dynamic directed evidential networks with conditional belief functions

Résumé

Proposed as a subclass of directed evidential network with conditional belief functions (DEVN), dynamic directed evidential network with conditional belief functions (DDEVN) was introduced as a new approach for modeling systems evolving in time. Considered as an alternative to dynamic Bayesian network and dynamic possibilistic network, this framework enables to reason under uncertainty expressed in the belief function formalism. In this paper, we propose a new propagation algorithm in DDEVNs based on a new computational structure, namely the mixed binary join tree, which is appropriate for making the exact inference in these networks.
Fichier non déposé

Dates et versions

hal-00933164 , version 1 (20-01-2014)

Identifiants

  • HAL Id : hal-00933164 , version 1

Citer

Wafa Laâmari, Boutheina Ben Yaghlane, Christophe Simon. New propagation algorithm in dynamic directed evidential networks with conditional belief functions. International Symposium on Integrated Uncertainty in Knowledge Modelling and Decision Making, IUKM 2013, Jul 2013, Bejing, China. pp.CDROM. ⟨hal-00933164⟩
36 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More