An axiomatic approach to the roughness measure of rough sets
Ping Zhu

TL;DR
This paper introduces an axiomatic framework for roughness measures in rough set theory, unifying existing measures and proposing new ones with desirable properties like monotonicity.
Contribution
It provides an axiomatic foundation for roughness measures, unifies existing approaches, and introduces new strong Pawlak roughness measures with proven properties.
Findings
Existing roughness measures are special cases of the proposed framework.
The axiomatic approach simplifies deriving properties of roughness measures.
New strong Pawlak roughness measures are introduced with advantageous properties.
Abstract
In Pawlak's rough set theory, a set is approximated by a pair of lower and upper approximations. To measure numerically the roughness of an approximation, Pawlak introduced a quantitative measure of roughness by using the ratio of the cardinalities of the lower and upper approximations. Although the roughness measure is effective, it has the drawback of not being strictly monotonic with respect to the standard ordering on partitions. Recently, some improvements have been made by taking into account the granularity of partitions. In this paper, we approach the roughness measure in an axiomatic way. After axiomatically defining roughness measure and partition measure, we provide a unified construction of roughness measure, called strong Pawlak roughness measure, and then explore the properties of this measure. We show that the improved roughness measures in the literature are special…
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
TopicsRough Sets and Fuzzy Logic · Multi-Criteria Decision Making · Infrastructure Maintenance and Monitoring
