摘要
属性约简是粗集理论研究的重要内容之一,计算所有属性约简已被证明是NP-hard问题,目前尚不存在一种非常有效的方法。基于依赖度的决策表属性约简算法,可同时适用于一致和不一致的决策表,实验结果表明,与Hu提出的属性约简算法相比,该算法不仅简单可行,而且具有较好的时间性能。
Attribute reduction is one of the most important content of the Rough Set Theory research. A new attribute reduction algorithm for both consistent and inconsistent decision tables is presented in this paper. Compared with the attribute reduction algorithm presented by Hu, the experfment result shoWs its advantages in its simplicity, practicality and less time consumption..
出处
《安庆师范学院学报（自然科学版）》
2008年第1期37-39,共3页
Journal of Anqing Teachers College(Natural Science Edition)
关键词
粗集
依赖度
属性约简
决策表
Rough set t Dependence degree
Attribute reduction
Decision table
