Repeatable Random Permutation Set
Wenran Yang, Yong Deng

TL;DR
This paper introduces Repeatable Random Permutation Set (R^2PS), extending RPS to include repeated items, with new combination rules and properties, demonstrated through a decision support system application.
Contribution
The paper proposes R^2PS, a novel extension of RPS that accounts for repeated items, along with new combination rules and their theoretical properties.
Findings
Proposed R^2PS effectively models repeated items.
New junctional sum combination rules have desirable properties.
Application demonstrates practical effectiveness of R^2PS.
Abstract
Random permutation set (RPS), as a recently proposed theory, enables powerful information representation by traversing all possible permutations. However, the repetition of items is not allowed in RPS while it is quite common in real life. To address this issue, we propose repeatable random permutation set () which takes the repetition of items into consideration. The right and left junctional sum combination rules are proposed and their properties including consistency, pseudo-Matthew effect and associativity are researched. Based on these properties, a decision support system application is simulated to show the effectiveness of .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCognitive Computing and Networks · Data Management and Algorithms · Text and Document Classification Technologies
