NDLI: Approximate inference in qualitative possibilistic networks

Content Provider	IEEE Xplore Digital Library
Author	Ajroud, A. Benferhat, S.
Copyright Year	2011
Description	Author affiliation: CRIL - CNRS UMR 8188, Université d'Artois, Rue Jean Souvraz SP18, 62307 Lens Cedex, France (Benferhat, S.) \|\| PRINCE - ISITCOM, Université de Sousse, Route principale n°1, 4011, Hammam Sousse, Tunisia (Ajroud, A.)
Abstract	Min-based (or qualitative) possibilistic networks appear to be important tools to efficiently and compactly represent and analyze uncertain information. Inference is the crucial task which consists in propagating information through the network structure. Exact inference calculates posterior possibilistic distributions given an 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 considered as a hard problem. This paper proposes an approximate algorithm for inference in min-based possibilistic networks. More precisely, we apply the principle of a well-known approximate algorithm Loopy Belief Propagation (LBP) on qualitative possibilistic networks. In experimental results, we focus on convergence study of LBP and we show that the proposed algorithm gives remarkably good results that are better than LBP applied on quantitative possibilistic networks case [1].
Starting Page	1
Ending Page	6
File Size	766666
Page Count	6
File Format	PDF
ISBN	9781612849683
e-ISBN	9781612849683
e-ISBN	9781612849676
DOI	10.1109/NAFIPS.2011.5752011
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2011-03-18
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Approximation algorithms Inference algorithms Convergence Approximation methods Probabilistic logic Uncertainty Junctions
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Mr. Siddhartha Mukherjee siddhartha@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	ndl-support@iitkgp.ac.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Libarray of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Approximate Online Inference for Dynamic Markov Logic Networks

Approximate inference in dynamic possibilistic networks

Evaluation of qualitative possibilistic influence diagrams using strong junction trees

Effects of approximate representation in belief propagation for inference in wireless sensor networks

The optimal key estimation of stream ciphers and its approximation algorithm based on a probabilistic inference

Evaluation measures for learning probabilistic and possibilistic networks

Extending Description Logics with Uncertainty Reasoning in Possibilistic Logic (2007)

An extended probabilistic self-localization algorithm using hybrid maps

A compilation based approach to inference in dynamic evidential networks

Approximate inference in qualitative possibilistic networks

Similar Documents

Approximate Online Inference for Dynamic Markov Logic Networks

Approximate inference in dynamic possibilistic networks

Evaluation of qualitative possibilistic influence diagrams using strong junction trees

Effects of approximate representation in belief propagation for inference in wireless sensor networks

The optimal key estimation of stream ciphers and its approximation algorithm based on a probabilistic inference

Evaluation measures for learning probabilistic and possibilistic networks

Extending Description Logics with Uncertainty Reasoning in Possibilistic Logic (2007)

An extended probabilistic self-localization algorithm using hybrid maps

A compilation based approach to inference in dynamic evidential networks

Approximate inference in qualitative possibilistic networks