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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	International journal of intelligent systems Ročník 29; číslo 7; s. 615 - 633
Hlavní autoři:	Ajroud, Amen, Benferhat, Salem
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Hoboken, NJ Blackwell Publishing Ltd 01.07.2014 Wiley John Wiley & Sons, Inc
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!