Journal
INFORMATION SCIENCES
Volume 177, Issue 22, Pages 4997-5011Publisher
ELSEVIER SCIENCE INC
DOI: 10.1016/j.ins.2007.05.037
Keywords
rough set; lower approximation; upper approximation; binary relation; fuzzy set; granular computing
Categories
Ask authors/readers for more resources
Rough set theory has been proposed by Pawlak as a tool for dealing with the vagueness and granularity in information systems. The core concepts of classical rough sets are lower and upper approximations based on equivalence relations. This paper studies arbitrary binary relation based generalized rough sets. In this setting, a binary relation can generate a lower approximation operation and an upper approximation operation, but some of common properties of classical lower and upper approximation operations are no longer satisfied. We investigate conditions for a relation under which these properties hold for the relation based lower and upper approximation operations. This paper also explores the relationships between the lower or the upper approximation operation generated by the intersection of two binary relations and those generated by these two binary relations, respectively. Through these relationships, we prove that two different binary relations will certainly generate two different lower approximation operations and two different upper approximation operations. (C) 2007 Elsevier Inc. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available