摘要
Attribute reduction has become an important step in pattern recognition and machine learning tasks. Covering rough sets, as a generalization of classical rough sets, have attracted wide attention in both theory and application. This paper provides a novel method for attribute reduction based on covering rough sets. We review the concepts of consistent and inconsistent covering decision systems and their reducts and we develop a judgment theorem and a discernibility matrix for each type of covering decision system. Furthermore, we present some basic structural properties of attribute reduction with covering rough sets. Based on a discernibility matrix, we develop a heuristic algorithm to find a subset of attributes that approximate a minimal reduct Finally, the experimental results for UCI data sets show that the prop
- 出版日期2014-1-1
- 单位河北大学; 天津大学; 渤海大学; 华北电力大学(保定); 华北电力大学