%0 Journal Article
%T Analysis on attribute reduction strategies of rough set<br>Analysis on Attribute Reduction Strategies of Rough Set
%A Wang Jue
%A and Miao Duoqian
%A <br>Wang Jue
%A Miao Duoqian
%J 计算机科学技术学报
%D 1998
%I 
%X 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.
%K Rough set
%K minimal attribute reduction<br>机器学习
%K 属性简化
%K 粗糙集
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=F57FEF5FAEE544283F43708D560ABF1B&aid=823F7DD829603068B3A0D92901FA2882&yid=8CAA3A429E3EA654&vid=FC0714F8D2EB605D&iid=0B39A22176CE99FB&sid=3A0155B37D8FF829&eid=C29816B2656377A7&journal_id=1000-9000&journal_name=计算机科学技术学报&referenced_num=48&reference_num=2