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!

Schreiben Sie den ersten Kommentar!