loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Amen Ajroud 1 ; Mohamed Nazih Omri 1 ; Salem Benferhat 2 and Habib Youssef 3

Affiliations: 1 FSM, Université de Monastir, Tunisia ; 2 CRIL, Université d’Artois, France ; 3 ISITCOM, Université de Sousse, Tunisia

Keyword(s): Possibilistic networks, possibility distributions, approximate inference, DAG multiply connected.

Related Ontology Subjects/Areas/Topics: Artificial Intelligence ; Artificial Intelligence and Decision Support Systems ; Bayesian Networks ; Enterprise Information Systems ; Soft Computing

Abstract: Product-Based Possibilistic Networks appear to be important tools to efficiently and compactly represent possibility distributions. The inference process is a crucial task to propagate information into network when new pieces of information, called evidence, are observed. However, this inference process is known to be a hard task especially for multiply connected networks. In this paper, we propose an approximate algorithm for product-based possibilistic networks. More precisely, we propose an adaptation of the probabilistic approach “Loopy Belief Propagation” (LBP) for possibilistic networks.

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 18.207.161.212

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Ajroud, A.; Nazih Omri, M.; Benferhat, S. and Youssef, H. (2008). AN APPROXIMATE PROPAGATION ALGORITHM FOR PRODUCT-BASED POSSIBILISTIC NETWORKS. In Proceedings of the Tenth International Conference on Enterprise Information Systems - Volume 6: ICEIS; ISBN 978-989-8111-37-1; ISSN 2184-4992, SciTePress, pages 321-326. DOI: 10.5220/0001711403210326

@conference{iceis08,
author={Amen Ajroud. and Mohamed {Nazih Omri}. and Salem Benferhat. and Habib Youssef.},
title={AN APPROXIMATE PROPAGATION ALGORITHM FOR PRODUCT-BASED POSSIBILISTIC NETWORKS},
booktitle={Proceedings of the Tenth International Conference on Enterprise Information Systems - Volume 6: ICEIS},
year={2008},
pages={321-326},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001711403210326},
isbn={978-989-8111-37-1},
issn={2184-4992},
}

TY - CONF

JO - Proceedings of the Tenth International Conference on Enterprise Information Systems - Volume 6: ICEIS
TI - AN APPROXIMATE PROPAGATION ALGORITHM FOR PRODUCT-BASED POSSIBILISTIC NETWORKS
SN - 978-989-8111-37-1
IS - 2184-4992
AU - Ajroud, A.
AU - Nazih Omri, M.
AU - Benferhat, S.
AU - Youssef, H.
PY - 2008
SP - 321
EP - 326
DO - 10.5220/0001711403210326
PB - SciTePress