Core Concepts
RPSエントロピーの限界を導出し、計算複雑性を低減する新しい概念を提案。
Abstract
最大ランダム置換セット(RPS)エントロピーの限界に関する研究。新しい概念で計算複雑性を低減し、物理的意味を明らかにする。
Uncertainty management is a significant issue in various research fields. Dempster-Shafer evidence theory extends probability theory to handle uncertain information on the power set of the event space. Deng proposed the Random Permutation Set (RPS) as an extension compatible with DSET and probability theory. The entropy of RPS measures uncertainty efficiently, providing insights into ordered data handling. The limit form of the envelope of RPS entropy converges to e × (N!)2 as N approaches infinity, revealing a connection to fundamental mathematical concepts like the constant e and factorial. The proposed envelope simplifies computational complexity significantly compared to existing methods.
Stats
N → ∞, 限界形式: e × (N!)2
求められた結果は、計算複雑性が大幅に低下することを示す。