An Approximate Algorithm for Min-Based Possibilistic Networks

Min‐based (or qualitative) possibilistic networks are important tools to efficiently and compactly represent and analyze uncertain information. Inference is a crucial task in min‐based networks, which consists of propagating information through the network structure to answer queries. Exact inferenc...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of intelligent systems Jg. 29; H. 7; S. 615 - 633
Hauptverfasser: Ajroud, Amen, Benferhat, Salem
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Hoboken, NJ Blackwell Publishing Ltd 01.07.2014
Wiley
John Wiley & Sons, Inc
Schlagworte:
Algorithms
Applied sciences
Approximation
Computer science; control theory; systems
Convergence
Exact sciences and technology
Inference
Information retrieval. Graph
Intelligent systems
Networks
Propagation
Queries
Tasks
Theoretical computing
Belief
Network structure
Experimental result
Possibility theory
Probabilistic approach
Query
Information network
Imperfect information
Probabilistic net
Inference
Graph method
Information structure
ISSN:0884-8173, 1098-111X
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Min‐based (or qualitative) possibilistic networks are important tools to efficiently and compactly represent and analyze uncertain information. Inference is a crucial task in min‐based networks, which consists of propagating information through the network structure to answer queries. Exact inference computes posteriori possibility distributions, given some observed evidence, in a time proportional to the number of nodes of the network when it is simply connected (without loops). On multiply connected networks (with loops), exact inference is known as a hard problem. This paper proposes an approximate algorithm for inference in min‐based possibilistic networks. More precisely, we adapt the well‐known approximate algorithm Loopy Belief Propagation (LBP) on qualitative possibilistic networks. We provide different experimental results that analyze the convergence of possibilistic LBP.
Bibliographie:ark:/67375/WNG-MQ0JVD6K-W
istex:C3D2F407D1E3C3923AD75E9CBB85CF2B30E60F38
ArticleID:INT21649
benferhat@cril.fr
e‐mail
ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:0884-8173
1098-111X
DOI:10.1002/int.21649