Journal
INTERNATIONAL JOURNAL OF APPROXIMATE REASONING
Volume 50, Issue 3, Pages 521-528Publisher
ELSEVIER SCIENCE INC
DOI: 10.1016/j.ijar.2008.11.001
Keywords
Rough sets; Generalized rough sets; Granular computing; Approximation operators; Coverings; Topology
Categories
Funding
- Key Project of the Chinese Ministry of Education [108133]
- Project of the Beijing Language and Culture University
Ask authors/readers for more resources
Rough set theory is an important technique in knowledge discovery in databases. in covering-based rough sets, many types of rough set models were established in recent years. In this paper, we compare the covering-based rough sets defined by Zhu with ones defined by Xu and Zhang. We further explore the properties and structures of these types of rough set models. We also consider the reduction of coverings. Finally, the axiomatic systems for the lower and upper approximations defined by Xu and Zhang are constructed. (C) 2008 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
Share Paper
