A comparison of Pawlak's and Skowron-Stepaniuk's approximation of concepts

Authors:
Anna Gomolińska
Affiliations:
University of Białystok, Department of Mathematics, Białystok, Poland
Venue:
Transactions on rough sets VI
Year:
2007

Citing 5
Cited 0

Variable precision rough set model

Journal of Computer and System Sciences
Tolerance approximation spaces

Fundamenta Informaticae - Special issue: rough sets
Rough Sets: Theoretical Aspects of Reasoning about Data

Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Mereology

ISMIS '94 Proceedings of the 8th International Symposium on Methodologies for Intelligent Systems
Approximation spaces and information granulation

Transactions on Rough Sets III

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this article, we compare mappings of Pawlak's lower and upper approximations of concepts with those proposed by Skowron and Stepaniuk. It is known that both approaches coincide for the standard rough inclusion, so we consider the case of an arbitrary rough inclusion function. Even if the approximation space investigated is based on an arbitrary non-empty binary relation, the lower approximation mappings are equal in both approaches. Nevertheless, the upper approximation mappings are different in general.