Skip to main content
Log in

Maximum entropy of random permutation set

  • Foundation, algebraic, and analytical methods in soft computing
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

Recently, a new type of set, called random permutation set (RPS), is proposed by considering all the permutations of elements in a certain set. For measuring the uncertainty of RPS, the entropy of RPS is presented. However, the maximum entropy principle of RPS entropy has not been discussed. To address this issue, this paper presents the maximum entropy of RPS. The analytical solution of maximum RPS entropy and its PMF condition are proven and discussed. Besides, numerical examples are used to illustrate the maximum RPS entropy. The results show that the maximum RPS entropy is compatible with the maximum Deng entropy and the maximum Shannon entropy. Moreover, in order to further apply RPS entropy and maximum RPS entropy in practical fields, a comparative analysis of the choice of using Shannon entropy, Deng entropy, and RPS entropy is also carried out.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

Data availability

All data and materials generated or analyzed during this study are included in this article.

Code availability

The code of the current study is available from the corresponding author on reasonable request.

References

Download references

Acknowledgements

The authors greatly appreciate the editor’s encouragement and the reviews’ suggestions. The work was partially supported by National Natural Science Foundation of China (Grant No. 61973332) and JSPS Invitational Fellowships for Research in Japan (Short-term).

Funding

The work was partially supported by National Natural Science Foundation of China (Grant No. 61973332) and JSPS Invitational Fellowships for Research in Japan (Short-term).

Author information

Authors and Affiliations

Authors

Contributions

All authors contributed to the study conception and design. All authors performed material preparation, data collection, and analysis. Jixiang Deng wrote the first draft of the paper. All authors contributed to the revisions of the paper. All authors read and approved the final manuscript.

Corresponding author

Correspondence to Yong Deng.

Ethics declarations

Conflict of interest

All the authors certify that there is no conflict of interest with any individual or organization for this work.

Ethics approval

This article does not contain any studies with human participants or animals performed by any of the authors.

Consent to participate

Informed consent was obtained from all individual participants included in the study.

Consent for publication

The participant has consented to the submission of the case report to the journal.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Deng, J., Deng, Y. Maximum entropy of random permutation set. Soft Comput 26, 11265–11275 (2022). https://doi.org/10.1007/s00500-022-07351-x

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-022-07351-x

Keywords

Navigation