Related Experiment Video
Updated: Jul 20, 2025

06:51
The Modified Temptation Resistance Task: A Paradigm to Elicit Children's Strategic Lie-telling
Published on: April 6, 2018
8.5K
CD-BFT: Canonical Decomposition-Based Belief Functions Transformation in Possibility Theory
IEEE Transactions on Cybernetics
|August 1, 2023
Summary
This study introduces a novel belief function transformation to ensure consistent combination rules for possibility mass functions (PossMFs) and consonant mass functions. The new method maintains reversibility and improves information fusion.
Area of Science:
- Decision Theory
- Artificial Intelligence
- Information Fusion
Background:
- Subjective probability mass functions are often represented by qualitative Possibility Mass Functions (PossMFs).
- Existing transformations between PossMFs and consonant mass functions lack consistency in combination rules, hindering reversible transformations.
Purpose of the Study:
- To propose a novel belief function transformation method.
- To ensure consistency of combination rules between PossMFs and consonant mass functions.
- To extend the transformation to possibilistic belief structures.
Main Methods:
- A new belief function transformation is proposed, interpretable via Smets' and Pichon's canonical decompositions.
- The method is validated using combination rule consistency, the least commitment principle, and information fusion applications.
Main Results:
- The proposed transformation maintains the consistency of combination rules.
- Reversibility is achieved between PossMFs and consonant mass functions.
- The transformation is extended to possibilistic belief structures, clarifying the link between possibilistic and evidential information.
Conclusions:
- The novel transformation addresses limitations in existing methods, enabling reliable information fusion.
- This work provides a new perspective on the relationship between possibilistic and evidential information within belief function frameworks.
Related Concept Videos
Probability Laws
41.0K
Overview
41.0K
Parseval's Theorem
553
Parseval's theorem is a fundamental concept in signal processing and harmonic analysis. It asserts that for a periodic function, the average power of the signal over one period equals the sum of the squared magnitudes of all its complex Fourier coefficients. This theorem, named after Marc-Antoine Parseval, provides a powerful tool for analyzing the energy distribution in signals.
Interestingly, Parseval's theorem also holds for the trigonometric form of the Fourier series, which...
Interestingly, Parseval's theorem also holds for the trigonometric form of the Fourier series, which...
553
Pole and System Stability
330
The transfer function is a fundamental concept representing the ratio of two polynomials. The numerator and denominator encapsulate the system's dynamics. The zeros and poles of this transfer function are critical in determining the system's behavior and stability.
Simple poles are unique roots of the denominator polynomial. Each simple pole corresponds to a distinct solution to the system's characteristic equation, typically resulting in exponential decay terms in the system's...
Simple poles are unique roots of the denominator polynomial. Each simple pole corresponds to a distinct solution to the system's characteristic equation, typically resulting in exponential decay terms in the system's...
330
Deductive Reasoning
55.5K
Deductive reasoning, or deduction, is the type of logic used in hypothesis-based science. In deductive reasoning, the pattern of thinking moves in the opposite direction as compared to inductive reasoning, which means that it uses a general principle or law to predict specific results. From those general principles, a scientist can deduce and predict the specific results that would be valid as long as the general principles are valid.
For example, a researcher can deduce specific predictions...
For example, a researcher can deduce specific predictions...
55.5K
Probability Distributions
7.3K
The probability of a random variable x is the likelihood of its occurrence. A probability distribution represents the probabilities of a random variable using a formula, graph, or table. There are two types of probability distribution– discrete probability distribution and continuous probability distribution.
A discrete probability distribution is a probability distribution of discrete random variables. It can be categorized into binomial probability distribution and Poisson...
A discrete probability distribution is a probability distribution of discrete random variables. It can be categorized into binomial probability distribution and Poisson...
7.3K
Binomial Probability Distribution
11.1K
A binomial distribution is a probability distribution for a procedure with a fixed number of trials, where each trial can have only two outcomes.
The outcomes of a binomial experiment fit a binomial probability distribution. A statistical experiment can be classified as a binomial experiment if the following conditions are met:
There are a fixed number of trials. Think of trials as repetitions of an experiment. The letter n denotes the number of trials.
There are only two possible outcomes,...
The outcomes of a binomial experiment fit a binomial probability distribution. A statistical experiment can be classified as a binomial experiment if the following conditions are met:
There are a fixed number of trials. Think of trials as repetitions of an experiment. The letter n denotes the number of trials.
There are only two possible outcomes,...
11.1K

