By Topic

Dynamic Possibilistic Networks: Representation and Exact Inference

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Heni, A. ; Univ. de Sfax, Sfax ; Amor, N.B. ; Benferhat, S. ; Alimi, A.

In this paper, we present dynamic possibilistic networks (DPNs); a new framework for modeling uncertain sequential data with possibilistic graphical models. Depending on the kind of conditioning, two types of networks are studied here: the product-based and the min-based networks. Hence two versions of an exact algorithm for inference in such networks are described here. The main contribution of this paper is the use of possibility theory as a framework for representation of temporal networks which gives an alternative framework for dynamic probabilistic networks. We especially, present how junction trees can be used to make online inference namely filtering problem in product-based DPNs and min- based DPNs and we will discuss how this technique can be extended to make prediction.

Published in:

Computational Intelligence for Measurement Systems and Applications, 2007. CIMSA 2007. IEEE International Conference on

Date of Conference:

27-29 June 2007