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

Full description

Saved in:

Bibliographic Details
Published in:	International journal of intelligent systems Vol. 29; no. 7; pp. 615 - 633
Main Authors:	Ajroud, Amen, Benferhat, Salem
Format:	Journal Article
Language:	English
Published:	Hoboken, NJ Blackwell Publishing Ltd 01.07.2014 Wiley John Wiley & Sons, Inc
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!