一种新的基于简化二进制可辨矩阵的相对约简算法  

Algorithm for relative reduction based on simplifried binary discernibility matrix

作　　者：蒙祖强[1] 史忠植[1] 

机构地区：[1]中国科学院计算技术研究所

出　　处：《控制与决策》2008年第9期976-980,共5页Control and Decision

基　　金：国家自然科学基金项目(60435010,60775035);广西自治区教育厅科研项目(桂教科研[2006]26号)

摘　　要：提出一种基于简化二进制可辨矩阵的启发式相对约简算法,其特点是在扫描数据库的过程中形成规模很小的简化二进制可辨矩阵.基于简化二进制可辨矩阵构造了面向相对约简的矩阵变换方法,通过这种矩阵变换可从二进制可辨矩阵直接高效地导出相对约简.理论分析和实验结果说明和验证了该算法具有相对高效性和强可操作性等优点.An algorithm for relative attribute reduction based on simplified binary discernibility matrix（SBDM） is proposed. SBDM, which is relatively small in size, is constructed during the process of scanning data set. Then matrix transforms on SBDM for relative attribute reduction are designed. By using this kind of transforms, relative reduction can be efficiently accomplished. A theoretical and experimental analysis shows that the proposed algorithm has good maneuverability and high efficiency.

关 键 词：决策系统 相对约简 二进制可辨矩阵 分辨矩阵 

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