摘要
本文研究了二进制差别矩阵中核属性的性质,指出并证明了二进制差别矩阵求核的理论依据,在此基础上给出了一种二进制差别矩阵的修正方法及求核方法。该方法不仅适用于任何决策表信息系统(相容决策表和不相容决策表),而且有效地降低了计算代价。
This paper makes a deep study of the core in the binary discernibility matrix, proposes and provesthe key to computing the core in the binary discernibility matrix. Besides,a new core computing method based on the improved binary discernibility matrix is presented. The method is suitable for any decision tables (consistent and inconsistent decision tables) ,and a theoretical analysis shows the method is effective.
出处
《计算机工程与科学》
CSCD
2007年第11期86-89,共4页
Computer Engineering & Science
关键词
粗糙集
二进制差别矩阵
核
修正
rough set
binary discernibility matrix
core
improvement