Attribute Reduction Based on Consistent Covering Rough Set and Its Application
As an important processing step for rough set theory, attribute reduction aims at eliminating data redundancy and drawing useful information. Covering rough set, as a generalization of classical rough set theory, has attracted wide attention on both theory and application. By using the covering roug...
Saved in:
Main Authors: | Jianchuan Bai, Kewen Xia, Yongliang Lin, Panpan Wu |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2017-01-01
|
Series: | Complexity |
Online Access: | http://dx.doi.org/10.1155/2017/8986917 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Rough sets theory and its extensions for attribute reduction: a review
by: Sadegh Eskandari
Published: (2021-06-01) -
δ-Cut Decision-Theoretic Rough Set Approach: Model and Attribute Reductions
by: Hengrong Ju, et al.
Published: (2014-01-01) -
Geometric Lattice Structure of Covering and Its Application to Attribute Reduction through Matroids
by: Aiping Huang, et al.
Published: (2014-01-01) -
Uncertainty Measurement and Attribute Reduction Algorithm Based on Kernel Similarity Rough Set Model
by: Baoguo Chen, et al.
Published: (2022-01-01) -
Multigranulations Rough Set Method of Attribute Reduction in Information Systems Based on Evidence Theory
by: Minlun Yan
Published: (2014-01-01)