Journal
INFORMATION SCIENCES
Volume 177, Issue 17, Pages 3500-3518Publisher
ELSEVIER SCIENCE INC
DOI: 10.1016/j.ins.2007.02.041
Keywords
rough sets; covering rough sets; attribute reduction; discernibility matrix; consistent covering decision systems; inconsistent covering decision systems
Categories
Ask authors/readers for more resources
Traditional rough set theory is mainly used to extract rules from and reduce attributes in databases in which attributes are characterized by partitions, while the covering rough set theory, a generalization of traditional rough set theory, does the same yet characterizes attributes by covers. In this paper, we propose a way to reduce the attributes of covering decision systems, which are databases characterized by covers. First, we define consistent and inconsistent covering decision systems and their attribute reductions. Then, we state the sufficient and the necessary conditions for reduction. Finally, we use a discernibility matrix to design algorithms that compute all the reducts of consistent and inconsistent covering decision systems. Numerical tests on four public data sets show that the proposed attribute reductions of covering decision systems accomplish better classification performance than those of traditional rough sets. (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