Computer Science – Artificial Intelligence
Scientific paper
2009-11-28
Fundamenta Informaticae, 109(4): 463-480, 2011
Computer Science
Artificial Intelligence
to appear in the Fundamenta Informaticae
Scientific paper
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.
No associations
LandOfFree
An axiomatic approach to the roughness measure of rough sets does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with An axiomatic approach to the roughness measure of rough sets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An axiomatic approach to the roughness measure of rough sets will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-18449