首页 | 本学科首页   官方微博 | 高级检索  
     

Analysis on Attribute Reduction Strategies of Rough Set
作者姓名:Wang Jue  Miao Duoqian
作者单位:[1]InstituteofAutomation,ChineseAcademyofSciences,Beijing100080,P,R.China [2]InstituteofAutomation,ChineseA
摘    要:Severa strategies for the minimal attribute reduction with polynomial time complexity(O(n^k)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.

关 键 词:机器学习  属性简化  粗糙集

Analysis on attribute reduction strategies of rough set
Wang Jue,Miao Duoqian.Analysis on Attribute Reduction Strategies of Rough Set[J].Journal of Computer Science and Technology,1998,13(2):189-193.
Authors:Jue Wang  Duoqian Miao
Affiliation:Institute of Automation; Chinese Academy of Sciences; Beijing 100080; P.R.China;
Abstract:Several strategies for the minimal attribute reduction with polynomial time complexity (O(n k )) 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.
Keywords:Rough set  minimal attribute reduction  
本文献已被 CNKI 维普 SpringerLink 等数据库收录!
点击此处可从《计算机科学技术学报》浏览原始摘要信息
点击此处可从《计算机科学技术学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号