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...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi-Wiley
2017-01-01
|
| Series: | Complexity |
| Online Access: | http://dx.doi.org/10.1155/2017/8986917 |
| Summary: | 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 rough set, the process of continuous attribute discretization can be avoided. Firstly, this paper focuses on consistent covering rough set and reviews some basic concepts in consistent covering rough set theory. Then, we establish the model of attribute reduction and elaborate the steps of attribute reduction based on consistent covering rough set. Finally, we apply the studied method to actual lagging data. It can be proved that our method is feasible and the reduction results are recognized by Least Squares Support Vector Machine (LS-SVM) and Relevance Vector Machine (RVM). Furthermore, the recognition results are consistent with the actual test results of a gas well, which verifies the effectiveness and efficiency of the presented method. |
|---|---|
| ISSN: | 1076-2787 1099-0526 |