Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Three-valued possibilistic networks
View through CrossRef
Possibilistic networks are graphical models that compactly encode joint possibility distributions. This paper studies a new form of possibilistic graphical models called three-valued possibilistic networks. Contrary to standard belief networks where the beliefs are encoded using belief degrees within the interval [0, 1], three-valued possibilistic networks only allow three values: 0, 1 and 0, 1. The first part of this paper addresses foundational issues of three-valued possibilistic networks. In particular, we show that the semantics that can be associated with a three-valued possibilistic network is a family of compatible boolean networks. The second part of the paper deals with inference issues where we propose an extension to the min-based chain rule for three-valued networks. Then, we show that the well-known junction tree algorithm can be directly adapted for the three-valued possibilistic setting.
Title: Three-valued possibilistic networks
Description:
Possibilistic networks are graphical models that compactly encode joint possibility distributions.
This paper studies a new form of possibilistic graphical models called three-valued possibilistic networks.
Contrary to standard belief networks where the beliefs are encoded using belief degrees within the interval [0, 1], three-valued possibilistic networks only allow three values: 0, 1 and 0, 1.
The first part of this paper addresses foundational issues of three-valued possibilistic networks.
In particular, we show that the semantics that can be associated with a three-valued possibilistic network is a family of compatible boolean networks.
The second part of the paper deals with inference issues where we propose an extension to the min-based chain rule for three-valued networks.
Then, we show that the well-known junction tree algorithm can be directly adapted for the three-valued possibilistic setting.
Related Results
Set-Valued Conditioning in a Possibility Theory Setting
Set-Valued Conditioning in a Possibility Theory Setting
Possibilistic logic is a well-known framework for dealing with uncertainty and reasoning under inconsistent or prioritized knowledge bases. This paper deals with conditioning uncer...
A Generalization of Possibilistic Fuzzy C-Means Method for Statistical Clustering of Data
A Generalization of Possibilistic Fuzzy C-Means Method for Statistical Clustering of Data
The Fuzzy C-means (FCM) algorithm has been widely used in the field of clustering and classification but has encountered difficulties with noisy data and outliers. Other versions o...
Single-Valued Neutrosophic Ideal Approximation Spaces
Single-Valued Neutrosophic Ideal Approximation Spaces
In this paper, we defined the basic idea of the single-valued neutrosophic upper (αn)δ, single-valued neutrosophic lower (αn)δ and single-valued neutrosophic boundary sets (αn)B of...
ACM SIGCOMM computer communication review
ACM SIGCOMM computer communication review
At some point in the future, how far out we do not exactly know, wireless access to the Internet will outstrip all other forms of access bringing the freedom of mobility to the way...
Chronotopes of foresight: Models of time‐space in probabilistic, possibilistic and constructivist futures
Chronotopes of foresight: Models of time‐space in probabilistic, possibilistic and constructivist futures
AbstractThe concept of chronotope was introduced in the 1920s by the Russian neurophysiologist A.A. Ukhtomsky, and extensively used by Mikhail Bakhtin in his analysis of the develo...
Mastering the Processing of Preferences by Using Symbolic Priorities in Possibilistic Logic
Mastering the Processing of Preferences by Using Symbolic Priorities in Possibilistic Logic
The paper proposes a new approach to the handling of preferences expressed in a compact way under the form of conditional statements. These conditional statements are translated in...
Some Connectivity Parameters of Interval-Valued Intuitionistic Fuzzy Graphs with Applications
Some Connectivity Parameters of Interval-Valued Intuitionistic Fuzzy Graphs with Applications
Connectivity in graphs is useful in describing different types of communication systems like neural networks, computer networks, etc. In the design of any network, it is essential ...
On LM-Valued F-Transforms, LM-Valued Fuzzy Rough Sets and LM-Valued Fuzzy Transformation Systems
On LM-Valued F-Transforms, LM-Valued Fuzzy Rough Sets and LM-Valued Fuzzy Transformation Systems
The goal of this contribution is to propose [Formula: see text]-valued [Formula: see text]-transforms, which are essentially the many-valued generalizations of the notion of lattic...