基于修正的差别矩阵的高效求核方法  

Efficient method for computing core based on improved discernibility matrix

作　　者：张振琳[1] 黄明[1] 

机构地区：[1]大连交通大学软件学院,辽宁大连116028

出　　处：《计算机工程与设计》2008年第13期3425-3428,共4页Computer Engineering and Design

摘　　要：在决策表信息系统的属性约简中,利用差别矩阵求核是一种重要的方法。对于不相容决策表而言,差别矩阵求核有时会产生错误,目前,已提出了一些改进方法克服这个错误,但这些方法都具有较高的计算复杂度。对此,研究了差别矩阵中核属性的性质,指出并证明了差别矩阵求核的理论依据,在此基础上,给出了一种差别矩阵的修正方法及求核方法。该方法不仅适用于任何决策表信息系统(相容决策表和不相容决策表),而且有效降低了计算代价。Computing the core of the decision table based on the discemibility matrix is considered to be an important content of attribute reduction in rough set. Computing the core of an inconsistent decision table based on the discernibility matrix may lead to mistakes. In order to correct the error, some modified discernibility matrixes are introduced, but the efficient of these approaches is not good. To improve this, a deep study of the core is made in the discernibility matrix, a key of computing the core in the discernibility matrix is proposed and proved. On the foundation, a new computing core method based on the improved discernibility matrix is presented. The method is suitable for any decision tables （consistent and inconsistent decision tables）, and theoretical analysis show the method is effective.

关 键 词：粗糙集 差别矩阵 不相容决策表 核 修正 

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