Analysis on Attribute Reduction Strategies of Rough Set  

作　　者：王珏 苗夺谦 

机构地区：[1]InstituteofAutomation,ChineseAcademyofSciences,Beijing100080,P,R.China [2]InstituteofAutomation,ChineseA

出　　处：《Journal of Computer Science & Technology》1998年第2期189-192,F003,共5页计算机科学技术学报（英文版）

摘　　要：Several strategies for the minimal attribute reduction with polynomial time complexity (O(nk)) have been developed in rough set theory. Are they complete? While investigating the attribute reduction strategy based on the discernibility matrix (DM),a counterexample is constructed theoretically, which demonstrates that these strategies are all incomplete with respect to the minimal reduction.Several strategies for the minimal attribute reduction with polynomial time complexity (O(nk)) have been developed in rough set theory. Are they complete? While investigating the attribute reduction strategy based on the discernibility matrix (DM),a counterexample is constructed theoretically, which demonstrates that these strategies are all incomplete with respect to the minimal reduction.

关 键 词：Rough set minimal attribute reduction 

分 类 号：TP181[自动化与计算机技术—控制理论与控制工程]