Skip to content
Home
About Us
Resources
Profiles Metrics
Authors Directory
Institutions Directory
Top Authors
Top Institutions
Top Sponsors
AI Digest
Contact Us
Menu
Home
About Us
Resources
Profiles Metrics
Authors Directory
Institutions Directory
Top Authors
Top Institutions
Top Sponsors
AI Digest
Contact Us
Home
About Us
Resources
Profiles Metrics
Authors Directory
Institutions Directory
Top Authors
Top Institutions
Top Sponsors
AI Digest
Contact Us
Menu
Home
About Us
Resources
Profiles Metrics
Authors Directory
Institutions Directory
Top Authors
Top Institutions
Top Sponsors
AI Digest
Contact Us
Publication Details
AFRICAN RESEARCH NEXUS
SHINING A SPOTLIGHT ON AFRICAN RESEARCH
computer science
Anytime propagation algorithm for min-based possibilistic graphs
Soft Computing, Volume 8, No. 2, Year 2003
Notification
URL copied to clipboard!
Description
This paper proposes a new anytime possibilistic inference algorithm for min-based directed networks. Our algorithm departs from a direct adaptation of probabilistic propagation algorithms since it avoids the transformation of the initial network into a junction tree which is known to be a hard problem. The proposed algorithm is composed of several, local stabilization, procedures. Stabilization procedures aim to guarantee that local distributions defined on each node are coherent with respect to those of its parents. We provide experimental results which, for instance, compare our algorithm with the ones based on a direct adaptation of probabilistic propagation algorithms. © Springer-Verlag 2003.
Authors & Co-Authors
Ben Amor, Nahla
Tunisia, Le Bardo
Institut Supérieur de Gestion de Tunis
Benferhat, Salem
France, Arras
Universite D'artois
Mellouli, Khaled
Tunisia, Le Bardo
Institut Supérieur de Gestion de Tunis
Statistics
Citations: 60
Authors: 3
Affiliations: 2
Identifiers
Doi:
10.1007/s00500-002-0255-x
ISSN:
14327643
e-ISSN:
14337479