改进的基于简化二进制分辨矩阵的属性约简方法  

Improved Algorithms for Attribute Reduction Based on Simple Binary Discernibility Matrix

作　　者：王亚琦[1] 范年柏[1] 

机构地区：[1]湖南大学信息科学与工程学院,长沙410082

出　　处：《计算机科学》2015年第6期210-215,共6页Computer Science

摘　　要：在基于二进制分辨矩阵的属性约简方法中,删除法即从属性全集中依次删除冗余属性,直至剩余的属性集是一个最小约简。针对传统的基于二进制分辨矩阵的删除法效率较低且得不到最小约简的问题,提出一种改进的二进制分辨矩阵属性约简方法。首先对决策表进行简化,然后给出一种改进的简化二进制分辨矩阵方法;其次通过一个新的属性约简度量方法一次性删除多个属性,并从理论上分析了该方法的可行性;最后通过实验证明了得到的约简结果是最小约简。In the algorithms for attribute reduction based on simple binary discernibility matrix, elimination means that redundant attributes are excluded from reduct sets one by one until the last is a minimum reduet. The traditional elimi- nation based on simple binary discernibility has the following shortcomings：lower efficiency and being not able to get the optimal solution. In view o{ those problems, an improved algorithm for attribute reduction based on simple binary discernibility matrix was presented. Firstly, the decision table was simplified. Secondly, an improved algorithm to simplify binary discernibility matrix was proposed. Lastly, for attribute reduction, we presented a new measure which can delete more than one redundant attributes and proved the feasibility of the measure. Moreover, the experiment results prove the correctness of the method.

关 键 词：粗糙集 二进制分辨矩阵 属性约简 决策系统 

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