摘要
传统的二进制可分辨矩阵不适用于不相容决策表,而改进的二进制可分辨矩阵虽然适用于不相容决策表,但需要先进行等价类的计算.为了解决因决策表存在不相容性造成构建二进制可分辨矩阵要计算等价类的问题,提出一种二进制可分辨矩阵修正方法.首先对传统二进制可分辨矩阵进行分析,根据矩阵中各行的取值情况,得到修正论域;然后利用其对矩阵进行局部修正,得新的二进制可分辨矩阵,避免了等价类的计算,并证明了新二进制可分辨矩阵与改进的二进制可分辨矩阵是等价的;其次给出了基于新二进制可分辨矩阵的求核方法,并证明了所求核与基于正区域的核是等价的;最后通过实例证明了此方法的正确性.
The traditional binary discernibility matrix does not apply for incompatibility decision table. The improved binary discern- ibility matrix can apply but need to carry out the calculation of indiscernibility. In order to avoid computing indiscernibility while building binary discernibility matrix in incompatibility decision table, a new method of establishing binary discernibility matrix is pres- ented. Firstly, through analyzing traditional binary discernibility matrix, modified universe is put forward according to the value of every line in tha matrix. And a new binary discernibility matrix is got by using modified universe to modify traditional matrix, avoid computing indiscernibility. Also it is proved the new binary discernibility matrix is same to the improved matrix. Then, the method of core computation is proposed based on modified binary discernibility and it is proved that the core is equivalence the core and attribute reduction based on positive region. And the example is used to explain the correctness of the method at last.
出处
《小型微型计算机系统》
CSCD
北大核心
2013年第6期1437-1440,共4页
Journal of Chinese Computer Systems
基金
安徽省高校自然科学基金项目(KJ2011Z276
KJ2010B137)资助
安徽省高等学校优秀青年人才基金项目(2010SQRL137
2010SQRL138
2011SQRL123)资助
关键词
粗糙集
二进制可分辨矩阵
求核
修正论域
rough set
binary discernibility matrix
computing core
modified universe
