Journal
KNOWLEDGE-BASED SYSTEMS
Volume 85, Issue -, Pages 316-321Publisher
ELSEVIER
DOI: 10.1016/j.knosys.2015.05.018
Keywords
Covering rough sets; Left and right relative sets; Lower and upper approximations; Neighborhoods; Reduction
Categories
Funding
- National Natural Science Foundation of China [60973148, 61272031]
Ask authors/readers for more resources
Covering rough sets are a generalization of Pawlak rough sets, in which a partition of the universal set induced-by an equivalence relation is replaced by a covering. In this paper, covering rough sets are transformed into generalized rough sets induced by binary relations. The paper discusses three theoretical topics. First, we consider a special type of covering in which the neighborhoods form a reduction of the covering, and we obtain necessary and sufficient conditions for neighborhoods in a covering form a reduction of the covering. Second, we study another special type of covering, and give conditions for the covering lower and upper approximations to be dual to each other. Finally, we give an axiomatic system that characterizes the lower and upper approximations of rough sets based on a partial order. (C) 2015 Elsevier B.V. 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