Affiliations: School of Science, Beijing University of Posts and Telecommunications, Beijing 100876, China | State Key Laboratory of Networking and Switching, Beijing University of Posts and Telecommunications, Beijing 100876, China. [email protected]
Note: [] Address for correspondence: School of Science, Beijing University of Posts and Telecommunications, Beijing 100876, China This work was supported by the National Natural Science Foundation of China under Grants 60821001, 60873191, and 60903152. The author would like to thank the anonymous reviewers for their helpful comments.
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 instances of our strong Pawlak roughness measure and introduce three more strong Pawlak roughness measures as well. The advantage of our axiomatic approach is that some properties of a roughness measure follow immediately as soon as the measure satisfies the relevant axiomatic definition.
Keywords: Accuracy measure, approximation, partition measure, roughness measure, rough set
