The content delves into the concept of Random Permutation Sets (RPS) and their entropy, proposing a new envelope function to understand uncertainty. It discusses the significance of ordered information in managing uncertainty and introduces a limit form for RPS entropy. The study compares different entropies like Shannon entropy, Deng entropy, and RPS entropy, highlighting their relationships and applications. Additionally, it presents numerical examples to validate the proposed envelope function's efficiency in approximating maximum RPS entropy.
To Another Language
from source content
arxiv.org
Key Insights Distilled From
by Jiefeng Zhou... at arxiv.org 03-12-2024
https://arxiv.org/pdf/2403.06206.pdfDeeper Inquiries