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
Interpretable Encoding of Densities Using Possibilistic Logic
Interpretable Encoding of Densities Using Possibilistic Logic
Probability density estimation from data is a widely studied problem. Often, the primary goal is to faithfully mimic the underlying empirical density. Having an interpretable model...
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...
Exploring the Effectiveness of Binary-Valued and Real-Valued Representations for Cross-Modal Retrieval
Exploring the Effectiveness of Binary-Valued and Real-Valued Representations for Cross-Modal Retrieval
AbstractCross-modal retrieval(CMR) refers to the task of retrieving semantically related items across different modalities. For example, given an image query, the task is to retrie...
The Geography of Cyberspace
The Geography of Cyberspace
The Virtual and the Physical
The structure of virtual space is a product of the Internet’s geography and technology. Debates around the nature of the virtual — culture, s...
Bicomplex Projection Rule for Complex-Valued Hopfield Neural Networks
Bicomplex Projection Rule for Complex-Valued Hopfield Neural Networks
A complex-valued Hopfield neural network (CHNN) with a multistate activation function is a multistate model of neural associative memory. The weight parameters need a lot of memory...
An Adiabatic Method to Train Binarized Artificial Neural Networks
An Adiabatic Method to Train Binarized Artificial Neural Networks
Abstract
An artificial neural network consists of neurons and synapses. Neuron gives output based on its input according to non-linear activation functions such as the Sigm...
Syntactic Possibilistic Goal Generation
Syntactic Possibilistic Goal Generation
We propose syntactic deliberation and goal election algorithms for possibilistic agents which are able to deal with incomplete and imprecise information in a dynamic world. We show...
Network Traffic Anomaly Detection Based on Incremental Possibilistic Clustering Algorithm
Network Traffic Anomaly Detection Based on Incremental Possibilistic Clustering Algorithm
Abstract
This paper proposed a Mahalanobis distance based Incremental Possibilistic Clustering (IPC) algorithm to detect abnormal flow. Firstly, the attributes of ne...