Journal
INFORMATION SCIENCES
Volume 180, Issue 2, Pages 274-287Publisher
ELSEVIER SCIENCE INC
DOI: 10.1016/j.ins.2009.08.031
Keywords
Axioms; Covering based approximation operators; Covering generalized rough sets; Rough sets
Categories
Funding
- National Natural Science Foundation of China [10971186, 10671173, 60673096]
- Foundation of Fujian Province in China [2008F5066, JA09165]
- Natural Science Foundation of Zhejiang Province in China [Y107262]
Ask authors/readers for more resources
Rough set theory is a useful tool for dealing with inexact, uncertain or vague knowledge in information systems. The classical rough set theory is based on equivalence relations and has been extended to covering based generalized rough set theory. This paper investigates three types of covering generalized rough sets within an axiomatic approach. Concepts and basic properties of each type of covering based approximation operators are first reviewed. Axiomatic systems of the covering based approximation operators are then established. The independence of axiom set for characterizing each type of covering based approximation operators is also examined. As a result, two open problems about axiomatic characterizations of covering based approximation operators proposed by Zhu and Wang in (IEEE Transactions on Knowledge and Data Engineering 19(8) (2007) 1131-1144, Proceedings of the Third IEEE International Conference on Intelligent Systems, 2006, pp. 444-449) are solved. (C) 2009 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